tnt-lib 0.1.4

A Rust implementation of many certificates about Integers
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

mod number_theory {
    use num::{PrimInt, Unsigned};
    use std::{fmt::Display, ops::{AddAssign, MulAssign, DivAssign, SubAssign}};
    pub trait UnsigInt : PrimInt + Unsigned + Display + AddAssign + MulAssign + DivAssign + SubAssign{
        fn two() -> Self{
            Self::one()+Self::one()
        }
        fn three() -> Self{
            Self::two()+Self::one()
        }
    }

    impl UnsigInt for u32{}
    impl UnsigInt for usize{}

    pub mod primality {
        pub mod aks {
            pub mod aks_2002;
            pub mod aks_2003;
            pub mod aks_bernstein;
            mod aks_2005;
            mod aks_theorem;
        }
        pub mod naive;
        pub trait PrimalityTest {
            type Int;
            /// Checks whether `n` is a prime number
            /// # Examples
            /// ```
            /// use tnt_lib::PrimalityTest; // Required Trait.
            /// use tnt_lib::Naive; // Struct that implements the trait.
            /// assert!(Naive::is_prime(11));
            /// assert!(!Naive::is_prime(125));
            /// ```
            fn is_prime(n : Self::Int) -> bool;
        }
    }

    pub mod primes_less_than {
        pub mod sieve;
        pub mod naive;
        pub trait PrimesLessThan {
            type Int;
            /// Returns all prime numbers in `(1,n)` range
            /// # Examples
            /// ```
            /// use tnt_lib::PrimesLessThan; // Required Trait.
            /// use tnt_lib::NaivePlt; // Struct that implements the trait.
            /// let expected : Vec<usize> = vec![2,3,5,7];
            /// assert_eq!(NaivePlt::get_primes(11), expected);
            /// ```
            fn get_primes(n : Self::Int) -> Vec<Self::Int>;
        }
    }
    
    pub mod perfect_power {
        pub mod bernstein {
            pub mod bernstein_1998;
        }
    }
    mod util;


    
}
pub use number_theory::primality::aks::aks_2002::Aks2002;
pub use number_theory::primality::aks::aks_2003::Aks2003;
pub use number_theory::primality::naive::Naive;
pub use number_theory::perfect_power::bernstein::bernstein_1998::Bernstein1988;
//pub use number_theory::primes_less_than::sieve::Sieve;
pub use number_theory::primes_less_than::naive::NaivePlt;
pub use number_theory::primes_less_than::PrimesLessThan;
pub use number_theory::primality::PrimalityTest;