.pow() and .root() functions for fraction types

[dnsl48]

.pow() and .root() functions for fraction types

[Gip-Gip]

I'll look into experimenting with a few options over the next few days or so. A good .pow function would look something like

fn pow(left: Fraction, right: Fraction) -> Fraction {
    let exp = right.numer().unwrap().clone();
    let root = right.denom().unwrap().clone();
    
    // Insert code here where result = nthroot(left^exponent, root)

    return result
}

[dnsl48]

Hi @Gip-Gip, thank you for your interest and your support!

Regarding pow, I feel like we may consider falling back to num-rational pow implementation. Fraction is built on top of Rational type already, so this may be the eastiest path forward

Not too sure about sqrt. That feels somewhat more challenging. I guess you may have a real-world problem on your hands, so we'd be happy to consider a way that would solve your current challenge.

One of the primary goals of this library is to provide lossless math, so I am not too sure if an approximation would follow that direction. However, if we explicitly call that out in the function name (e.g. sqrt_approx), I think that should be totally alright.

[feefladder]

I've been working on a crate heavily building on top of the fraction crate for exact arithmetic. the relevant code is here
first handle special cases such as infinity or nan, then do the calculation. It's inside match statements, but should be quite copy-pasteable into this crate.