2
93%
master: 93%

Ran 09 Aug 2020 08:27AM UTC

Files 25

Run time 2s

Badge

Embed ▾

Committed 09 Aug 2020 08:07AM UTC coverage: 86.3% (+0.1%) from 86.169%

Job # JULIA_NUM_THREADS=2 COVERALLS_PARALLEL=true

Build Type

push

travis-ci-com

Committed by

web-flow

Commit Message

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.

Coverage Stats

1348 of 1562 relevant lines covered (86.3%)

2363505.94 hits per line

JuliaFolds / Transducers.jl / 1994 / 2
93%
master: 93%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 1994.2 (JULIA_NUM_THREADS=2 COVERALLS_PARALLEL=true)

JuliaFolds / Transducers.jl / 1994 / 2 93% master: 93%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 1994.2 (JULIA_NUM_THREADS=2 COVERALLS_PARALLEL=true)

JuliaFolds / Transducers.jl / 1994 / 2
93%
master: 93%

README BADGES
x