pub fn veto<T>(&mut self, vetoes: T)
        where T: iter::Iterator<Item=CaseId> {
        for veto in vetoes {
            self[veto] = false;
        }
    }
/// Marks supplied `CaseId`s as impossible
///
/// This is a convenience method for interacting with solvers. It's equivalent to:
///
/// ```rust
/// # use rusudoku::grid::*;
/// # let mut grid = Grid::new(1);
/// # let vetoes = vec![CaseId(0)];
/// for veto in vetoes {
///    grid[veto] = false;
/// }
/// ```
Marks supplied `CaseId`s as impossible
This is a convenience method for interacting with solvers. It's equivalent to.


Marks supplied ` CaseId ` s as impossible This is a convenience method for interacting with solvers . It ' s equivalent to .
pub fn veto<T>(&mut self, vetoes: T)
        where T: iter::Iterator<Item=CaseId> {
        for veto in vetoes {
            self[veto] = false;
        }
    }
pub fn veto < T > ( & mut self , vetoes : T ) where T : iter :: Iterator < Item = CaseId > { for veto in vetoes { self [ veto ] = false ; } }
Marks supplied `CaseId`s as impossible
This is a convenience method for interacting with solvers.
Marks supplied ` CaseId ` s as impossible This is a convenience method for interacting with solvers .
&mut self
vetoes
T
&mut self
vetoes
T
use rusudoku::grid::*;
None
let mut grid = grid::new(1);
None
let vetoes = vec![caseid(0)];
for veto in vetoes {
grid[veto] = false;
}
```
for veto in vetoes { grid [ veto ] = false ; } ` ` `