pub struct PeriodicSchedule {
pub min_states: u64,
pub growth_factor: u64,
}Expand description
Completed-level schedule for ordinary dive-profile temporal checking. When a completed, nonexhausted level is checked in dive’s default profile; the TLC profile checks once, at the end.
A level is checked once the graph has at least min_states distinct states
and at least growth_factor times as many as at the previous check. With
the default doubling, all prefix checks together cost about one final check.
The schedule depends only on the graph, so results are the same at every
worker count. TLC’s wall-clock trigger has no deterministic equivalent; the
TLC-equivalent setting is final checking (-lncheck final).
use dive_liveness::analyze::periodic::Schedule;
let schedule = Schedule::DEFAULT;
assert!(!schedule.due(65_535, 0));
assert!(schedule.due(65_536, 0));
assert!(!schedule.due(100_000, 65_536));
assert!(schedule.due(131_072, 65_536));Fields§
§min_states: u64Smallest distinct-state count at which a prefix is checked.
growth_factor: u64Required growth factor over the previous check’s distinct-state count.
Implementations§
Trait Implementations§
impl Copy for Schedule
impl Eq for Schedule
impl StructuralPartialEq for Schedule
Auto Trait Implementations§
impl Forget for Schedule
impl Freeze for Schedule
impl Move for Schedule
impl RefUnwindSafe for Schedule
impl Send for Schedule
impl Sync for Schedule
impl Unpin for Schedule
impl UnsafeUnpin for Schedule
impl UnwindSafe for Schedule
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more