On Monday, 13 August 2012 at 10:11:06 UTC, Don Clugston wrote:
... I have come to believe that there are very few algorithms
originally designed for integers, which also work correctly for
floating point.
Integer code nearly always assumes things like, x + 1 != x, x
== x,
(x + y) - y == x.
for (y = x; y < x + 10; y = y + 1) { .... }
How many times does it loop?
Don,
I would appreciate your thoughts on the issue of re-implementing
numeric codes like BLAS and LAPACK in pure D to benefit from the
many nice features listed in this discussion. Is it feasible?
Worthwhile?
Thanks,
TJB