10
47%

Ran 05 May 2016 09:30AM UTC

Jobs 1

Files 22

Run time 1s

Badge

Embed ▾

pending completion

Build # 10

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

Uncovered Existing Lines

Lines	Coverage	File
1	100.0	/Mirrors.som
2	100.0	/Kernel.som
6	100.0	/TestSuite/Minitest.som
25	100.0	/TestSuite/MinitestTests.som
34	100.0	/Collections.som

Jobs

ID	Job ID	Ran	Files	Coverage
1	10.1	05 May 2016 09:30AM UTC	0	76.67	Travis Job 10.1

Source Files on build 10

Detailed source file information is not available for this build.

smarr / SOMns-corelib / 10
47%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Uncovered Existing Lines

Jobs

Source Files on build 10

smarr / SOMns-corelib / 10 47%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Uncovered Existing Lines

Jobs

Source Files on build 10

smarr / SOMns-corelib / 10
47%

README BADGES
x