|
Repo Added
|
Files
75
|
Badge
README BADGES
|
github
3093 of 3511 branches covered (88.09%)
Branch coverage included in aggregate %.
54 of 54 new or added lines in 1 file covered. (100.0%)
1 existing line in 1 file now uncovered.7116 of 7315 relevant lines covered (97.28%)
171865.41 hits per line
| Coverage | ∆ | File | Lines | Relevant | Covered | Missed | Hits/Line | Branch Hits | Branch Misses |
|---|
| Builds | Branch | Commit | Type | Ran | Committer | Via | Coverage |
|---|---|---|---|---|---|---|---|
| 9943601447 | idag-nd-memory | Implement optimal nd-memory copy primitives The new nd-copy layout mechanism computes the minimum number of contiguous memcpys, or the minimum strided-memcpy dimension to copy between boxes in two allocations. | Pull #257 | github |
94.3 |
||
| 9907298828 | idag-nd-memory | Merge 74eedf62d into 642b818ca | Pull #257 | github |
94.63 |
||
| 9693230522 | idag-nd-memory | Implement optimal nd-memory copy primitives | Pull #257 | github |
94.66 |
||
| 9663470746 | idag-nd-memory | Merge fc0c3ebf7 into 642b818ca | Pull #257 | github |
94.64 |
||
| 9663336885 | idag-nd-memory | Implement optimal nd-memory copy primitives | push | github |
94.64 |