219
99%

Ran 21 Oct 2015 01:21PM UTC

Jobs 5

Files 13

Run time 8258min

Badge

Embed ▾

pending completion

Build # 219

Build Type

Pull #33

travis-ci

Committed by

grddev

Commit Message

Optimize combinators for resolved cases

This implements three optimizations, for three different combinators.

For Future::all, if a future is already known to be failed, we know
upfront that the result will be a failed future, and we can reuse this
result.

For Future::after, if a future is already resolved, there is no reason
to keep it in the waiting list.

For Future::first, if a future is already known to be resolved, we know
upfront that the result will be a resolved future, and we can reuse this
result.

The implementations rely on `resolved?` and `failed?`, which according
to the specs are not guaranteed to exist on a future, and thus the code
has to check their presence before doing anything about it.

Pull Request Pull Request #33: Optimize combinators for resolved cases

Run Details

2621 of 2628 relevant lines covered (99.73%)

15750.97 hits per line

Jobs

ID	Job ID	Ran	Files	Coverage
1	219.1 (1.9.3)	21 Oct 2015 01:21PM UTC	12	98.7	Travis Job 219.1
2	219.2 (2.0.0)	21 Oct 2015 01:21PM UTC	12	99.04	Travis Job 219.2
3	219.3 (2.1.1)	21 Oct 2015 01:22PM UTC	12	99.04	Travis Job 219.3
4	219.4 (jruby)	27 Oct 2015 07:00AM UTC	13	98.47	Travis Job 219.4
5	219.5 (jruby-head)	21 Oct 2015 01:24PM UTC	13	0.0	Travis Job 219.5

Source Files on build 219

Coverage	∆	File	Lines	Relevant	Covered	Missed	Hits/Line

iconara / ione / 219
99%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 219

iconara / ione / 219 99%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 219

iconara / ione / 219
99%

README BADGES
x