kurobako 0.2.10

A black-box optimization benchmarking framework
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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73

use std::cmp::Ordering;
use std::iter;

pub type Score = usize;

#[derive(Debug)]
pub struct Borda<T> {
    items: Vec<(T, Score)>,
}
impl<T: Ord> Borda<T> {
    pub fn new<I>(items: I) -> Self
    where
        I: Iterator<Item = T>,
    {
        Self {
            items: items.zip(iter::repeat(0)).collect(),
        }
    }

    pub fn compete<F>(&mut self, f: F)
    where
        F: Fn(&T, &T) -> Ordering,
    {
        for i in 0..self.items.len() {
            for j in (0..self.items.len()).filter(|&j| j != i) {
                if f(&self.items[i].0, &self.items[j].0) == Ordering::Less {
                    self.items[i].1 += 1;
                }
            }
        }
    }

    pub fn scores(&self) -> impl '_ + Iterator<Item = Score> {
        self.items.iter().map(|t| t.1)
    }
}

#[derive(Debug)]
pub struct Firsts<T> {
    items: Vec<(T, Score)>,
}
impl<T: Ord> Firsts<T> {
    pub fn new<I>(items: I) -> Self
    where
        I: Iterator<Item = T>,
    {
        Self {
            items: items.zip(iter::repeat(0)).collect(),
        }
    }

    pub fn compete<F>(&mut self, f: F)
    where
        F: Fn(&T, &T) -> Ordering,
    {
        for i in 0..self.items.len() {
            let mut is_first = true;
            for j in (0..self.items.len()).filter(|&j| j != i) {
                if f(&self.items[i].0, &self.items[j].0) == Ordering::Greater {
                    is_first = false;
                    break;
                }
            }
            if is_first {
                self.items[i].1 += 1;
            }
        }
    }

    pub fn scores(&self) -> impl '_ + Iterator<Item = Score> {
        self.items.iter().map(|t| t.1)
    }
}