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: f135bad4ad

Browse source
This commit is contained in:
rzmk 2024-01-02 04:33:10 +00:00
parent 0c6484d2d0
commit fa436468ad
2 changed files with 20 additions and 20 deletions
Download patch file Download diff file Expand all files Collapse all files

20
lz/prealgebra/enum.Prealgebra.html
View file

@ -43,34 +43,34 @@
</div></div><div class="sub-variant-field"><span id="variant.FactorPairs.field.raw" class="small-section-header"><a href="#variant.FactorPairs.field.raw" class="anchor field">§</a><code>raw: <a class="primitive" href="https://doc.rust-lang.org/1.75.0/std/primitive.bool.html">bool</a></code></span><div class="docblock"><p>Whether or not to return the raw output.</p>
</div></div></div><div class="docblock"><p>Finds all factor pairs for a positive integer.</p>
<h5 id="example"><a href="#example">Example</a></h5><h6 id="input"><a href="#input">Input</a></h6><div class="example-wrap"><pre class="language-bash"><code>lz prealgebra factor-pairs 12
</code></pre></div><h6 id="output"><a href="#output">Output</a></h6><div class="example-wrap"><pre class="language-bash"><code>The factor pairs of 12 are [(1, 12), (2, 6), (3, 4)].
</code></pre></div><h5 id="raw-output-use--r-or---raw"><a href="#raw-output-use--r-or---raw">Raw Output (use <code>-r</code> or <code>--raw</code>)</a></h5><div class="example-wrap"><pre class="language-bash"><code>[(1, 12), (2, 6), (3, 4)]
</code></pre></div><h6 id="output"><a href="#output">Output</a></h6><div class="example-wrap"><pre class="language-bash"><code>The factor pairs of 12 are {(1, 12), (2, 6), (3, 4)}.
</code></pre></div><h5 id="raw-output-use--r-or---raw"><a href="#raw-output-use--r-or---raw">Raw Output (use <code>-r</code> or <code>--raw</code>)</a></h5><div class="example-wrap"><pre class="language-bash"><code>{(1, 12), (2, 6), (3, 4)}
</code></pre></div></div><section id="variant.Factors" class="variant"><a href="#variant.Factors" class="anchor">§</a><h3 class="code-header">Factors</h3></section><div class="sub-variant" id="variant.Factors.fields"><h4>Fields</h4><div class="sub-variant-field"><span id="variant.Factors.field.n" class="small-section-header"><a href="#variant.Factors.field.n" class="anchor field">§</a><code>n: <a class="primitive" href="https://doc.rust-lang.org/1.75.0/std/primitive.u32.html">u32</a></code></span><div class="docblock"><p>The positive integer to find factors for.</p>
</div></div><div class="sub-variant-field"><span id="variant.Factors.field.raw" class="small-section-header"><a href="#variant.Factors.field.raw" class="anchor field">§</a><code>raw: <a class="primitive" href="https://doc.rust-lang.org/1.75.0/std/primitive.bool.html">bool</a></code></span><div class="docblock"><p>Whether or not to return the raw output.</p>
</div></div></div><div class="docblock"><p>Finds all factors for a positive integer.</p>
<h5 id="example-1"><a href="#example-1">Example</a></h5><h6 id="input-1"><a href="#input-1">Input</a></h6><div class="example-wrap"><pre class="language-bash"><code>lz prealgebra factors 12
</code></pre></div><h6 id="output-1"><a href="#output-1">Output</a></h6><div class="example-wrap"><pre class="language-bash"><code>The factors of 12 are [1, 2, 3, 4, 6, 12].
</code></pre></div><h5 id="raw-output-use--r-or---raw-1"><a href="#raw-output-use--r-or---raw-1">Raw Output (use <code>-r</code> or <code>--raw</code>)</a></h5><div class="example-wrap"><pre class="language-bash"><code>[1, 2, 3, 4, 6, 12]
</code></pre></div><h6 id="output-1"><a href="#output-1">Output</a></h6><div class="example-wrap"><pre class="language-bash"><code>The factors of 12 are {1, 2, 3, 4, 6, 12}.
</code></pre></div><h5 id="raw-output-use--r-or---raw-1"><a href="#raw-output-use--r-or---raw-1">Raw Output (use <code>-r</code> or <code>--raw</code>)</a></h5><div class="example-wrap"><pre class="language-bash"><code>{1, 2, 3, 4, 6, 12}
</code></pre></div></div><section id="variant.MultiplesInRange" class="variant"><a href="#variant.MultiplesInRange" class="anchor">§</a><h3 class="code-header">MultiplesInRange</h3></section><div class="sub-variant" id="variant.MultiplesInRange.fields"><h4>Fields</h4><div class="sub-variant-field"><span id="variant.MultiplesInRange.field.n" class="small-section-header"><a href="#variant.MultiplesInRange.field.n" class="anchor field">§</a><code>n: <a class="primitive" href="https://doc.rust-lang.org/1.75.0/std/primitive.u32.html">u32</a></code></span><div class="docblock"><p>The positive integer to find multiples for.</p>
</div></div><div class="sub-variant-field"><span id="variant.MultiplesInRange.field.upper_bound" class="small-section-header"><a href="#variant.MultiplesInRange.field.upper_bound" class="anchor field">§</a><code>upper_bound: <a class="primitive" href="https://doc.rust-lang.org/1.75.0/std/primitive.u32.html">u32</a></code></span><div class="docblock"><p>The upper bound of the range to find multiples in.</p>
</div></div><div class="sub-variant-field"><span id="variant.MultiplesInRange.field.raw" class="small-section-header"><a href="#variant.MultiplesInRange.field.raw" class="anchor field">§</a><code>raw: <a class="primitive" href="https://doc.rust-lang.org/1.75.0/std/primitive.bool.html">bool</a></code></span><div class="docblock"><p>Whether or not to return the raw output.</p>
</div></div></div><div class="docblock"><p>Finds all multiples of a positive integer in a given range.</p>
<h5 id="example-2"><a href="#example-2">Example</a></h5><h6 id="input-2"><a href="#input-2">Input</a></h6><div class="example-wrap"><pre class="language-bash"><code>lz prealgebra multiples-in-range 3 10
</code></pre></div><h6 id="output-2"><a href="#output-2">Output</a></h6><div class="example-wrap"><pre class="language-bash"><code>The multiples of 3 in the range [1, 10] are [3, 6, 9].
</code></pre></div><h5 id="raw-output-use--r-or---raw-2"><a href="#raw-output-use--r-or---raw-2">Raw Output (use <code>-r</code> or <code>--raw</code>)</a></h5><div class="example-wrap"><pre class="language-bash"><code>[3, 6, 9]
</code></pre></div><h6 id="output-2"><a href="#output-2">Output</a></h6><div class="example-wrap"><pre class="language-bash"><code>The multiples of 3 in the range [1, 10] are {3, 6, 9}.
</code></pre></div><h5 id="raw-output-use--r-or---raw-2"><a href="#raw-output-use--r-or---raw-2">Raw Output (use <code>-r</code> or <code>--raw</code>)</a></h5><div class="example-wrap"><pre class="language-bash"><code>{3, 6, 9}
</code></pre></div></div><section id="variant.PrimesInRange" class="variant"><a href="#variant.PrimesInRange" class="anchor">§</a><h3 class="code-header">PrimesInRange</h3></section><div class="sub-variant" id="variant.PrimesInRange.fields"><h4>Fields</h4><div class="sub-variant-field"><span id="variant.PrimesInRange.field.lower_bound" class="small-section-header"><a href="#variant.PrimesInRange.field.lower_bound" class="anchor field">§</a><code>lower_bound: <a class="primitive" href="https://doc.rust-lang.org/1.75.0/std/primitive.u32.html">u32</a></code></span><div class="docblock"><p>The lower bound of the range to find primes in.</p>
</div></div><div class="sub-variant-field"><span id="variant.PrimesInRange.field.upper_bound" class="small-section-header"><a href="#variant.PrimesInRange.field.upper_bound" class="anchor field">§</a><code>upper_bound: <a class="primitive" href="https://doc.rust-lang.org/1.75.0/std/primitive.u32.html">u32</a></code></span><div class="docblock"><p>The upper bound of the range to find primes in.</p>
</div></div><div class="sub-variant-field"><span id="variant.PrimesInRange.field.raw" class="small-section-header"><a href="#variant.PrimesInRange.field.raw" class="anchor field">§</a><code>raw: <a class="primitive" href="https://doc.rust-lang.org/1.75.0/std/primitive.bool.html">bool</a></code></span><div class="docblock"><p>Whether or not to return the raw output.</p>
</div></div></div><div class="docblock"><p>Finds all primes in a given range.</p>
<h5 id="example-3"><a href="#example-3">Example</a></h5><h6 id="input-3"><a href="#input-3">Input</a></h6><div class="example-wrap"><pre class="language-bash"><code>lz prealgebra primes-in-range 1 10
</code></pre></div><h6 id="output-3"><a href="#output-3">Output</a></h6><div class="example-wrap"><pre class="language-bash"><code>The primes in the range [1, 10] are [2, 3, 5, 7].
</code></pre></div><h5 id="raw-output-use--r-or---raw-3"><a href="#raw-output-use--r-or---raw-3">Raw Output (use <code>-r</code> or <code>--raw</code>)</a></h5><div class="example-wrap"><pre class="language-bash"><code>[2, 3, 5, 7]
</code></pre></div><h6 id="output-3"><a href="#output-3">Output</a></h6><div class="example-wrap"><pre class="language-bash"><code>The primes in the range [1, 10] are {2, 3, 7, 5}.
</code></pre></div><h5 id="raw-output-use--r-or---raw-3"><a href="#raw-output-use--r-or---raw-3">Raw Output (use <code>-r</code> or <code>--raw</code>)</a></h5><div class="example-wrap"><pre class="language-bash"><code>{2, 3, 7, 5}
</code></pre></div></div><section id="variant.PrimeFactorization" class="variant"><a href="#variant.PrimeFactorization" class="anchor">§</a><h3 class="code-header">PrimeFactorization</h3></section><div class="sub-variant" id="variant.PrimeFactorization.fields"><h4>Fields</h4><div class="sub-variant-field"><span id="variant.PrimeFactorization.field.n" class="small-section-header"><a href="#variant.PrimeFactorization.field.n" class="anchor field">§</a><code>n: <a class="primitive" href="https://doc.rust-lang.org/1.75.0/std/primitive.u32.html">u32</a></code></span><div class="docblock"><p>The positive integer to find the prime factorization of.</p>
</div></div><div class="sub-variant-field"><span id="variant.PrimeFactorization.field.raw" class="small-section-header"><a href="#variant.PrimeFactorization.field.raw" class="anchor field">§</a><code>raw: <a class="primitive" href="https://doc.rust-lang.org/1.75.0/std/primitive.bool.html">bool</a></code></span><div class="docblock"><p>Whether or not to return the raw output.</p>
</div></div></div><div class="docblock"><p>Finds the prime factorization of a positive integer.</p>
<h5 id="example-4"><a href="#example-4">Example</a></h5><h6 id="input-4"><a href="#input-4">Input</a></h6><div class="example-wrap"><pre class="language-bash"><code>lz prealgebra prime-factorization 12
</code></pre></div><h6 id="output-4"><a href="#output-4">Output</a></h6><div class="example-wrap"><pre class="language-bash"><code>The prime factorization of 12 is {2: 2, 3: 1}.
</code></pre></div><h5 id="raw-output-use--r-or---raw-4"><a href="#raw-output-use--r-or---raw-4">Raw Output (use <code>-r</code> or <code>--raw</code>)</a></h5><div class="example-wrap"><pre class="language-bash"><code>{2: 2, 3: 1}
</code></pre></div><h6 id="output-4"><a href="#output-4">Output</a></h6><div class="example-wrap"><pre class="language-bash"><code>The prime factorization of 12 is {3: 1, 2: 2}.
</code></pre></div><h5 id="raw-output-use--r-or---raw-4"><a href="#raw-output-use--r-or---raw-4">Raw Output (use <code>-r</code> or <code>--raw</code>)</a></h5><div class="example-wrap"><pre class="language-bash"><code>{3: 1, 2: 2}
</code></pre></div></div><section id="variant.IsComposite" class="variant"><a href="#variant.IsComposite" class="anchor">§</a><h3 class="code-header">IsComposite</h3></section><div class="sub-variant" id="variant.IsComposite.fields"><h4>Fields</h4><div class="sub-variant-field"><span id="variant.IsComposite.field.n" class="small-section-header"><a href="#variant.IsComposite.field.n" class="anchor field">§</a><code>n: <a class="primitive" href="https://doc.rust-lang.org/1.75.0/std/primitive.u32.html">u32</a></code></span><div class="docblock"><p>The positive integer to determine if it is composite.</p>
</div></div><div class="sub-variant-field"><span id="variant.IsComposite.field.raw" class="small-section-header"><a href="#variant.IsComposite.field.raw" class="anchor field">§</a><code>raw: <a class="primitive" href="https://doc.rust-lang.org/1.75.0/std/primitive.bool.html">bool</a></code></span><div class="docblock"><p>Whether or not to return the raw output.</p>
</div></div></div><div class="docblock"><p>Determines if a positive integer is composite.</p>

