Function ladderz::pre_algebra::get_multiples_in_range
source · pub fn get_multiples_in_range(n: u32, end: u32) -> HashSet<u32>Expand description
Finds all the multiples of a positive integer n up to and including end (in the range [n, end]).
Returns a HashSet<u32> containing all the multiples of a positive integer n in the range [n, end].
Function ladderz::pre_algebra::get_multiples_in_range
source · pub fn get_multiples_in_range(n: u32, end: u32) -> HashSet<u32>Expand description
Finds all the multiples of a positive integer n up to and including end (in the range [n, end]).
A multiple of n is a positive integer num where num is evenly divisible by n (i.e., num % n == 0).
Examples
use ladderz::pre_algebra::get_multiples_in_range;
diff --git a/src/ladderz/pre_algebra/unit1.rs.html b/src/ladderz/pre_algebra/unit1.rs.html
index 851f526..5c0a6ec 100644
--- a/src/ladderz/pre_algebra/unit1.rs.html
+++ b/src/ladderz/pre_algebra/unit1.rs.html
@@ -211,8 +211,6 @@
211
212
213
-214
-215
use std::collections::HashSet;
/// Finds all factor pairs for a positive integer `n`.
@@ -338,8 +336,6 @@
/// Finds all the multiples of a positive integer `n` up to and including `end` (in the range [n, end]).
///
-/// Returns a `HashSet<u32>` containing all the multiples of a positive integer `n` in the range [n, end].
-///
/// A multiple of `n` is a positive integer `num` where `num` is evenly divisible by `n` (i.e., `num % n == 0`).
///
/// # Examples