Struct sudoku_variants::solver::strategy::solvers::StrategicBacktrackingSolver [−][src]
A perfect Solver which uses a Strategy to accelerate the solving process. Under the assumption that the strategy is correct, this should yield the same result as a BacktrackingSolver. Note that using a complicated strategy can also reduce performance if its utility is too low.
Implementations
impl<S: Strategy> StrategicBacktrackingSolver<S>[src]
pub fn new(strategy: S) -> StrategicBacktrackingSolver<S>[src]
Creates a new strategic backtracing solver that uses the given
strategy.
Trait Implementations
impl<S: Strategy> Solver for StrategicBacktrackingSolver<S>[src]
Auto Trait Implementations
impl<S> RefUnwindSafe for StrategicBacktrackingSolver<S> where
S: RefUnwindSafe,
S: RefUnwindSafe,
impl<S> Send for StrategicBacktrackingSolver<S> where
S: Send,
S: Send,
impl<S> Sync for StrategicBacktrackingSolver<S> where
S: Sync,
S: Sync,
impl<S> Unpin for StrategicBacktrackingSolver<S> where
S: Unpin,
S: Unpin,
impl<S> UnwindSafe for StrategicBacktrackingSolver<S> where
S: UnwindSafe,
S: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T[src]
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,