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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149

use std::cmp::min;

const SMALL: u64 = 5;

struct Minimizer<'a, F: 'a> {
    criterion: &'a mut F,
    best: u64,
}

impl<'a, F, T> Minimizer<'a, F>
where
    F: 'a + FnMut(u64) -> Result<bool, T>,
{
    fn test(&mut self, candidate: u64) -> Result<bool, T> {
        if candidate == self.best {
            return Ok(true);
        }
        if candidate > self.best {
            return Ok(false);
        }
        let result = (self.criterion)(candidate)?;
        if result {
            self.best = candidate;
        }
        Ok(result)
    }

    fn modify<G>(&mut self, g: G) -> Result<bool, T>
    where
        G: Fn(u64) -> u64,
    {
        let x = g(self.best);
        self.test(x)
    }
}

pub fn minimize_integer<F, T>(start: u64, mut criterion: F) -> Result<u64, T>
where
    F: FnMut(u64) -> Result<bool, T>,
{
    if start == 0 {
        return Ok(start);
    }

    for i in 0..min(start, SMALL) {
        if criterion(i)? {
            return Ok(i);
        }
    }
    if start <= SMALL {
        return Ok(start);
    }

    let mut minimizer = Minimizer {
        best: start,
        criterion: &mut criterion,
    };

    loop {
        if !minimizer.modify(|x| x >> 1)? {
            break;
        }
    }

    for i in 0..64 {
        minimizer.modify(|x| x ^ (1 << i))?;
    }

    assert!(minimizer.best >= SMALL);

    for i in 0..64 {
        let left_mask = 1 << i;
        let mut right_mask = left_mask >> 1;
        while right_mask != 0 {
            minimizer.modify(|x| {
                if x & left_mask == 0 || x & right_mask != 0 {
                    x
                } else {
                    x ^ (right_mask | left_mask)
                }
            })?;
            right_mask >>= 1;
        }
    }

    if !minimizer.modify(|x| x - 1)? {
        return Ok(minimizer.best);
    }

    let mut lo = 0;
    let mut hi = minimizer.best;
    while lo + 1 < hi {
        let mid = lo + (hi - lo) / 2;
        if minimizer.test(mid)? {
            hi = mid;
        } else {
            lo = mid;
        }
    }

    Ok(minimizer.best)
}

#[cfg(test)]
mod tests {
    use super::*;

    fn non_failing_minimize<F>(start: u64, criterion: F) -> u64
    where
        F: Fn(u64) -> bool,
    {
        let mut best = start;

        loop {
            let ran: Result<u64, ()> = minimize_integer(best, |x| Ok(criterion(x)));
            let result = ran.unwrap();
            assert!(result <= best);
            if result == best {
                return best;
            }
            best = result;
        }
    }

    #[test]
    fn minimize_down_to() {
        let n = non_failing_minimize(100, |x| x >= 10);
        assert_eq!(n, 10);
    }

    #[test]
    fn unset_relevant_bits() {
        let x = 0b101010101010;
        let y = 0b111111111111;
        let n = non_failing_minimize(y, |k| k & x == x);
        assert_eq!(n, x);
    }

    #[test]
    fn sort_bits() {
        let x: u64 = 0b1011011011000111;
        let y: u64 = 0b0000001111111111;
        let c = x.count_ones();
        assert_eq!(c, y.count_ones());

        let n = non_failing_minimize(x, |k| k.count_ones() == c);
        assert_eq!(y, n);
    }
}