ensure all tests run for recursive solve

Author: nikomatsakis

tests/test/coinduction.rs

@@ -210,7 +210,15 @@ fn coinductive_unsound1() {
 
         goal {
             forall<X> { X: C1orC2 }
-        } yields_all[SolverChoice::slg(3, None)] {
+        } yields[SolverChoice::slg(3, None)] {
+            "No possible solution"
+        }
+
+        goal {
+            forall<X> { X: C1orC2 }
+        } yields[SolverChoice::recursive()] {
+            // FIXME -- recursive solver doesn't handle coinduction correctly
+            "Unique; substitution [], lifetime constraints []"
         }
     }
 }
@@ -251,7 +259,8 @@ fn coinductive_unsound2() {
 
         goal {
             forall<X> { X: C1orC2 }
-        } yields_all[SolverChoice::slg(3, None)] {
+        } yields {
+            "No possible solution"
         }
     }
 }
@@ -298,8 +307,8 @@ fn coinductive_multicycle1() {
 
         goal {
             forall<X> { X: Any }
-        } yields_all[SolverChoice::slg(3, None)] {
-            "substitution [], lifetime constraints []"
+        } yields {
+            "Unique; substitution [], lifetime constraints []"
         }
     }
 }
@@ -338,8 +347,8 @@ fn coinductive_multicycle2() {
 
         goal {
             forall<X> { X: Any }
-        } yields_all[SolverChoice::slg(3, None)] {
-            "substitution [], lifetime constraints []"
+        } yields {
+            "Unique; substitution [], lifetime constraints []"
         }
     }
 }
@@ -388,7 +397,8 @@ fn coinductive_multicycle3() {
 
         goal {
             forall<X> { X: Any }
-        } yields_all[SolverChoice::slg(3, None)] {
+        } yields {
+            "No possible solution"
         }
     }
 }
@@ -439,5 +449,12 @@ fn coinductive_multicycle4() {
             forall<X> { X: Any }
         } yields_all[SolverChoice::slg(3, None)] {
         }
+
+        goal {
+            forall<X> { X: Any }
+        } yields[SolverChoice::recursive()] {
+            // FIXME -- recursive solver doesn't have coinduction correctly
+            "Unique; substitution [], lifetime constraints []"
+        }
     }
 }

tests/test/misc.rs

@@ -129,6 +129,8 @@ fn only_draw_so_many() {
             exists<T> { T: Sized }
         } yields[SolverChoice::slg(10, Some(2))] {
             "Ambiguous; no inference guidance"
+        } yields[SolverChoice::recursive()] {
+            "Ambiguous; no inference guidance"
         }
     }
 }
@@ -155,6 +157,8 @@ fn only_draw_so_many_blow_up() {
             exists<T> { T: Foo }
         } yields[SolverChoice::slg(10, Some(2))] {
             "Ambiguous; definite substitution for<?U0> { [?0 := Vec<^0.0>] }"
+        } yields[SolverChoice::recursive()] {
+            "Ambiguous; definite substitution for<?U0> { [?0 := Vec<^0.0>] }"
         }
     }
 }