[][src]Struct classygroup::Mpz

pub struct Mpz {
    pub inner: mpz_t,
}

Fields

inner: mpz_t

Methods

impl Mpz[src]

pub fn abs(&mut self, x: &Mpz)[src]

pub fn abs_mut(&mut self)[src]

pub fn add(&mut self, x: &Mpz, y: &Mpz)[src]

pub fn add_mut(&mut self, x: &Mpz)[src]

pub fn add_ui_mut(&mut self, x: u64)[src]

pub fn sub_ui_mut(&mut self, x: u64)[src]

pub fn sub_mul(&mut self, x: &Mpz, y: &Mpz)[src]

pub fn cmp_mpz(&self, other: &Mpz) -> i32[src]

pub fn cmpabs(&self, other: &Mpz) -> i32[src]

pub fn cmp_si(&self, val: i64) -> i32[src]

pub fn cdiv_q(&mut self, x: &Mpz, y: &Mpz)[src]

pub fn cdiv_r(&mut self, x: &Mpz, y: &Mpz)[src]

pub fn divexact(&mut self, n: &Mpz, d: &Mpz)[src]

pub fn divexact_mut(&mut self, d: &Mpz)[src]

pub fn fdiv_q(&mut self, x: &Mpz, y: &Mpz)[src]

pub fn fdiv_q_mut(&mut self, x: &Mpz)[src]

pub fn fdiv_r(&mut self, x: &Mpz, y: &Mpz)[src]

pub fn fdiv_r_mut(&mut self, x: &Mpz)[src]

pub fn fdiv_qr(&mut self, r: &mut Mpz, x: &Mpz, y: &Mpz)[src]

pub fn fdiv_q_ui(&mut self, x: &Mpz, val: u64)[src]

pub fn fdiv_q_ui_mut(&mut self, val: u64)[src]

pub fn tdiv_q_mut(&mut self, x: &Mpz)[src]

pub fn fits_slong_p(&self) -> i32[src]

pub fn gcd(&mut self, x: &Mpz, y: &Mpz)[src]

pub fn gcd_mut(&mut self, x: &Mpz)[src]

pub fn gcdext(&mut self, d: &mut Mpz, e: &mut Mpz, a: &Mpz, m: &Mpz)[src]

pub fn get_si(&self) -> i64[src]

pub fn modulo(&mut self, x: &Mpz, y: &Mpz)[src]

pub fn modulo_mut(&mut self, x: &Mpz)[src]

pub fn mul(&mut self, x: &Mpz, y: &Mpz)[src]

pub fn mul_mut(&mut self, x: &Mpz)[src]

pub fn mul_ui(&mut self, x: &Mpz, val: u64)[src]

pub fn mul_si(&mut self, x: &Mpz, val: i64)[src]

pub fn mul_ui_mut(&mut self, val: u64)[src]

pub fn neg(&mut self, x: &Mpz)[src]

pub fn neg_mut(&mut self)[src]

pub fn odd(&self) -> i32[src]

pub fn root_mut(&mut self, x: u64) -> i32[src]

pub fn set(&mut self, x: &Mpz)[src]

pub fn set_cstr(&mut self, cs: &CString)[src]

pub fn set_si(&mut self, val: i64)[src]

pub fn set_ui(&mut self, val: u64)[src]

pub fn sgn(&self) -> i32[src]

pub fn square_mut(&mut self)[src]

pub fn sub(&mut self, x: &Mpz, y: &Mpz)[src]

pub fn submul(&mut self, x: &Mpz, y: &Mpz)[src]

pub fn sub_mut(&mut self, x: &Mpz)[src]

pub fn swap(&mut self, a: &mut Mpz)[src]

pub fn tdiv_q_2exp(&mut self, op1: &Mpz, op2: u64)[src]

pub fn bit_length(&self) -> usize[src]

pub fn is_neg(&self) -> bool[src]

pub fn size(&self) -> usize[src]

pub fn getlimbn(&self, n: i64) -> limb_t[src]

pub fn is_zero(&self) -> bool[src]

pub fn is_one(&self) -> bool[src]

pub fn div_floor(&mut self, numerator: &Mpz, denom: &Mpz)[src]

pub fn add_mul(&mut self, x: &Mpz, y: &Mpz)[src]

pub fn from_bytes(data: &[u8]) -> Self[src]

pub fn to_u64(&self) -> Option<u64>[src]

pub fn one() -> Mpz[src]

pub fn zero() -> Mpz[src]

pub fn probab_prime(&self, reps: i32) -> ProbabPrimeResult[src]

Determine whether n is prime.

This function performs some trial divisions, then reps Miller-Rabin probabilistic primality tests. A higher reps value will reduce the chances of a non-prime being identified as “probably prime”. A composite number will be identified as a prime with a probability of less than 4^(-reps). Reasonable values of reps are between 15 and 50.

pub fn is_prime(&self, iterations: usize) -> bool[src]

pub fn crem_u16(&self, modulus: u16) -> u16[src]

Trait Implementations

impl Clone for Mpz[src]

impl Debug for Mpz[src]

impl Default for Mpz[src]

impl Eq for Mpz[src]

impl From<u64> for Mpz[src]

impl FromStr for Mpz[src]

type Err = NulError

The associated error which can be returned from parsing.

impl Hash for Mpz[src]

impl Ord for Mpz[src]

impl PartialEq<Mpz> for Mpz[src]

impl PartialOrd<Mpz> for Mpz[src]

impl Send for Mpz[src]

impl Sync for Mpz[src]

Auto Trait Implementations

impl RefUnwindSafe for Mpz

impl Unpin for Mpz

impl UnwindSafe for Mpz

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T, U> Cast<U> for T where
    U: FromCast<T>, 

impl<Q, K> Equivalent<K> for Q where
    K: Borrow<Q> + ?Sized,
    Q: Eq + ?Sized
[src]

impl<T> From<T> for T[src]

impl<T> FromBits<T> for T

impl<T> FromCast<T> for T

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T, U> IntoBits<U> for T where
    U: FromBits<T>, 

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<T> ToOwned for T where
    T: Clone
[src]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

impl<V, T> VZip<V> for T where
    V: MultiLane<T>,