195
100%

Ran 29 Apr 2015 09:24PM UTC

Jobs 4

Files 110

Run time 14min

Badge

Embed ▾

pending completion

Build # 195

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

3703 of 3705 relevant lines covered (99.95%)

422058.38 hits per line

Jobs

ID	Job ID	Ran	Coverage
1	195.1 (LUA=lua5.1)	29 Apr 2015 09:38PM UTC	99.92	Travis Job 195.1
2	195.2 (LUA=lua5.2)	29 Apr 2015 09:27PM UTC	99.78	Travis Job 195.2
3	195.3 (LUA=lua5.3)	29 Apr 2015 09:31PM UTC	99.49	Travis Job 195.3
4	195.4 (LUA=luajit)	29 Apr 2015 09:24PM UTC	99.56	Travis Job 195.4

Source Files on build 195

Detailed source file information is not available for this build.

npge / lua-npge / 195
100%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 195

npge / lua-npge / 195 100%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 195

npge / lua-npge / 195
100%

README BADGES
x