pub fn uninhabited_from(
                &self,
                visited: &mut FxHashSet<(DefId, &'tcx Substs<'tcx>)>,
                tcx: TyCtxt<'a, 'gcx, 'tcx>,
                substs: &'tcx Substs<'tcx>) -> DefIdForest
    {
        if !visited.insert((self.did, substs)) {
            return DefIdForest::empty();
        }

        let ret = DefIdForest::intersection(tcx, self.variants.iter().map(|v| {
            v.uninhabited_from(visited, tcx, substs, self.adt_kind())
        }));
        visited.remove(&(self.did, substs));
        ret
    }
/// Calculate the forest of DefIds from which this adt is visibly uninhabited.
Calculate the forest of DefIds from which this adt is visibly uninhabited.
Calculate the forest of DefIds from which this adt is visibly uninhabited .
pub fn uninhabited_from(
                &self,
                visited: &mut FxHashSet<(DefId, &'tcx Substs<'tcx>)>,
                tcx: TyCtxt<'a, 'gcx, 'tcx>,
                substs: &'tcx Substs<'tcx>) -> DefIdForest
    {
        if !visited.insert((self.did, substs)) {
            return DefIdForest::empty();
        }
        let ret = DefIdForest::intersection(tcx, self.variants.iter().map(|v| {
            v.uninhabited_from(visited, tcx, substs, self.adt_kind())
        }));
        visited.remove(&(self.did, substs));
        ret
    }
pub fn uninhabited_from ( & self , visited : & mut FxHashSet < ( DefId , & ' tcx Substs < ' tcx > ) > , tcx : TyCtxt < ' a , ' gcx , ' tcx > , substs : & ' tcx Substs < ' tcx > ) -> DefIdForest { if ! visited . insert ( ( self . did , substs ) ) { return DefIdForest :: empty ( ) ; } let ret = DefIdForest :: intersection ( tcx , self . variants . iter ( ) . map ( | v | { v . uninhabited_from ( visited , tcx , substs , self . adt_kind ( ) ) } ) ) ; visited . remove ( & ( self . did , substs ) ) ; ret }
Calculate the forest of DefIds from which this adt is visibly uninhabited.
Calculate the forest of DefIds from which this adt is visibly uninhabited .
&self
visited
&mut FxHashSet<(DefId, &'tcx Substs<'tcx>)>
tcx
TyCtxt<'a, 'gcx, 'tcx>
substs
&'tcx Substs<'tcx>
&self
visited
&mut FxHashSet<(DefId, &'tcx Substs<'tcx>)>
tcx
TyCtxt<'a, 'gcx, 'tcx>
substs
&'tcx Substs<'tcx>