pub struct Day06 { /* private fields */ }
Expand description
2017 Day 6: Finding cycles.
See https://en.wikipedia.org/wiki/Cycle_detection#Brent's_algorithm, which avoids storing and hashing every visited state at the expense of calculating extra iterations.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Day06
impl RefUnwindSafe for Day06
impl Send for Day06
impl Sync for Day06
impl Unpin for Day06
impl UnwindSafe for Day06
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
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)