1
47%
master: 47%

Ran 05 May 2016 09:30AM UTC

Files 22

Run time 1s

Badge

Embed ▾

Committed 05 May 2016 09:21AM UTC coverage: 76.666% (-0.6%) from 77.313%

Job # 10.1

Build Type

push

travis-ci

Committed by

smarr

Commit Message

Change Dictionary to be based on a hash table

The implementation uses the object hash, and stores entries in an array of buckets. Conflicts are resloved by chaining entries.

This is somewhat similar to the JDK HashMap implementation, but much simpler.

Signed-off-by: Stefan Marr <git@stefan-marr.de>

Run Details

2405 of 3137 relevant lines covered (76.67%)

72.17 hits per line

smarr / SOMns-corelib / 10 / 1
47%
master: 47%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 10.1

smarr / SOMns-corelib / 10 / 1 47% master: 47%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 10.1

smarr / SOMns-corelib / 10 / 1
47%
master: 47%

README BADGES
x