@@ -24,17 +24,14 @@ mod wf_lowering;
24
24
25
25
fn format_solution ( mut result : Option < Solution < ChalkIr > > , interner : ChalkIr ) -> String {
26
26
// sort constraints, since the different solvers may output them in different order
27
- match & mut result {
28
- Some ( Solution :: Unique ( solution) ) => {
29
- let mut sorted = solution. value . constraints . as_slice ( interner) . to_vec ( ) ;
30
- sorted. sort_by_key ( |c| format ! ( "{:?}" , c) ) ;
31
- solution. value . constraints = Constraints :: from_iter ( interner, sorted) ;
32
- }
33
- _ => { }
27
+ if let Some ( Solution :: Unique ( solution) ) = & mut result {
28
+ let mut sorted = solution. value . constraints . as_slice ( interner) . to_vec ( ) ;
29
+ sorted. sort_by_key ( |c| format ! ( "{:?}" , c) ) ;
30
+ solution. value . constraints = Constraints :: from_iter ( interner, sorted) ;
34
31
}
35
32
match result {
36
- Some ( v) => format ! ( "{}" , v. display( ChalkIr ) ) ,
37
- None => format ! ( "No possible solution" ) ,
33
+ Some ( v) => v. display ( ChalkIr ) . to_string ( ) ,
34
+ None => "No possible solution" . to_string ( ) ,
38
35
}
39
36
}
40
37
@@ -310,7 +307,7 @@ fn solve_goal(
310
307
assert_result ( result, expected, db. interner ( ) ) ;
311
308
}
312
309
TestGoal :: All ( expected) => {
313
- let mut expected = expected. into_iter ( ) ;
310
+ let mut expected = expected. iter ( ) ;
314
311
assert ! (
315
312
db. solve_multiple( & peeled_goal, & mut |result, next_result| {
316
313
match expected. next( ) {
@@ -334,7 +331,7 @@ fn solve_goal(
334
331
}
335
332
}
336
333
TestGoal :: First ( expected) => {
337
- let mut expected = expected. into_iter ( ) ;
334
+ let mut expected = expected. iter ( ) ;
338
335
db. solve_multiple ( & peeled_goal, & mut |result, next_result| match expected
339
336
. next ( )
340
337
{
0 commit comments