Function ladderz::pre_algebra::get_factor_pairs
source · pub fn get_factor_pairs(n: u32) -> HashSet<(u32, u32)>Expand description
Finds all factor pairs for a positive integer n.
Function ladderz::pre_algebra::get_factor_pairs
source · pub fn get_factor_pairs(n: u32) -> HashSet<(u32, u32)>Expand description
Finds all factor pairs for a positive integer n.
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
diff --git a/ladderz/pre_algebra/fn.get_factors.html b/ladderz/pre_algebra/fn.get_factors.html
index 7a9dfa4..c311987 100644
--- a/ladderz/pre_algebra/fn.get_factors.html
+++ b/ladderz/pre_algebra/fn.get_factors.html
@@ -1,4 +1,4 @@
-
Function ladderz::pre_algebra::get_factors
source · pub fn get_factors(n: u32) -> HashSet<u32>Expand description
Finds all factors of a positive integer n.
Function ladderz::pre_algebra::get_factors
source · pub fn get_factors(n: u32) -> HashSet<u32>Expand description
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).
This function calculates and returns a HashSet<u32> containing all unique factors
diff --git a/ladderz/pre_algebra/fn.get_multiples_in_range.html b/ladderz/pre_algebra/fn.get_multiples_in_range.html
index a40ed5a..61ee8a6 100644
--- a/ladderz/pre_algebra/fn.get_multiples_in_range.html
+++ b/ladderz/pre_algebra/fn.get_multiples_in_range.html
@@ -1,4 +1,4 @@
-
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]).
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/ladderz/pre_algebra/fn.get_prime_factorization.html b/ladderz/pre_algebra/fn.get_prime_factorization.html
index 14e55a9..7428244 100644
--- a/ladderz/pre_algebra/fn.get_prime_factorization.html
+++ b/ladderz/pre_algebra/fn.get_prime_factorization.html
@@ -1,4 +1,4 @@
-get_prime_factorization in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::get_prime_factorization
source · pub fn get_prime_factorization(n: u32) -> HashMap<u32, u32>
Expand description
Returns the prime factorization of a positive integer n.
+get_prime_factorization in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::get_prime_factorization
source · pub fn get_prime_factorization(n: u32) -> HashMap<u32, u32>
Expand description
Returns the prime factorization of a positive integer n.
For example the prime factorization of 12 is 22 * 31, and the output is a HashMap of the form
[(2, 2), (3, 1)] where the first element of each tuple is the prime factor and the second element is the exponent.
Examples
diff --git a/ladderz/pre_algebra/fn.get_primes_in_range.html b/ladderz/pre_algebra/fn.get_primes_in_range.html
index d2c18ad..4b7480b 100644
--- a/ladderz/pre_algebra/fn.get_primes_in_range.html
+++ b/ladderz/pre_algebra/fn.get_primes_in_range.html
@@ -1,4 +1,4 @@
-get_primes_in_range in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::get_primes_in_range
source · pub fn get_primes_in_range(start: u32, end: u32) -> HashSet<u32>
Expand description
Returns all prime numbers in the range [start, end].
+get_primes_in_range in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::get_primes_in_range
source · pub fn get_primes_in_range(start: u32, end: u32) -> HashSet<u32>
Expand description
Returns all prime numbers in the range [start, end].
A prime number is a positive integer greater than 1 that is
not evenly divisible by any positive integer other than 1 and itself.
Examples
diff --git a/ladderz/pre_algebra/fn.is_composite.html b/ladderz/pre_algebra/fn.is_composite.html
index 324daf2..211bd29 100644
--- a/ladderz/pre_algebra/fn.is_composite.html
+++ b/ladderz/pre_algebra/fn.is_composite.html
@@ -1,4 +1,4 @@
-is_composite in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::is_composite
source · pub fn is_composite(n: u32) -> bool
Expand description
Checks if a positive integer n is a composite number.
+is_composite in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::is_composite
source · pub fn is_composite(n: u32) -> bool
Expand description
Checks if a positive integer n is a composite number.
A composite number is a positive integer that is evenly divisible
by a positive integer other than 1 and itself.
Examples
diff --git a/ladderz/pre_algebra/fn.is_factor.html b/ladderz/pre_algebra/fn.is_factor.html
index 83b0b22..d0c3e54 100644
--- a/ladderz/pre_algebra/fn.is_factor.html
+++ b/ladderz/pre_algebra/fn.is_factor.html
@@ -1,4 +1,4 @@
-is_factor in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::is_factor
source · pub fn is_factor(x: u32, y: u32) -> bool
Expand description
Checks if a positive integer x is a factor of another positive integer y.
+is_factor in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::is_factor
source · pub fn is_factor(x: u32, y: u32) -> bool
Expand description
Checks if a positive integer x is a factor of another positive integer y.
A factor of y is a positive integer x where y is evenly divisible by x (i.e., y % x == 0).
Examples
use ladderz::pre_algebra::is_factor;
diff --git a/ladderz/pre_algebra/fn.is_multiple.html b/ladderz/pre_algebra/fn.is_multiple.html
index 62c6552..77651ac 100644
--- a/ladderz/pre_algebra/fn.is_multiple.html
+++ b/ladderz/pre_algebra/fn.is_multiple.html
@@ -1,4 +1,4 @@
-is_multiple in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::is_multiple
source · pub fn is_multiple(x: u32, y: u32) -> bool
Expand description
Checks if a positive integer x is a multiple of another positive integer y.
+is_multiple in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::is_multiple
source · pub fn is_multiple(x: u32, y: u32) -> bool
Expand description
Checks if a positive integer x is a multiple of another positive integer y.
A multiple of y is a positive integer x where x is evenly divisible by y (i.e., x % y == 0).
Examples
use ladderz::pre_algebra::is_multiple;
diff --git a/ladderz/pre_algebra/fn.is_prime.html b/ladderz/pre_algebra/fn.is_prime.html
index 2187f9b..8c5fbeb 100644
--- a/ladderz/pre_algebra/fn.is_prime.html
+++ b/ladderz/pre_algebra/fn.is_prime.html
@@ -1,4 +1,4 @@
-is_prime in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::is_prime
source · pub fn is_prime(n: u32) -> bool
Expand description
Checks if a positive integer n is a prime number.
+is_prime in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::is_prime
source · pub fn is_prime(n: u32) -> bool
Expand description
Checks if a positive integer n is a prime number.
A prime number is a positive integer greater than 1 that is
not evenly divisible by any positive integer other than 1 and itself.
Examples
diff --git a/ladderz/pre_algebra/index.html b/ladderz/pre_algebra/index.html
index dbb1d41..3204a20 100644
--- a/ladderz/pre_algebra/index.html
+++ b/ladderz/pre_algebra/index.html
@@ -1,4 +1,4 @@
-ladderz::pre_algebra - Rust Module ladderz::pre_algebra
source · Expand description
Various pre-algebra implementations including factor pairs, factors, multiples, and more.
+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;
diff --git a/ladderz/pre_algebra/unit1/fn.get_factor_pairs.html b/ladderz/pre_algebra/unit1/fn.get_factor_pairs.html
deleted file mode 100644
index 72ccb16..0000000
--- a/ladderz/pre_algebra/unit1/fn.get_factor_pairs.html
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-
- Redirection
-
-
- Redirecting to ../../../ladderz/pre_algebra/fn.get_factor_pairs.html...
-
-
-
\ No newline at end of file
diff --git a/ladderz/pre_algebra/unit1/fn.get_factors.html b/ladderz/pre_algebra/unit1/fn.get_factors.html
deleted file mode 100644
index 8a55f0e..0000000
--- a/ladderz/pre_algebra/unit1/fn.get_factors.html
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-
- Redirection
-
-
- Redirecting to ../../../ladderz/pre_algebra/fn.get_factors.html...
-
-
-
\ No newline at end of file
diff --git a/ladderz/pre_algebra/unit1/fn.get_multiples_in_range.html b/ladderz/pre_algebra/unit1/fn.get_multiples_in_range.html
deleted file mode 100644
index 0b0e71b..0000000
--- a/ladderz/pre_algebra/unit1/fn.get_multiples_in_range.html
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-
- Redirection
-
-
- Redirecting to ../../../ladderz/pre_algebra/fn.get_multiples_in_range.html...
-
-
-
\ No newline at end of file
diff --git a/ladderz/pre_algebra/unit1/fn.get_prime_factorization.html b/ladderz/pre_algebra/unit1/fn.get_prime_factorization.html
deleted file mode 100644
index 9aafba1..0000000
--- a/ladderz/pre_algebra/unit1/fn.get_prime_factorization.html
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-
- Redirection
-
-
- Redirecting to ../../../ladderz/pre_algebra/fn.get_prime_factorization.html...
-
-
-
\ No newline at end of file
diff --git a/ladderz/pre_algebra/unit1/fn.get_primes_in_range.html b/ladderz/pre_algebra/unit1/fn.get_primes_in_range.html
deleted file mode 100644
index d727259..0000000
--- a/ladderz/pre_algebra/unit1/fn.get_primes_in_range.html
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-
- Redirection
-
-
- Redirecting to ../../../ladderz/pre_algebra/fn.get_primes_in_range.html...
-
-
-
\ No newline at end of file
diff --git a/ladderz/pre_algebra/unit1/fn.is_composite.html b/ladderz/pre_algebra/unit1/fn.is_composite.html
deleted file mode 100644
index 227c392..0000000
--- a/ladderz/pre_algebra/unit1/fn.is_composite.html
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-
- Redirection
-
-
- Redirecting to ../../../ladderz/pre_algebra/fn.is_composite.html...
-
-
-
\ No newline at end of file
diff --git a/ladderz/pre_algebra/unit1/fn.is_factor.html b/ladderz/pre_algebra/unit1/fn.is_factor.html
deleted file mode 100644
index df0e5c7..0000000
--- a/ladderz/pre_algebra/unit1/fn.is_factor.html
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-
- Redirection
-
-
- Redirecting to ../../../ladderz/pre_algebra/fn.is_factor.html...
-
-
-
\ No newline at end of file
diff --git a/ladderz/pre_algebra/unit1/fn.is_multiple.html b/ladderz/pre_algebra/unit1/fn.is_multiple.html
deleted file mode 100644
index 13cd304..0000000
--- a/ladderz/pre_algebra/unit1/fn.is_multiple.html
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-
- Redirection
-
-
- Redirecting to ../../../ladderz/pre_algebra/fn.is_multiple.html...
-
-
-
\ No newline at end of file
diff --git a/ladderz/pre_algebra/unit1/fn.is_prime.html b/ladderz/pre_algebra/unit1/fn.is_prime.html
deleted file mode 100644
index 98d0ff3..0000000
--- a/ladderz/pre_algebra/unit1/fn.is_prime.html
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-
- Redirection
-
-
- Redirecting to ../../../ladderz/pre_algebra/fn.is_prime.html...
-
-
-
\ No newline at end of file
diff --git a/src-files.js b/src-files.js
index a986af6..18ec09d 100644
--- a/src-files.js
+++ b/src-files.js
@@ -1,4 +1,4 @@
var srcIndex = JSON.parse('{\
-"ladderz":["",[["pre_algebra",[],["mod.rs","unit1.rs"]]],["lib.rs"]]\
+"ladderz":["",[],["lib.rs","pre_algebra.rs"]]\
}');
createSrcSidebar();
diff --git a/src/ladderz/pre_algebra/unit1.rs.html b/src/ladderz/pre_algebra.rs.html
similarity index 89%
rename from src/ladderz/pre_algebra/unit1.rs.html
rename to src/ladderz/pre_algebra.rs.html
index d134176..a3244bf 100644
--- a/src/ladderz/pre_algebra/unit1.rs.html
+++ b/src/ladderz/pre_algebra.rs.html
@@ -1,4 +1,4 @@
-unit1.rs - source