4
84%
master: 84%

Ran 16 Sep 2017 12:34AM UTC

Files 11

Run time 2s

Badge

Embed ▾

Committed 15 Sep 2017 06:46PM UTC coverage: 85.072% (+1.9%) from 83.129%

Job # BUILD=stack ARGS="" TESTARGS="--coverage --haddock"

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

1060 of 1246 relevant lines covered (85.07%)

0.85 hits per line

jbearer / hspl / 114 / 4
84%
master: 84%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 114.4 (BUILD=stack ARGS="" TESTARGS="--coverage --haddock")

jbearer / hspl / 114 / 4 84% master: 84%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 114.4 (BUILD=stack ARGS="" TESTARGS="--coverage --haddock")

jbearer / hspl / 114 / 4
84%
master: 84%

README BADGES
x