• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

msakai / toysolver / 941
72%

Build:
DEFAULT BRANCH: master
Ran 23 Apr 2016 03:33AM UTC
Jobs 1
Files 90
Run time 4s
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

pending completion
941

push

travis-ci

msakai
implement Hopcroft-Karp algorithm for maximum-cardinality bipartite matching

14 of 14 new or added lines in 1 file covered. (100.0%)

9498 of 12902 relevant lines covered (73.62%)

1.4 hits per line

Uncovered Existing Lines

Lines Coverage ∆ File
1
100.0
src/ToySolver/Combinatorial/SubsetSum.hs
1
100.0
src/ToySolver/SMT.hs
1
100.0
src/ToySolver/SAT.hs
8
100.0
src/ToySolver/QBF.hs
40
100.0
src/ToySolver/SAT/PBO/BCD.hs
Jobs
ID Job ID Ran Files Coverage
2 941.2 (CABALVER=1.18 GHCVER=7.8.3 COVERAGE=1) 23 Apr 2016 03:33AM UTC 0
73.62
Travis Job 941.2
Source Files on build 941
Detailed source file information is not available for this build.
  • Back to Repo
  • Travis Build #941
  • adafc101 on github
  • Prev Build on master (#938)
  • Next Build on master (#943)
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc