pub fn sub_free_region(&self, sub: FreeRegion, sup: FreeRegion) -> bool {
        let result = sub == sup || {
            let sub = ty::ReFree(sub);
            let sup = ty::ReFree(sup);
            self.relation.contains(&sub, &sup) || self.relation.contains(&ty::ReStatic, &sup)
        };
        debug!("sub_free_region(sub={:?}, sup={:?}) = {:?}", sub, sup, result);
        result
    }
/// Determines whether two free regions have a subregion relationship
/// by walking the graph encoded in `map`.  Note that
/// it is possible that `sub != sup` and `sub <= sup` and `sup <= sub`
/// (that is, the user can give two different names to the same lifetime).
Determines whether two free regions have a subregion relationship
by walking the graph encoded in `map`.
Determines whether two free regions have a subregion relationship by walking the graph encoded in ` map ` .
pub fn sub_free_region(&self, sub: FreeRegion, sup: FreeRegion) -> bool {
        let result = sub == sup || {
            let sub = ty::ReFree(sub);
            let sup = ty::ReFree(sup);
            self.relation.contains(&sub, &sup) || self.relation.contains(&ty::ReStatic, &sup)
        };
        debug!("sub_free_region(sub={:?}, sup={:?}) = {:?}", sub, sup, result);
        result
    }
pub fn sub_free_region ( & self , sub : FreeRegion , sup : FreeRegion ) -> bool { let result = sub == sup || { let sub = ty :: ReFree ( sub ) ; let sup = ty :: ReFree ( sup ) ; self . relation . contains ( & sub , & sup ) || self . relation . contains ( & ty :: ReStatic , & sup ) } ; debug ! ( " " sub sup result ) ; result }
Determines whether two free regions have a subregion relationship
by walking the graph encoded in `map`.
Determines whether two free regions have a subregion relationship by walking the graph encoded in ` map ` .
&self
sub
FreeRegion
sup
FreeRegion
&self
sub
FreeRegion
sup
FreeRegion