Merge pull request #62 from chrissimpkins/remove-duplicated-start-check

Refactor Toolchain testing, eliminate duplicated start date checks

Author: pnkfelix

src/least_satisfying.rs

@@ -16,23 +16,13 @@ where
     let mut cache = BTreeMap::new();
     let mut predicate = |idx: usize| *cache.entry(idx).or_insert_with(|| predicate(&slice[idx]));
     let mut unknown_ranges: Vec<(usize, usize)> = Vec::new();
-    let mut rm_no = 0; // presume that the slice starts with a no
+    // presume that the slice starts with a no
+    // this should be tested before call
+    let mut rm_no = 0;
 
-    eprintln!("verifying the start of the range does not reproduce the regression");
-    match predicate(rm_no) {
-        Satisfies::No => {
-            eprintln!("confirmed the start of the range does not reproduce the regression")
-        }
-        _ => panic!("the start of the range to test must not reproduce the regression"),
-    }
-
-    let mut lm_yes = slice.len() - 1; // presume that the slice ends with a yes
-
-    eprintln!("verifying the end of the range reproduces the regression");
-    match predicate(lm_yes) {
-        Satisfies::Yes => eprintln!("confirmed the end of the range reproduces the regression"),
-        _ => panic!("the end of the range to test must reproduce the regression"),
-    }
+    // presume that the slice ends with a yes
+    // this should be tested before the call
+    let mut lm_yes = slice.len() - 1;
 
     let mut next = (rm_no + lm_yes) / 2;
 
@@ -111,7 +101,7 @@ mod tests {
     #[test]
     fn least_satisfying_1() {
         assert_eq!(
-            least_satisfying(&[No, Unknown, Unknown, No, Yes], |i| *i),
+            least_satisfying(&[No, Unknown, Unknown, No, Yes],|i| *i),
             4
         );
     }
@@ -155,7 +145,7 @@ mod tests {
     #[test]
     fn least_satisfying_8() {
         assert_eq!(
-            least_satisfying(&[No, Unknown, No, No, Unknown, Yes, Yes], |i| *i),
+            least_satisfying(&[No, Unknown, No, No, Unknown, Yes, Yes],|i| *i),
             5
         );
     }