[Issue 12562] std.algorithm.mul

via Digitalmars-d-bugs digitalmars-d-bugs at puremagic.com
Wed Nov 11 22:46:20 PST 2015


https://issues.dlang.org/show_bug.cgi?id=12562

Saurabh Das <saurabh.das at gmail.com> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
                 CC|                            |saurabh.das at gmail.com

--- Comment #1 from Saurabh Das <saurabh.das at gmail.com> ---
std.algorithm.sum differs from reduce!((a, b) => a + b) in that it uses a
different algorithm for floating-point types to reduce the round-off error. As
far as I understand, multiplication of floating-point types does not suffer
from the same problem. (Or does it?)

Do you have any special case algorithms you would like to implement for
std.algorithm.mul in mind?

If it is simply a forward to reduce!((a, b) => a * b), then is it a big enough
convenience to be included into phobos?

I have been trying to make some time to contribute back to Dlang and this seems
like the perfect, nice and easy issue, to dip my toe into the
phobos-contributor waters! :)

--


More information about the Digitalmars-d-bugs mailing list