fn interval_lower_bound(a: &Interval, b: &Interval) -> Option<i32> {
    let a = normalize_interval(a);
    let b = normalize_interval(b);
    let i0 = max(a.0, b.0);
    let i1 = min(a.1, b.1);
    if i0 <= i1 {
        Some(i0)
    } else {
        None
    }
}
// Find some lower bound of an intersection interval, or None.
Find some lower bound of an intersection interval, or None.
Find some lower bound of an intersection interval or None .
fn interval_lower_bound(a: &Interval, b: &Interval) -> Option<i32> {
    let a = normalize_interval(a);
    let b = normalize_interval(b);
    let i0 = max(a.0, b.0);
    let i1 = min(a.1, b.1);
    if i0 <= i1 {
        Some(i0)
    } else {
        None
    }
}
fn interval_lower_bound ( a : & Interval , b : & Interval ) -> Option < i32 > { let a = normalize_interval ( a ) ; let b = normalize_interval ( b ) ; let i0 = max ( a . 0 , b . 0 ) ; let i1 = min ( a . 1 , b . 1 ) ; if i0 <= i1 { Some ( i0 ) } else { None } }
Find some lower bound of an intersection interval, or None.
Find some lower bound of an intersection interval or None .
a
&Interval
b
&Interval