@@ -81,21 +81,32 @@ impl<'tcx> RegionInferenceContext<'tcx> {
81
81
let ( path, target_region) = self
82
82
. find_constraint_paths_between_regions ( from_region, target_test)
83
83
. unwrap ( ) ;
84
- debug ! ( "best_blame_constraint: path={:#?}" , path) ;
84
+ debug ! (
85
+ "best_blame_constraint: path={:#?}" ,
86
+ path. iter( )
87
+ . map( |& ci| format!(
88
+ "{:?}: {:?} ({:?}: {:?})" ,
89
+ ci,
90
+ & self . constraints[ ci] ,
91
+ self . constraint_sccs. scc( self . constraints[ ci] . sup) ,
92
+ self . constraint_sccs. scc( self . constraints[ ci] . sub) ,
93
+ ) )
94
+ . collect:: <Vec <_>>( )
95
+ ) ;
85
96
86
97
// Classify each of the constraints along the path.
87
98
let mut categorized_path: Vec < ( ConstraintCategory , Span ) > = path
88
99
. iter ( )
89
100
. map ( |& index| self . classify_constraint ( index, mir) )
90
101
. collect ( ) ;
91
102
debug ! (
92
- "best_blame_constraint: categorized_path={:?}" ,
103
+ "best_blame_constraint: categorized_path={:# ?}" ,
93
104
categorized_path
94
105
) ;
95
106
96
107
// Find what appears to be the most interesting path to report to the user.
97
108
categorized_path. sort_by ( |p0, p1| p0. 0 . cmp ( & p1. 0 ) ) ;
98
- debug ! ( "best_blame_constraint: sorted_path={:?}" , categorized_path) ;
109
+ debug ! ( "best_blame_constraint: sorted_path={:# ?}" , categorized_path) ;
99
110
100
111
let & ( category, span) = categorized_path. first ( ) . unwrap ( ) ;
101
112
0 commit comments