1839
93%

Ran 29 Sep 2018 06:14PM UTC

Jobs 1

Files 22

Run time 5s

Badge

Embed ▾

pending completion

Build # 1839

Build Type

cron

travis-ci

Committed by

BurntSushi

Commit Message

compile: use SparseSet-like structure for SuffixCache

For simple regexes, allocating and filling 1000 of SuffixCache elements
seemed to be quite high on the profile as part of Compiler::new, so I
decided to optimise it by using ideas similar to sparse set, but specialised
for a hashmap-like structure, instead of a flat array with versioning.

In my performance comparisons this gives 8-10% improvement for simple
regexes where overhead of Compiler::new is most noticeable.

Run Details

3666 of 4241 relevant lines covered (86.44%)

0.86 hits per line

Uncovered Existing Lines

Lines	Coverage	∆	File
1	98.08	90.38%	vector/avx2.rs
1	0.0	-4.35%	error.rs
8	91.74	-0.19%	literal/mod.rs
43	8.33	-89.58%	vector/ssse3.rs
124	1.6	-65.96%	literal/teddy_ssse3/imp.rs

Jobs

ID	Job ID	Ran	Files	Coverage
4	1839.4	29 Sep 2018 06:14PM UTC	22	86.44	Travis Job 1839.4

rust-lang / regex / 1839
93%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Uncovered Existing Lines

Jobs

Source Files on build 1839

rust-lang / regex / 1839 93%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Uncovered Existing Lines

Jobs

Source Files on build 1839

rust-lang / regex / 1839
93%

README BADGES
x