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

dpaukov / classic-cherries / 129 / 1
61%
master: 61%

Build:
DEFAULT BRANCH: master
Ran 07 Jun 2019 03:34AM UTC
Files 112
Run time 5s
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

07 Jun 2019 03:32AM UTC coverage: 44.98% (+0.4%) from 44.539%
129.1

push

travis-ci

dpaukov
Add an implementation of Binary Indexed Tree (Fenwick Tree) for calculating prefix/range cumulative operations in O(logn) time complexity. Memory: O(n).

1438 of 3197 relevant lines covered (44.98%)

0.45 hits per line

Source Files on job 129.1
  • Tree
  • List 0
  • Changed 1
  • Source Changed 1
  • Coverage Changed 1
Coverage ∆ File Lines Relevant Covered Missed Hits/Line
  • Back to Build 93
  • Travis Job 129.1
  • a9340221 on github
  • Prev Job for on master (#128.1)
  • Next Job for on master (#130.1)
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