We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Hello,
For floating point types, the standard implementation of std::fma guarantees that it :
Computes (x*y) + z as if to infinite precision and rounded only once to fit the result type.
In practice it uses an FMA instruction when available or an algorithm similar to your handmade implementation.
Wouldn't it make sense to use it in libeft (avoiding the dependency on intrinsics) ?
Cordially, Nestor Demeure
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Hello,
For floating point types, the standard implementation of std::fma guarantees that it :
In practice it uses an FMA instruction when available or an algorithm similar to your handmade implementation.
Wouldn't it make sense to use it in libeft (avoiding the dependency on intrinsics) ?
Cordially,
Nestor Demeure
The text was updated successfully, but these errors were encountered: