From 4907e4232ee3af34c4ed1487c91cef65617a881c Mon Sep 17 00:00:00 2001 From: rzmk Date: Fri, 22 Sep 2023 14:46:26 +0000 Subject: [PATCH] deploy: d2dc769864126f4e3b7942d970f6837128e569f0 --- src/ladderz/pre_algebra/unit1.rs.html | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/src/ladderz/pre_algebra/unit1.rs.html b/src/ladderz/pre_algebra/unit1.rs.html index 2f228d4..3e950bb 100644 --- a/src/ladderz/pre_algebra/unit1.rs.html +++ b/src/ladderz/pre_algebra/unit1.rs.html @@ -241,7 +241,6 @@ 241 242 243 -244 
use std::collections::HashSet;
 
 /// Finds all factor pairs for a positive integer `n`.
@@ -470,8 +469,7 @@
         let expected_2: HashSet<u32> = [5, 10, 15, 20, 25, 30].into();
         assert_eq!(result_2, expected_2);
 
-        // Test when the range has no multiples
-        let result_3: HashSet<u32> = get_multiples_in_range(7, 11);
+        let result_3: HashSet<u32> = get_multiples_in_range(7, 11);
         let expected_3: HashSet<u32> = [7].into();
         assert_eq!(expected_3, result_3);
     }