tree a80ce5f2f18ede87028b9d5b28d63bcc7790bdd2
parent e03cbc06ec1623f5813d8d135a622b3f05c6f8e5
author Alex Herbert <aherbert@apache.org> 1577059754 +0000
committer Alex Herbert <aherbert@apache.org> 1577226386 +0000

Change pow() overflow edge case test.

Some libraries can compute (MAX, 1).pow(2, 0) as non-infinite in the
imaginary part by using a decomposition of:

e^a * sin(im) = sin(im) * e^n * e^(a-n)

with n set to not overflow to inf.