MathFp32.exponential_precise: def of stelliferous@0.0.2.0
Import: import stelliferous@0.0.2.0/math_fp32.bend as MathFp32
Lines 127-131 of stelliferous@0.0.2.0/math_fp32.bend: https://jend.leeeet.dev/read.txt?path=stelliferous@0.0.2.0/math_fp32.bend&start_line=127&end_line=131

import Base

# FastTwoSum retains the low bits of 1+r before adding the quadratic tail.
def exponential_precise(+r: F32) -> F32:
  +sum = (1.0 + r : F32)
  +error = (r - (sum - 1.0 : F32) : F32)
  (sum + ((exponential_polynomial(r) * (r * r : F32) : F32) + error : F32) : F32)

Uses (5):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32.add
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32.mul
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32.sub
  https://jend.leeeet.dev/definition.txt?path=stelliferous@0.0.2.0/math_fp32.bend&name=exponential_polynomial