fn guess_min(low: Bound, high: Bound) -> f64
{
    // NOTE: I was expecting unit tests to reveal that this was accepting many
    //       absurd output values from cubic_min, but so far I haven't seen
    //       this to actually be the case.
    // TODO: If I'm that adamant about it, I should check with the lammps potential,
    //        using those structures that tend to produce linesearch failures.
    match cubic_min(low, high) {
        a if a.is_normal() => a,
        _ => quadratic_min(low, high),
    }
}
/// guess a minimum from two input bounds
guess a minimum from two input bounds
guess a minimum from two input bounds
fn guess_min(low: Bound, high: Bound) -> f64
{
    // NOTE: I was expecting unit tests to reveal that this was accepting many
    //       absurd output values from cubic_min, but so far I haven't seen
    //       this to actually be the case.
    // TODO: If I'm that adamant about it, I should check with the lammps potential,
    //        using those structures that tend to produce linesearch failures.
    match cubic_min(low, high) {
        a if a.is_normal() => a,
        _ => quadratic_min(low, high),
    }
}
fn guess_min ( low : Bound , high : Bound ) -> f64 { // NOTE: I was expecting unit tests to reveal that this was accepting many //       absurd output values from cubic_min, but so far I haven't seen //       this to actually be the case. // TODO: If I'm that adamant about it, I should check with the lammps potential, //        using those structures that tend to produce linesearch failures. match cubic_min ( low , high ) { a if a . is_normal ( ) => a , _ => quadratic_min ( low , high ) , } }
guess a minimum from two input bounds
guess a minimum from two input bounds
low
Bound
high
Bound
low
Bound
high
Bound