Ran
|
Jobs
3
|
Files
11
|
Run time
2s
|
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
ID | Job ID | Ran | Files | Coverage | |
---|---|---|---|---|---|
1 | Go-1.19 - 5630442252.1 | 11 |
95.43 |
GitHub Action Run | |
2 | Go-1.21.0-rc.3 - 5630442252.2 | 11 |
95.43 |
GitHub Action Run | |
3 | Go-1.20 - 5630442252.3 | 11 |
95.43 |
GitHub Action Run |
Coverage | ∆ | File | Lines | Relevant | Covered | Missed | Hits/Line |
---|