Struct DlSolver 

pub struct DlSolver<'i, I, C> { /* private fields */ }

Visits all solutions to a given XCC problem by means of dancing links.

More precisely, this structure embodies an implementation of Algorithm C, as presented by D. E. Knuth in Section 7.2.2.1 of TAOCP 4B, part 2, pages 87–91.

Trait Implementations

impl<'i, I: Eq, C: Eq + Copy> Solver<'i, I, C> for Solver<'i, I, C>

fn new(primary: &'i [I], secondary: &'i [I]) -> Self

Creates a solver for an XCC problem on the given primary and secondary items.

fn add_option<P, S>(&mut self, primary: P, secondary: S)

where P: AsRef<[I]>, S: AsRef<[(I, Option<C>)]>,

Appends an option to the XCC problem.

fn solve<F>(self, visit: F)

where F: FnMut(Solution<'_, 'i, I, C, Self>) -> ControlFlow<()>,

Calls a closure on each solution to the XCC problem.