great -- thanks.
On Tuesday, September 1, 2015 at 5:28:49 AM UTC-4, Kristoffer Carlsson wrote: > > On line 20, changing xs[:] = x[:] to copy!(xs, x) makes it 25% faster. > > > On Tuesday, September 1, 2015 at 11:14:59 AM UTC+2, Jeffrey Sarnoff wrote: >> >> >> https://github.com/J-Sarnoff/IFastSum.jl >> >> On Tuesday, September 1, 2015 at 5:14:20 AM UTC-4, Jeffrey Sarnoff wrote: >>> >>> This implements an algorithm that gives the correctly rounded sum of a >>> Vector{AbstractFloat}. I wanted to know if it really worked. It appears >>> so. AFAIK, this works properly with any size vector; I tested it with >>> 5_000, 100_000, and 10_000_000 items. I think of it as an an order of >>> magnitude faster than summing BigFloats to get the correctly rounded result. >>> >>>
