Function binary_search 

pub fn binary_search<T, F>(f: F, ok: T, err: T) -> T
where
    T: Bisect,
    F: FnMut(&T) -> bool,

binary search for monotone segment

if ok < err then search [ok, err) where t(ok), t, t, …. t, t(ret), f, … f, f, f, err

if err < ok then search (err, ok] where err, f, f, f, … f, t(ret), … t, t, t(ok)

Examples found in repository

crates/competitive/src/algorithm/chromatic_number.rs (line 49)

    pub fn chromatic_number(&self) -> usize {
        binary_search(|&k| self.k_colorable(k), self.n, 0)
    }

crates/competitive/src/algorithm/binary_search.rs (line 101)

    fn position_bisect(&self, mut f: impl FnMut(&T) -> bool) -> usize {
        binary_search(|i| f(&self[*i as usize]), self.len() as i64, -1) as usize
    }
    fn rposition_bisect(&self, mut f: impl FnMut(&T) -> bool) -> usize {
        binary_search(|i| f(&self[i - 1]), 0, self.len() + 1)
    }

crates/library_checker/src/number_theory/min_of_mod_of_linear.rs (lines 11-15)

pub fn min_of_mod_of_linear(reader: impl Read, mut writer: impl Write) {
    let s = read_all_unchecked(reader);
    let mut scanner = Scanner::new(&s);
    scan!(scanner, t, query: [(i64, u64, i64, i64)]);
    for (n, m, a, b) in query.take(t) {
        let x = binary_search(
            |&x| floor_sum_range_freq(0, n, a, b, m, 0..x + 1) > 0,
            m as i64 - 1,
            -1,
        );
        writeln!(writer, "{}", x).ok();
    }
}