2
89%
master: 89%

Ran 07 Feb 2017 03:20AM UTC

Files 44

Run time 2s

Badge

Embed ▾

Committed 07 Feb 2017 03:14AM UTC coverage: 100.0%. Remained the same

Job # 750.2

Build Type

push

travis-ci

Committed by

web-flow

Commit Message

Add containsAll/subSetOf comparisons (#115)

Results
-------
[info] Benchmark                                         Mode  Cnt   Score   Error  Units
[info] SetComparisons.enumeratumScalaSetSubsetOfSmall   avgt   30   9.248 ± 0.109  ns/op
[info] SetComparisons.enumeratumScalaSetSubsetOfMedium  avgt   30  29.358 ± 0.287  ns/op
[info] SetComparisons.enumeratumScalaSetSubsetOfAll     avgt   30   2.469 ± 0.012  ns/op
[info] SetComparisons.jEnumEnumSetContainsAllSmall      avgt   30   3.888 ± 0.953  ns/op
[info] SetComparisons.jEnumEnumSetContainsAllMedium     avgt   30   3.457 ± 0.127  ns/op
[info] SetComparisons.jEnumEnumSetContainsAllAll        avgt   30   3.321 ± 0.827  ns/op

Discussion
----------
As expected, we have O(m) for subset checking on a Set of m elements against one of n elements.
Looking at the source code confirms that we are doing a forall check ;) Funnily enough, subset
check when the sets contain exactly the same elements is crazy fast (!), beating out EnumSet.

EnumSet really shines here because of its ability to do a bitwise AND operation, fulfilling its
O(1) promise.

The ability to do a constain time, fast subset check makes it worthwhile to consider a similar
EnumSet for Enumeratum (backed by an bitwise rep of member indices), even if member indices require a hash-lookup to get.

Run Details

402 of 402 relevant lines covered (100.0%)

1.0 hits per line

lloydmeta / enumeratum / 750 / 2
89%
master: 89%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 750.2

lloydmeta / enumeratum / 750 / 2 89% master: 89%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 750.2

lloydmeta / enumeratum / 750 / 2
89%
master: 89%

README BADGES
x