@@ -742,7 +742,7 @@ impl<'tcx> Visitor<'tcx> for UsePlacementFinder {
742
742
}
743
743
744
744
/// This thing walks the whole crate in DFS manner, visiting each item, resolving names as it goes.
745
- impl < ' a , ' tcx , ' cl > Visitor < ' tcx > for Resolver < ' a , ' cl > {
745
+ impl < ' a , ' tcx > Visitor < ' tcx > for Resolver < ' a > {
746
746
fn visit_item ( & mut self , item : & ' tcx Item ) {
747
747
self . resolve_item ( item) ;
748
748
}
@@ -1476,7 +1476,7 @@ pub struct ExternPreludeEntry<'a> {
1476
1476
/// The main resolver class.
1477
1477
///
1478
1478
/// This is the visitor that walks the whole crate.
1479
- pub struct Resolver < ' a , ' b : ' a > {
1479
+ pub struct Resolver < ' a > {
1480
1480
session : & ' a Session ,
1481
1481
cstore : & ' a CStore ,
1482
1482
@@ -1580,7 +1580,7 @@ pub struct Resolver<'a, 'b: 'a> {
1580
1580
arenas : & ' a ResolverArenas < ' a > ,
1581
1581
dummy_binding : & ' a NameBinding < ' a > ,
1582
1582
1583
- crate_loader : & ' a mut CrateLoader < ' b > ,
1583
+ crate_loader : & ' a mut CrateLoader < ' a > ,
1584
1584
macro_names : FxHashSet < Ident > ,
1585
1585
builtin_macros : FxHashMap < Name , & ' a NameBinding < ' a > > ,
1586
1586
macro_use_prelude : FxHashMap < Name , & ' a NameBinding < ' a > > ,
@@ -1654,7 +1654,7 @@ impl<'a> ResolverArenas<'a> {
1654
1654
}
1655
1655
}
1656
1656
1657
- impl < ' a , ' b : ' a , ' cl : ' b > ty:: DefIdTree for & ' a Resolver < ' b , ' cl > {
1657
+ impl < ' a , ' b : ' a > ty:: DefIdTree for & ' a Resolver < ' b > {
1658
1658
fn parent ( self , id : DefId ) -> Option < DefId > {
1659
1659
match id. krate {
1660
1660
LOCAL_CRATE => self . definitions . def_key ( id. index ) . parent ,
@@ -1665,7 +1665,7 @@ impl<'a, 'b: 'a, 'cl: 'b> ty::DefIdTree for &'a Resolver<'b, 'cl> {
1665
1665
1666
1666
/// This interface is used through the AST→HIR step, to embed full paths into the HIR. After that
1667
1667
/// the resolver is no longer needed as all the relevant information is inline.
1668
- impl < ' a , ' cl > hir:: lowering:: Resolver for Resolver < ' a , ' cl > {
1668
+ impl < ' a > hir:: lowering:: Resolver for Resolver < ' a > {
1669
1669
fn resolve_hir_path (
1670
1670
& mut self ,
1671
1671
path : & ast:: Path ,
@@ -1711,7 +1711,7 @@ impl<'a, 'cl> hir::lowering::Resolver for Resolver<'a, 'cl> {
1711
1711
}
1712
1712
}
1713
1713
1714
- impl < ' a , ' crateloader > Resolver < ' a , ' crateloader > {
1714
+ impl < ' a > Resolver < ' a > {
1715
1715
/// Rustdoc uses this to resolve things in a recoverable way. ResolutionError<'a>
1716
1716
/// isn't something that can be returned because it can't be made to live that long,
1717
1717
/// and also it's a private type. Fortunately rustdoc doesn't need to know the error,
@@ -1800,15 +1800,15 @@ impl<'a, 'crateloader> Resolver<'a, 'crateloader> {
1800
1800
}
1801
1801
}
1802
1802
1803
- impl < ' a , ' crateloader : ' a > Resolver < ' a , ' crateloader > {
1803
+ impl < ' a > Resolver < ' a > {
1804
1804
pub fn new ( session : & ' a Session ,
1805
1805
cstore : & ' a CStore ,
1806
1806
krate : & Crate ,
1807
1807
crate_name : & str ,
1808
1808
make_glob_map : MakeGlobMap ,
1809
- crate_loader : & ' a mut CrateLoader < ' crateloader > ,
1809
+ crate_loader : & ' a mut CrateLoader < ' a > ,
1810
1810
arenas : & ' a ResolverArenas < ' a > )
1811
- -> Resolver < ' a , ' crateloader > {
1811
+ -> Resolver < ' a > {
1812
1812
let root_def_id = DefId :: local ( CRATE_DEF_INDEX ) ;
1813
1813
let root_module_kind = ModuleKind :: Def ( Def :: Mod ( root_def_id) , keywords:: Invalid . name ( ) ) ;
1814
1814
let graph_root = arenas. alloc_module ( ModuleData {
0 commit comments