Function ternary_search 

pub fn ternary_search<K, V, F>(range: RangeInclusive<K>, f: F) -> (K, V)
where
    K: Trisect,
    V: PartialOrd,
    F: FnMut(K) -> V,

Returns the element that gives the minimum value from the strictly concave up function and the minimum value.

Examples found in repository

crates/competitive/src/algorithm/ternary_search.rs (line 147)

pub fn piecewise_ternary_search<const N: usize, K, V, F>(piece: [K; N], mut f: F) -> (K, V)
where
    K: Trisect,
    V: PartialOrd,
    F: FnMut(K) -> V,
{
    piece
        .windows(2)
        .map(|w| ternary_search(w[0].clone()..=w[1].clone(), &mut f))
        .min_by(|a, b| a.1.partial_cmp(&b.1).unwrap())
        .unwrap_or_else(|| (piece[0].clone(), f(piece[0].clone())))
}