pub fn optimality_range(&self) -> Option<RangeInclusive<T>> {
        if self.approx_factor.is_nan() {
            return None;
        }
        let start = self.value / T::try_from(self.approx_factor).ok()?;
        Some(start..=self.value)
    }
/// For an approximate algorithm returns an inclusive range of where the optimal schedule value
/// is, otherwise `None` is returned (whenever `approx_factor.is_nan()`).
///
/// # Example
/// ```rust
/// # extern crate makespan;
/// use std::time::Duration;
/// use makespan::Stats;
///
/// let stats = Stats::approx(11., 1.4444444444444444, 3, 7, Duration::from_secs(1));
///
/// let range = stats.optimality_range().unwrap();
/// assert!(range.contains(&9.));
/// ```
For an approximate algorithm returns an inclusive range of where the optimal schedule value
is, otherwise `None` is returned (whenever `approx_factor.is_nan()`).
For an approximate algorithm returns an inclusive range of where the optimal schedule value is otherwise ` None ` is returned ( whenever ` approx_factor . is_nan () ` ) .
pub fn optimality_range(&self) -> Option<RangeInclusive<T>> {
        if self.approx_factor.is_nan() {
            return None;
        }
        let start = self.value / T::try_from(self.approx_factor).ok()?;
        Some(start..=self.value)
    }
pub fn optimality_range ( & self ) -> Option < RangeInclusive < T > > { if self . approx_factor . is_nan ( ) { return None ; } let start = self . value / T :: try_from ( self . approx_factor ) . ok ( ) ? ; Some ( start ..= self . value ) }
For an approximate algorithm returns an inclusive range of where the optimal schedule value
is, otherwise `None` is returned (whenever `approx_factor.is_nan()`).
For an approximate algorithm returns an inclusive range of where the optimal schedule value is otherwise ` None ` is returned ( whenever ` approx_factor . is_nan () ` ) .
&self
&self
example
None
extern crate makespan;
use std::time::Duration;
use makespan::Stats.



let range = stats.optimality_range().unwrap();
assert!(range.contains(&9.));
```
use std :: time :: Duration ; use makespan :: Stats . let range = stats . optimality_range () . unwrap () ; assert! ( range . contains ( &9 . )) ; ` ` `