rzmk/ladderz
1
0
Fork 0
mirror of https://github.com/rzmk/ladderz.git synced 2025-12-19 06:59:25 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

deploy: aa3521288c

Browse source
This commit is contained in:
rzmk 2023-09-21 20:51:36 +00:00
parent 37beb78f2d
commit 2e23b86596
2 changed files with 1 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

3
ladderz/pre_algebra/fn.get_multiples_in_range.html
View file

File diff suppressed because one or more lines are too long

4
src/ladderz/pre_algebra/unit1.rs.html
View file

@ -211,8 +211,6 @@
<a href="#211" id="211">211</a> <a href="#211" id="211">211</a>
<a href="#212" id="212">212</a> <a href="#212" id="212">212</a>
<a href="#213" id="213">213</a> <a href="#213" id="213">213</a>
<a href="#214" id="214">214</a>
<a href="#215" id="215">215</a>
</pre></div><pre class="rust"><code><span class="kw">use </span>std::collections::HashSet; </pre></div><pre class="rust"><code><span class="kw">use </span>std::collections::HashSet;
<span class="doccomment">/// Finds all factor pairs for a positive integer `n`. <span class="doccomment">/// Finds all factor pairs for a positive integer `n`.
@ -338,8 +336,6 @@
<span class="doccomment">/// Finds all the multiples of a positive integer `n` up to and including `end` (in the range [n, end]). <span class="doccomment">/// Finds all the multiples of a positive integer `n` up to and including `end` (in the range [n, end]).
/// ///
/// Returns a `HashSet&lt;u32&gt;` 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`). /// A multiple of `n` is a positive integer `num` where `num` is evenly divisible by `n` (i.e., `num % n == 0`).
/// ///
/// # Examples /// # Examples