pub fn vetoes(&self) -> VetoesIter {
        fn to_case_id_if_vetoed((case_id, allowed): (usize, &bool)) -> Option<CaseId> {
            if *allowed { None } else { Some(CaseId(case_id)) }
        }
        self.cases.iter().enumerate().filter_map(to_case_id_if_vetoed)
    }
/// Returns `CaseId`s that are impossible.
///
/// This is a convenience method for interacting with solvers. It returns an iterator of
/// `CaseId`s that have been marked as impossible.
Returns `CaseId`s that are impossible.
This is a convenience method for interacting with solvers. It returns an iterator of
`CaseId`s that have been marked as impossible.
Returns ` CaseId ` s that are impossible . This is a convenience method for interacting with solvers . It returns an iterator of ` CaseId ` s that have been marked as impossible .
pub fn vetoes(&self) -> VetoesIter {
        fn to_case_id_if_vetoed((case_id, allowed): (usize, &bool)) -> Option<CaseId> {
            if *allowed { None } else { Some(CaseId(case_id)) }
        }
        self.cases.iter().enumerate().filter_map(to_case_id_if_vetoed)
    }
pub fn vetoes ( & self ) -> VetoesIter { fn to_case_id_if_vetoed ( ( case_id , allowed ) : ( usize , & bool ) ) -> Option < CaseId > { if * allowed { None } else { Some ( CaseId ( case_id ) ) } } self . cases . iter ( ) . enumerate ( ) . filter_map ( to_case_id_if_vetoed ) }
Returns `CaseId`s that are impossible.
Returns ` CaseId ` s that are impossible .
&self
&self