JuliaFolds / Transducers.jl / 1994

93%

push

travis-ci-com

Tail-call function-barrier for arrays (#403)

This PR implements the "tail-call function-barrier" pattern for arrays
with linear style indexing.  This gives us a better performance for
type-changing reduction where the iteration at which the type changes
is unknown.  A good example is filtered sum with no initial value
(#404).

Interestingly, this version is a bit worse for sum of filtered floats
on "short" arrays.  Compare the result of
`["filter_sum", "1000", "RandomFloats", "noinit", "xf"]`.  In my
laptop, baseline is ~1.7 μs while this branch is ~2.1 μs.  However,
for 10x longer input, this branch is faster (> 2x).  The benchmarks on
CI also show similar results.

28 of 29 new or added lines in 4 files covered. (96.55%)

1277 of 1376 relevant lines covered (92.81%)

6779871.95 hits per line