@@ -671,22 +671,24 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
671
671
if let ( ty:: ConstKind :: Unevaluated ( _) , ty:: ConstKind :: Unevaluated ( _) ) =
672
672
( c1. kind ( ) , c2. kind ( ) )
673
673
{
674
- if let ( Ok ( Some ( a) ) , Ok ( Some ( b) ) ) = (
675
- tcx. expand_abstract_consts ( c1) ,
676
- tcx. expand_abstract_consts ( c2) ,
677
- ) && a. ty ( ) == b. ty ( ) && let Ok ( new_obligations) =
678
- self . infcx . at ( & obligation. cause , obligation. param_env ) . eq ( a, b)
679
- {
680
- let mut obligations = new_obligations. obligations ;
681
- self . add_depth (
682
- obligations. iter_mut ( ) ,
683
- obligation. recursion_depth ,
684
- ) ;
685
- return self . evaluate_predicates_recursively (
686
- previous_stack,
687
- obligations. into_iter ( ) ,
688
- ) ;
689
- }
674
+ if let Ok ( Some ( a) ) = tcx. expand_abstract_consts ( c1)
675
+ && let Ok ( Some ( b) ) = tcx. expand_abstract_consts ( c2)
676
+ && a. ty ( ) == b. ty ( )
677
+ && let Ok ( new_obligations) = self
678
+ . infcx
679
+ . at ( & obligation. cause , obligation. param_env )
680
+ . eq ( a, b)
681
+ {
682
+ let mut obligations = new_obligations. obligations ;
683
+ self . add_depth (
684
+ obligations. iter_mut ( ) ,
685
+ obligation. recursion_depth ,
686
+ ) ;
687
+ return self . evaluate_predicates_recursively (
688
+ previous_stack,
689
+ obligations. into_iter ( ) ,
690
+ ) ;
691
+ }
690
692
}
691
693
692
694
let evaluate = |c : ty:: Const < ' tcx > | {
0 commit comments