super-prime 0.1.0

Find the super prime number.
Documentation 
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

use std::str::FromStr;
use super_prime::{BigUint, insert_digit, super_prime};

#[test]
fn ready() {
    println!("it works!")
}


#[test]
fn test2() {
    let start = BigUint::from_str("13").unwrap();
    for n in insert_digit(&start, 0, true) {
        println!("{}", n);
    }
    for n in insert_digit(&start, 1, true) {
        println!("{}", n);
    }
    for n in insert_digit(&start, 2, false) {
        println!("{}", n);
    }
}

#[test]
fn test() {
    let start = BigUint::from(2usize);
    for n in super_prime(&start, 10).into_iter().rev() {
        println!("{}", n);
    }
}