@@ -255,7 +255,7 @@ impl<'a, 'tcx> InferCtxtExt<'tcx> for InferCtxt<'a, 'tcx> {
255
255
return ;
256
256
}
257
257
258
- let bound_predicate = obligation. predicate . bound_atom ( self . tcx ) ;
258
+ let bound_predicate = obligation. predicate . bound_atom ( ) ;
259
259
match bound_predicate. skip_binder ( ) {
260
260
ty:: PredicateAtom :: Trait ( trait_predicate, _) => {
261
261
let trait_predicate = bound_predicate. rebind ( trait_predicate) ;
@@ -1079,7 +1079,7 @@ impl<'a, 'tcx> InferCtxtPrivExt<'tcx> for InferCtxt<'a, 'tcx> {
1079
1079
}
1080
1080
1081
1081
// FIXME: It should be possible to deal with `ForAll` in a cleaner way.
1082
- let bound_error = error. bound_atom ( self . tcx ) ;
1082
+ let bound_error = error. bound_atom ( ) ;
1083
1083
let ( cond, error) = match ( cond. skip_binders ( ) , bound_error. skip_binder ( ) ) {
1084
1084
( ty:: PredicateAtom :: Trait ( ..) , ty:: PredicateAtom :: Trait ( error, _) ) => {
1085
1085
( cond, bound_error. rebind ( error) )
@@ -1091,7 +1091,7 @@ impl<'a, 'tcx> InferCtxtPrivExt<'tcx> for InferCtxt<'a, 'tcx> {
1091
1091
} ;
1092
1092
1093
1093
for obligation in super :: elaborate_predicates ( self . tcx , std:: iter:: once ( cond) ) {
1094
- let bound_predicate = obligation. predicate . bound_atom ( self . tcx ) ;
1094
+ let bound_predicate = obligation. predicate . bound_atom ( ) ;
1095
1095
if let ty:: PredicateAtom :: Trait ( implication, _) = bound_predicate. skip_binder ( ) {
1096
1096
let error = error. to_poly_trait_ref ( ) ;
1097
1097
let implication = bound_predicate. rebind ( implication. trait_ref ) ;
@@ -1172,7 +1172,7 @@ impl<'a, 'tcx> InferCtxtPrivExt<'tcx> for InferCtxt<'a, 'tcx> {
1172
1172
//
1173
1173
// this can fail if the problem was higher-ranked, in which
1174
1174
// cause I have no idea for a good error message.
1175
- let bound_predicate = predicate. bound_atom ( self . tcx ) ;
1175
+ let bound_predicate = predicate. bound_atom ( ) ;
1176
1176
if let ty:: PredicateAtom :: Projection ( data) = bound_predicate. skip_binder ( ) {
1177
1177
let mut selcx = SelectionContext :: new ( self ) ;
1178
1178
let ( data, _) = self . replace_bound_vars_with_fresh_vars (
@@ -1459,7 +1459,7 @@ impl<'a, 'tcx> InferCtxtPrivExt<'tcx> for InferCtxt<'a, 'tcx> {
1459
1459
return ;
1460
1460
}
1461
1461
1462
- let bound_predicate = predicate. bound_atom ( self . tcx ) ;
1462
+ let bound_predicate = predicate. bound_atom ( ) ;
1463
1463
let mut err = match bound_predicate. skip_binder ( ) {
1464
1464
ty:: PredicateAtom :: Trait ( data, _) => {
1465
1465
let self_ty = data. trait_ref . self_ty ( ) ;
0 commit comments