bjoernager/rust
bjoernager/rust
1
Fork 0
Code Activity

coverage: Completely overhaul counter assignment, using node-flow graphs

Browse source
This commit is contained in:
Zalathar 2025-01-12 21:36:07 +11:00
parent e70112caf8
commit f1300c860e
51 changed files with 1930 additions and 1973 deletions
Download patch file Download diff file Expand all files Collapse all files

14
tests/coverage/overflow.coverage
View file

@ -15,18 +15,18 @@
LL| |
LL| 1|fn main() -> Result<(), u8> {
LL| 1| let mut countdown = 10;
LL| 11| while countdown > 0 {
LL| 11| if countdown == 1 {
LL| 10| while countdown > 0 {
LL| 9| if countdown == 1 {
LL| 1| let result = might_overflow(10);
LL| 1| println!("Result: {}", result);
LL| 10| } else if countdown < 5 {
LL| 8| } else if countdown < 5 {
LL| 3| let result = might_overflow(1);
LL| 3| println!("Result: {}", result);
LL| 6| }
LL| 10| countdown -= 1;
LL| 5| }
LL| 9| countdown -= 1;
LL| | }
LL| 0| Ok(())
LL| 0|}
LL| 1| Ok(())
LL| 1|}
LL| |
LL| |// Notes:
LL| |// 1. Compare this program and its coverage results to those of the very similar test `assert.rs`,