diff --git a/ladderz/index.html b/ladderz/index.html index c8e42a4..a30e07d 100644 --- a/ladderz/index.html +++ b/ladderz/index.html @@ -1,9 +1,9 @@ ladderz - Rust

Crate ladderz

source ·
Expand description

ladderz

Implementations of mathematical and technical concepts in Rust.

-

Subjects

+

Subjects

The modules for currently supported subjects are:

    -
  • pre_algebra
  • +
  • pre_algebra - Various pre-algebra implementations including factor pairs, factors, multiples, and more.

Example

Here’s an example of using the ladderz crate to get the factors and factor pairs of a positive integer in sorted order. diff --git a/ladderz/pre_algebra/index.html b/ladderz/pre_algebra/index.html index 089d797..a33ec37 100644 --- a/ladderz/pre_algebra/index.html +++ b/ladderz/pre_algebra/index.html @@ -1,7 +1,7 @@ ladderz::pre_algebra - Rust

Module ladderz::pre_algebra

source ·
Expand description

Various pre-algebra implementations including factor pairs, factors, multiples, and more.

Example

use ladderz::pre_algebra::get_factors;
- 
+
 fn main() {
     let x: u32 = 10;
     println!("The factors of {x} are {:?}.", get_factors(x));
diff --git a/src/ladderz/lib.rs.html b/src/ladderz/lib.rs.html
index f475bfd..5b5e780 100644
--- a/src/ladderz/lib.rs.html
+++ b/src/ladderz/lib.rs.html
@@ -114,11 +114,11 @@
 //!
 //! Implementations of mathematical and technical concepts in Rust.
 //!
-//! ## Subjects
+//! # Subjects
 //!
 //! The modules for currently supported subjects are:
 //!
-//! - [`pre_algebra`]
+//! - [pre_algebra] - Various pre-algebra implementations including factor pairs, factors, multiples, and more.
 //!
 //! # Example
 //!
@@ -205,21 +205,21 @@
 //! Great! We've successfully used the `ladderz` crate to get the factors and factor pairs of a positive integer in sorted order.
 
 /// Various pre-algebra implementations including factor pairs, factors, multiples, and more.
-/// 
+///
 /// # Example
-/// 
+///
 /// ```rust
 /// use ladderz::pre_algebra::get_factors;
-/// 
+///
 /// fn main() {
 ///     let x: u32 = 10;
 ///     println!("The factors of {x} are {:?}.", get_factors(x));
 /// }
 /// ```
-/// 
+///
 /// ```console
 /// The factors of 10 are {1, 5, 2, 10}.
 /// ```
-/// 
+///
 pub mod pre_algebra;
 
\ No newline at end of file diff --git a/src/ladderz/pre_algebra/unit1.rs.html b/src/ladderz/pre_algebra/unit1.rs.html index 5c0a6ec..c584596 100644 --- a/src/ladderz/pre_algebra/unit1.rs.html +++ b/src/ladderz/pre_algebra/unit1.rs.html @@ -217,7 +217,7 @@ /// /// A factor pair is a pair of positive integers /// `(a, b)` where `a` and `b` are both factors of `n` (i.e., `a * b == n`). -/// +/// /// This function calculates and returns a `HashSet<(u32, u32)>` containing all unique factor pairs /// of the input positive integer `n`. /// @@ -257,7 +257,7 @@ } /// Finds all factors of a positive integer `n`. -/// +/// /// A factor of `n` is a positive integer `a` where /// `n` is evenly divisible by `a` (i.e., `n % a == 0`). ///