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

nep-pack / NonlinearEigenproblems.jl / 336
73%
master: 90%

Build:
Build:
LAST BUILD BRANCH: cork
DEFAULT BRANCH: master
Ran 21 Aug 2018 01:36PM UTC
Jobs 1
Files 45
Run time 6s
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
336

push

travis-ci

maxbennedich
faster spmf computation by storing all matrices with same sparsity pattern

2461 of 3762 relevant lines covered (65.42%)

83897.06 hits per line

Jobs
ID Job ID Ran Files Coverage
1 336.1 21 Aug 2018 01:36PM UTC 0
65.42
Travis Job 336.1
Source Files on build 336
Detailed source file information is not available for this build.
  • Back to Repo
  • Travis Build #336
  • 9debd546 on github
  • Next Build on faster-spmf-computation (#338)
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

© 2025 Coveralls, Inc