Rust/src/math/mod.rs at master · domix80/Rust · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
mod abs;
mod aliquot_sum;
mod amicable_numbers;
mod armstrong_number;
mod baby_step_giant_step;
mod ceil;
mod chinese_remainder_theorem;
mod collatz_sequence;
mod doomsday;
mod extended_euclidean_algorithm;
mod factors;
mod fast_fourier_transform;
mod fast_power;
mod faster_perfect_numbers;
mod gaussian_elimination;
mod gcd_of_n_numbers;
mod greatest_common_divisor;
mod interest;
mod karatsuba_multiplication;
mod lcm_of_n_numbers;
mod linear_sieve;
mod matrix_ops;
mod mersenne_primes;
mod miller_rabin;
mod newton_raphson;
mod nthprime;
mod pascal_triangle;
mod perfect_numbers;
mod pollard_rho;
mod prime_check;
mod prime_factors;
mod prime_numbers;
mod quadratic_residue;
mod random;
mod sieve_of_eratosthenes;
mod signum;
mod simpson_integration;
mod sine;
mod square_root;
mod trial_division;
mod zellers_congruence_algorithm;

pub use self::abs::abs;
pub use self::aliquot_sum::aliquot_sum;
pub use self::amicable_numbers::amicable_pairs_under_n;
pub use self::armstrong_number::is_armstrong_number;
pub use self::baby_step_giant_step::baby_step_giant_step;
pub use self::ceil::ceil;
pub use self::chinese_remainder_theorem::chinese_remainder_theorem;
pub use self::collatz_sequence::sequence;
pub use self::doomsday::get_week_day;
pub use self::extended_euclidean_algorithm::extended_euclidean_algorithm;
pub use self::factors::factors;
pub use self::fast_fourier_transform::{
    fast_fourier_transform, fast_fourier_transform_input_permutation,
    inverse_fast_fourier_transform,
};
pub use self::fast_power::fast_power;
pub use self::faster_perfect_numbers::generate_perfect_numbers;
pub use self::gaussian_elimination::gaussian_elimination;
pub use self::gcd_of_n_numbers::gcd;
pub use self::greatest_common_divisor::{
    greatest_common_divisor_iterative, greatest_common_divisor_recursive,
    greatest_common_divisor_stein,
};
pub use self::interest::{compound_interest, simple_interest};
pub use self::karatsuba_multiplication::multiply;
pub use self::lcm_of_n_numbers::lcm;
pub use self::linear_sieve::LinearSieve;
pub use self::matrix_ops::Matrix;
pub use self::mersenne_primes::{get_mersenne_primes, is_mersenne_prime};
pub use self::miller_rabin::miller_rabin;
pub use self::newton_raphson::find_root;
pub use self::nthprime::nthprime;
pub use self::pascal_triangle::pascal_triangle;
pub use self::perfect_numbers::perfect_numbers;
pub use self::pollard_rho::{pollard_rho_factorize, pollard_rho_get_one_factor};
pub use self::prime_check::prime_check;
pub use self::prime_factors::prime_factors;
pub use self::prime_numbers::prime_numbers;
pub use self::quadratic_residue::cipolla;
pub use self::random::PCG32;
pub use self::sieve_of_eratosthenes::sieve_of_eratosthenes;
pub use self::signum::signum;
pub use self::simpson_integration::simpson_integration;
pub use self::sine::sine;
pub use self::square_root::{fast_inv_sqrt, square_root};
pub use self::trial_division::trial_division;
pub use self::zellers_congruence_algorithm::zellers_congruence_algorithm;