fn next_probable_small_prime(r: &BigInt) -> BigInt {
    let one = BigInt::from(1);
    let mut qtilde = r + &one;
    let mut qtilde_gen = bn_to_gen(&(r + &one));
    unsafe {
        while isprime(qtilde_gen) as c_int != 1 {
            qtilde = qtilde + &one;
            qtilde_gen = bn_to_gen(&qtilde);
        }
    }
    qtilde
}
// used for testing small primes where our prime test fails. We use Pari isprime which provides
// determinstic perfect primality checking.
used for testing small primes where our prime test fails. We use Pari isprime which provides
determinstic perfect primality checking.
used for testing small primes where our prime test fails . We use Pari isprime which provides determinstic perfect primality checking .
fn next_probable_small_prime(r: &BigInt) -> BigInt {
    let one = BigInt::from(1);
    let mut qtilde = r + &one;
    let mut qtilde_gen = bn_to_gen(&(r + &one));
    unsafe {
        while isprime(qtilde_gen) as c_int != 1 {
            qtilde = qtilde + &one;
            qtilde_gen = bn_to_gen(&qtilde);
        }
    }
    qtilde
}
fn next_probable_small_prime ( r : & BigInt ) -> BigInt { let one = BigInt :: from ( 1 ) ; let mut qtilde = r + & one ; let mut qtilde_gen = bn_to_gen ( & ( r + & one ) ) ; unsafe { while isprime ( qtilde_gen ) as c_int != 1 { qtilde = qtilde + & one ; qtilde_gen = bn_to_gen ( & qtilde ) ; } } qtilde }
used for testing small primes where our prime test fails.
used for testing small primes where our prime test fails .
r
&BigInt
r
&BigInt