3
100%
master: 100%

Ran 29 Apr 2015 09:31PM UTC

Files 110

Run time 5s

Badge

Embed ▾

Committed 29 Apr 2015 09:01PM UTC coverage: 99.486%. First build

Job # LUA=lua5.3

Build Type

push

travis-ci

Committed by

starius

Commit Message

C++, BlockSet: use segment tree to find overlaps

Simple sorted array of fragments is not sufficient if
a fragment is inside other fragment:

    f1      ###########
    f2       #####
    f3        ###########
    pattern        ????

If this is detected (if order of max positions disagrees
with order of min positions), then additional data structure
is created: segment tree [1].

Non-leaf nodes of segment tree are stored in array of size
N-1, where N is number of fragments.

New test was added: many random overlapping fragments.

[1] https://en.wikipedia.org/wiki/Segment_tree

Run Details

3678 of 3697 relevant lines covered (99.49%)

114250.21 hits per line

npge / lua-npge / 195 / 3
100%
master: 100%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 195.3 (LUA=lua5.3)

npge / lua-npge / 195 / 3 100% master: 100%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 195.3 (LUA=lua5.3)

npge / lua-npge / 195 / 3
100%
master: 100%

README BADGES
x