111
85%
master: 84%

Ran 15 Sep 2017 05:44AM UTC

Jobs 1

Files 11

Run time 2s

Badge

Embed ▾

pending completion

Build # 111

Build Type

push

travis-ci

Committed by

jbearer

Commit Message

Optimize Unifier composition.

Composing Unifiers everytime we complete a new subproof is expensive,
in terms of both time and memory. To mitigate this cost, we implement
to optimizations:

1. Composition is lazy. Unifiers are never explicitly composed, only
unioned. Whenever a unifier is _applied_, we apply it recursively to
the result until there are no more unifications to be made. This
achieves the same transitivity that composing the unifiers does.

2. VarMap union is made more efficient by implementing it in terms of
Data.Map.union.

These optimizations yielded a speed up of 30-100x.

Run Details

1059 of 1245 relevant lines covered (85.06%)

0.85 hits per line

Jobs

ID	Job ID	Ran	Files	Coverage
4	111.4 (BUILD=stack ARGS="" TESTARGS="--coverage --haddock")	15 Sep 2017 05:44AM UTC	0	85.06	Travis Job 111.4

Source Files on build 111

Detailed source file information is not available for this build.

jbearer / hspl / 111
85%
master: 84%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 111

jbearer / hspl / 111 85% master: 84%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 111

jbearer / hspl / 111
85%
master: 84%

README BADGES
x