20
src/lz/prealgebra.rs.html
View file

@ -363,13 +363,13 @@
/// ### Output
///
/// ```bash
/// The factor pairs of 12 are [(1, 12), (2, 6), (3, 4)].
/// The factor pairs of 12 are {(1, 12), (2, 6), (3, 4)}.
/// ```
///
/// ## Raw Output (use `-r` or `--raw`)
///
/// ```bash
/// [(1, 12), (2, 6), (3, 4)]
/// {(1, 12), (2, 6), (3, 4)}
/// ```
</span>FactorPairs {
<span class="doccomment">/// The positive integer to find factor pairs for.
@ -391,13 +391,13 @@
/// ### Output
///
/// ```bash
/// The factors of 12 are [1, 2, 3, 4, 6, 12].
/// The factors of 12 are {1, 2, 3, 4, 6, 12}.
/// ```
///
/// ## Raw Output (use `-r` or `--raw`)
///
/// ```bash
/// [1, 2, 3, 4, 6, 12]
/// {1, 2, 3, 4, 6, 12}
/// ```
</span>Factors {
<span class="doccomment">/// The positive integer to find factors for.
@ -419,13 +419,13 @@
/// ### Output
///
/// ```bash
/// The multiples of 3 in the range [1, 10] are [3, 6, 9].
/// The multiples of 3 in the range [1, 10] are {3, 6, 9}.
/// ```
///
/// ## Raw Output (use `-r` or `--raw`)
///
/// ```bash
/// [3, 6, 9]
/// {3, 6, 9}
/// ```
</span>MultiplesInRange {
<span class="doccomment">/// The positive integer to find multiples for.
@ -449,13 +449,13 @@
/// ### Output
///
/// ```bash
/// The primes in the range [1, 10] are [2, 3, 5, 7].
/// The primes in the range [1, 10] are {2, 3, 7, 5}.
/// ```
///
/// ## Raw Output (use `-r` or `--raw`)
///
/// ```bash
/// [2, 3, 5, 7]
/// {2, 3, 7, 5}
/// ```
</span>PrimesInRange {
<span class="doccomment">/// The lower bound of the range to find primes in.
@ -479,13 +479,13 @@
/// ### Output
///
/// ```bash
/// The prime factorization of 12 is {2: 2, 3: 1}.
/// The prime factorization of 12 is {3: 1, 2: 2}.
/// ```
///
/// ## Raw Output (use `-r` or `--raw`)
///
/// ```bash
/// {2: 2, 3: 1}
/// {3: 1, 2: 2}
/// ```
</span>PrimeFactorization {
<span class="doccomment">/// The positive integer to find the prime factorization of.