Use create_ticks() outside of benchmark for improved code coverage
This commit is contained in:
13
src/event.rs
13
src/event.rs
@ -107,14 +107,11 @@ mod tests {
|
|||||||
assert!(verify_slice(&vec![], 0)); // base case
|
assert!(verify_slice(&vec![], 0)); // base case
|
||||||
assert!(verify_slice(&vec![Event::new_tick(0, 0)], 0)); // singleton case 1
|
assert!(verify_slice(&vec![Event::new_tick(0, 0)], 0)); // singleton case 1
|
||||||
assert!(!verify_slice(&vec![Event::new_tick(0, 0)], 1)); // singleton case 2, bad
|
assert!(!verify_slice(&vec![Event::new_tick(0, 0)], 1)); // singleton case 2, bad
|
||||||
assert!(verify_slice(
|
assert!(verify_slice(&create_ticks(0, 0, 2), 0)); // inductive case
|
||||||
&vec![Event::new_tick(0, 0), next_tick(0, 0)],
|
|
||||||
0
|
let mut bad_ticks = create_ticks(0, 0, 2);
|
||||||
)); // lazy inductive case
|
bad_ticks[1].end_hash = 1;
|
||||||
assert!(!verify_slice(
|
assert!(!verify_slice(&bad_ticks, 0)); // inductive case, bad
|
||||||
&vec![Event::new_tick(0, 0), next_tick(1, 0)],
|
|
||||||
0
|
|
||||||
)); // lazy inductive case, bad
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Reference in New Issue
Block a user