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

hbollon / go-edlib / 2601915406
100%
master: 100%

Build:
Build:
LAST BUILD BRANCH: optimize_OSADL
DEFAULT BRANCH: master
Ran 03 Jul 2022 03:25PM UTC
Jobs 1
Files 12
Run time 1s
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

03 Jul 2022 03:25PM UTC coverage: 100.0%. Remained the same
2601915406

Pull #17

github

tang-hi
reduce OSADamerau–Levenshtein space complexity from O(m*n) to O(3 * min(m,n))
Pull Request #17: reduce OSADamerau–Levenshtein space complexity from O(m*n) to O(3 * min(m*n))

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

655 of 655 relevant lines covered (100.0%)

161.3 hits per line

Jobs
ID Job ID Ran Files Coverage
1 2601915406.1 03 Jul 2022 03:25PM UTC 0
100.0
GitHub Action Run
Source Files on build 2601915406
Detailed source file information is not available for this build.
  • Back to Repo
  • Pull Request #17
  • PR Base - master (#1773562201)
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