Repo Added
|
Build
3
Last
|
Files
11
|
Badge
Embed ▾
README BADGES
|
push
github
avoid overflow when computing middle `from+to` may be greater than `math.MaxInt`, so we need to take care of overflow. casting int to uint is reasonable way. Actually, Go's standard library uses this trick: https://github.com/golang/go/blob/2eca0b1e1/src/sort/search.go#L63
1 of 1 new or added line in 1 file covered. (100.0%)
835 of 875 relevant lines covered (95.43%)
4.73 hits per line
Coverage | ∆ | File | Lines | Relevant | Covered | Missed | Hits/Line |
---|
Badge your Repo: uniseg-forkedWe detected this repo isn’t badged! Grab the embed code to the right, add it to your repo to show off your code coverage, and when the badge is live hit the refresh button to remove this message.Could not find badge in README. |
Embed ▾
Refresh
README BADGES
|