diff --git a/Documentation/Content/Welcome.aml b/Documentation/Content/Welcome.aml
index d90a73e..3033a43 100644
--- a/Documentation/Content/Welcome.aml
+++ b/Documentation/Content/Welcome.aml
@@ -18,6 +18,46 @@
+
+ Source Code
+
+
+ The source code of the library is available on
+
+ GitHub
+ https://github.com/
+ _self
+
+ in the project
+
+ Math.Gmp.Native
+ https://github.com/MachineCognitis/Math.Gmp.Native
+ _self
+ .
+
+
+
+
+
+ NuGet Package
+
+
+ You can use the library by loading it from the
+
+ NuGet
+ https://www.nuget.org/
+ _self
+
+ package
+
+ Math.Gmp.Native.NET
+ https://www.nuget.org/packages/Math.Gmp.Native.NET/
+ _self
+ .
+
+
+
+
Overview
@@ -43,1488 +83,6 @@
-
- Functions Categories
-
-
-
-
-
- Global Variable and Constants:
-
-
-
-
- P:Math.Gmp.Native.gmp_lib.gmp_errno - Gets or sets the global GMP error number.
-
-
- F:Math.Gmp.Native.gmp_lib.gmp_version - The GMP version number in the form “i.j.k”. This release is "6.1.2".
-
-
- F:Math.Gmp.Native.gmp_lib.mp_bits_per_limb - The number of bits per limb.
-
-
- F:Math.Gmp.Native.gmp_lib.mp_bytes_per_limb - The number of bytes per limb.
-
-
- F:Math.Gmp.Native.gmp_lib.mp_uint_per_limb - The number of 32-bit, unsigned integers per limb.
-
-
-
-
-
-
-
-
-
- Integer Functions:
-
-
-
-
- Initializing Integers:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_init(Math.Gmp.Native.mpz_t) - Initialize x, and set its value to 0.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_inits(Math.Gmp.Native.mpz_t[]) - Initialize a NULL-terminated list of T:Math.Gmp.Native.mpz_t variables, and set their values to 0.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_init2(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Initialize x, with space for n-bit numbers, and set its value to 0.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_clear(Math.Gmp.Native.mpz_t) - Free the space occupied by x.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_clears(Math.Gmp.Native.mpz_t[]) - Free the space occupied by a NULL-terminated list of T:Math.Gmp.Native.mpz_t variables.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_realloc2(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Change the space allocated for x to n bits.
-
-
-
-
-
-
- Assigning Integers:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_set(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set the value of rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_set_ui(Math.Gmp.Native.mpz_t,System.UInt32) - Set the value of rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_set_si(Math.Gmp.Native.mpz_t,System.Int32) - Set the value of rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_set_d(Math.Gmp.Native.mpz_t,System.Double) - Set the value of rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_set_q(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpq_t) - Set the value of rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_set_f(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpf_t) - Set the value of rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_set_str(Math.Gmp.Native.mpz_t,Math.Gmp.Native.char_ptr,System.Int32) - Set the value of rop from str, a null-terminated C string in base base.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_swap(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Swap the values rop1 and rop2 efficiently.
-
-
-
-
-
-
- Simultaneous Integer Init & Assign:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_init_set(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Initialize rop with limb space and set the initial numeric value from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_init_set_ui(Math.Gmp.Native.mpz_t,System.UInt32) - Initialize rop with limb space and set the initial numeric value from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_init_set_si(Math.Gmp.Native.mpz_t,System.Int32) - Initialize rop with limb space and set the initial numeric value from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_init_set_d(Math.Gmp.Native.mpz_t,System.Double) - Initialize rop with limb space and set the initial numeric value from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_init_set_str(Math.Gmp.Native.mpz_t,Math.Gmp.Native.char_ptr,System.Int32) - Initialize rop and set its value like M:Math.Gmp.Native.gmp_lib.mpz_set_str(Math.Gmp.Native.mpz_t,Math.Gmp.Native.char_ptr,System.Int32).
-
-
-
-
-
-
- Converting Integers:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_get_ui(Math.Gmp.Native.mpz_t) - Return the value of op as an unsigned long.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_get_si(Math.Gmp.Native.mpz_t) - Return the value of op as an signed long.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_get_d(Math.Gmp.Native.mpz_t) - Convert op to a double, truncating if necessary (i.e. rounding towards zero).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_get_d_2exp(System.Int32@,Math.Gmp.Native.mpz_t) - Convert op to a double, truncating if necessary (i.e. rounding towards zero), and returning the exponent separately.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_get_str(Math.Gmp.Native.char_ptr,System.Int32,Math.Gmp.Native.mpz_t) - Convert op to a string of digits in base base.
-
-
-
-
-
-
- Integer Arithmetic:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_add(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to op1 + op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_add_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set rop to op1 + op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_sub(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to op1 - op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_sub_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set rop to op1 - op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_ui_sub(Math.Gmp.Native.mpz_t,System.UInt32,Math.Gmp.Native.mpz_t) - Set rop to op1 - op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_mul(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to op1 * op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_mul_si(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.Int32) - Set rop to op1 * op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_mul_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set rop to op1 * op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_addmul(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to rop + op1 * op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_addmul_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set rop to rop + op1 * op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_submul(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to rop - op1 * op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_submul_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set rop to rop - op1 * op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_mul_2exp(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Set rop to op1 * 2^op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_neg(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to -op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_abs(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to the absolute value of op.
-
-
-
-
-
-
- Integer Division:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cdiv_q(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set the quotient q to ceiling(n / d).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cdiv_r(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set the remainder r to n - q * d where q = ceiling(n / d).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cdiv_qr(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set the quotient q to ceiling(n / d), and set the remainder r to n - q * d.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cdiv_q_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set the quotient q to ceiling(n / d), and return the remainder r = | n - q * d |.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cdiv_r_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set the remainder r to n - q * d where q = ceiling(n / d), and return | r |.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cdiv_qr_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set quotient q to ceiling(n / d), set the remainder r to n - q * d, and return | r |.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cdiv_ui(Math.Gmp.Native.mpz_t,System.UInt32) - Return the remainder | r | where r = n - q * d, and where q = ceiling(n / d).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cdiv_q_2exp(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Set the quotient q to ceiling(n / 2^b).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cdiv_r_2exp(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Set the remainder r to n - q * 2^b where q = ceiling(n / 2^b).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fdiv_q(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set the quotient q to floor(n / d).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fdiv_r(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set the remainder r to n - q * d where q = floor(n / d).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fdiv_qr(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set the quotient q to floor(n / d), and set the remainder r to n - q * d.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fdiv_q_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set the quotient q to floor(n / d), and return the remainder r = | n - q * d |.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fdiv_r_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set the remainder r to n - q * d where q = floor(n / d), and return | r |.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fdiv_qr_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set quotient q to floor(n / d), set the remainder r to n - q * d, and return | r |.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fdiv_ui(Math.Gmp.Native.mpz_t,System.UInt32) - Return the remainder | r | where r = n - q * d, and where q = floor(n / d).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fdiv_q_2exp(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Set the quotient q to floor(n / 2^b).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fdiv_r_2exp(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Set the remainder r to n - q * 2^b where q = floor(n / 2^b).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_tdiv_q(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set the quotient q to trunc(n / d).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_tdiv_r(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set the remainder r to n - q * d where q = trunc(n / d).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_tdiv_qr(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set the quotient q to trunc(n / d), and set the remainder r to n - q * d.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_tdiv_q_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set the quotient q to trunc(n / d), and return the remainder r = | n - q * d |.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_tdiv_r_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set the remainder r to n - q * d where q = trunc(n / d), and return | r |.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_tdiv_qr_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set quotient q to trunc(n / d), set the remainder r to n - q * d, and return | r |.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_tdiv_ui(Math.Gmp.Native.mpz_t,System.UInt32) - Return the remainder | r | where r = n - q * d, and where q = trunc(n / d).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_tdiv_q_2exp(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Set the quotient q to trunc(n / 2^b).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_tdiv_r_2exp(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Set the remainder r to n - q * 2^b where q = trunc(n / 2^b).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_mod(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set r to n mod d.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_mod_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set r to n mod d.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_divexact(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set q to n / d when it is known in advance that d divides n.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_divexact_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set q to n / d when it is known in advance that d divides n.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_divisible_p(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Return non-zero if n is exactly divisible by d.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_divisible_ui_p(Math.Gmp.Native.mpz_t,System.UInt32) - Return non-zero if n is exactly divisible by d.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_divisible_2exp_p(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Return non-zero if n is exactly divisible by 2^b.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_congruent_p(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Return non-zero if n is congruent to c modulo d.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_congruent_ui_p(Math.Gmp.Native.mpz_t,System.UInt32,System.UInt32) - Return non-zero if n is congruent to c modulo d.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_congruent_2exp_p(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Return non-zero if n is congruent to c modulo 2^b.
-
-
-
-
-
-
- Integer Exponentiation:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_powm(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to (base^exp) modulo mod.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_powm_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32,Math.Gmp.Native.mpz_t) - Set rop to (base^exp) modulo mod.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_powm_sec(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to (base^exp) modulo mod.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_pow_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set rop to base^exp. The case 0^0 yields 1.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_ui_pow_ui(Math.Gmp.Native.mpz_t,System.UInt32,System.UInt32) - Set rop to base^exp. The case 0^0 yields 1.
-
-
-
-
-
-
- Integer Roots:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_root(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set rop to the truncated integer part of the nth root of op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_rootrem(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set root to the truncated integer part of the nth root of u. Set rem to the remainder, u - root^n.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_sqrt(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to the truncated integer part of the square root of op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_sqrtrem(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop1 to the truncated integer part of the square root of op, like M:Math.Gmp.Native.gmp_lib.mpz_sqrt(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t). Set rop2 to the remainder op - rop1 * rop1, which will be zero if op is a perfect square.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_perfect_power_p(Math.Gmp.Native.mpz_t) - Return non-zero if op is a perfect power, i.e., if there exist integers a and b, with b > 1, such that op = a^b.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_perfect_square_p(Math.Gmp.Native.mpz_t) - Return non-zero if op is a perfect square, i.e., if the square root of op is an integer.
-
-
-
-
-
-
- Number Theoretic Functions:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_probab_prime_p(Math.Gmp.Native.mpz_t,System.Int32) - Determine whether n is prime.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_nextprime(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to the next prime greater than op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_gcd(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to the greatest common divisor of op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_gcd_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Compute the greatest common divisor of op1 and op2. If rop is not null, store the result there.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_gcdext(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set g to the greatest common divisor of a and b, and in addition set s and t to coefficients satisfying a * s + b * t = g.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_lcm(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to the least common multiple of op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_lcm_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Set rop to the least common multiple of op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_invert(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Compute the inverse of op1 modulo op2 and put the result in rop.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_jacobi(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Calculate the Jacobi symbol (a/b).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_legendre(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Calculate the Legendre symbol (a/p).
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_kronecker(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Calculate the Jacobi symbol (a/b) with the Kronecker extension (a/2) = (2/a) when a odd, or (a/2) = 0 when a even.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_kronecker_si(Math.Gmp.Native.mpz_t,System.Int32) - Calculate the Jacobi symbol (a/b) with the Kronecker extension (a/2) = (2/a) when a odd, or (a/2) = 0 when a even.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_kronecker_ui(Math.Gmp.Native.mpz_t,System.UInt32) - Calculate the Jacobi symbol (a/b) with the Kronecker extension (a/2) = (2/a) when a odd, or (a/2) = 0 when a even.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_si_kronecker(System.Int32,Math.Gmp.Native.mpz_t) - Calculate the Jacobi symbol (a/b) with the Kronecker extension (a/2) = (2/a) when a odd, or (a/2) = 0 when a even.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_ui_kronecker(System.UInt32,Math.Gmp.Native.mpz_t) - Calculate the Jacobi symbol (a/b) with the Kronecker extension (a/2) = (2/a) when a odd, or (a/2) = 0 when a even.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_remove(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Remove all occurrences of the factor f from op and store the result in rop.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fac_ui(Math.Gmp.Native.mpz_t,System.UInt32) - Set rop to the factorial n!.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_2fac_ui(Math.Gmp.Native.mpz_t,System.UInt32) - Set rop to the double-factorial n!!.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_mfac_uiui(Math.Gmp.Native.mpz_t,System.UInt32,System.UInt32) - Set rop to the m-multi-factorial n!^(m)n.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_primorial_ui(Math.Gmp.Native.mpz_t,System.UInt32) - Set rop to the primorial of n, i.e. the product of all positive prime numbers ≤ n.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_bin_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Compute the binomial coefficient n over k and store the result in rop.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_bin_uiui(Math.Gmp.Native.mpz_t,System.UInt32,System.UInt32) - Compute the binomial coefficient n over k and store the result in rop.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fib_ui(Math.Gmp.Native.mpz_t,System.UInt32) - Sets fn to to F[n], the n’th Fibonacci number.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fib2_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Sets fn to F[n], and fnsub1 to F[n - 1].
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_lucnum_ui(Math.Gmp.Native.mpz_t,System.UInt32) - Sets ln to to L[n], the n’th Lucas number.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_lucnum2_ui(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,System.UInt32) - Sets ln to L[n], and lnsub1 to L[n - 1].
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_millerrabin(Math.Gmp.Native.mpz_t,System.Int32) - An implementation of the probabilistic primality test found in Knuth's Seminumerical Algorithms book.
-
-
-
-
-
-
- Integer Comparisons:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cmp(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Compare op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cmp_d(Math.Gmp.Native.mpz_t,System.Double) - Compare op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cmp_si(Math.Gmp.Native.mpz_t,System.Int32) - Compare op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cmp_ui(Math.Gmp.Native.mpz_t,System.UInt32) - Compare op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cmpabs(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Compare the absolute values of op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cmpabs_d(Math.Gmp.Native.mpz_t,System.Double) - Compare the absolute values of op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_cmpabs_ui(Math.Gmp.Native.mpz_t,System.UInt32) - Compare the absolute values of op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_sgn(Math.Gmp.Native.mpz_t) - Return +1 if op > 0, 0 if op = 0, and -1 if op < 0.
-
-
-
-
-
-
- Integer Logic and Bit Fiddling:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_and(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to op1 bitwise-and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_ior(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to op1 bitwise inclusive-or op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_xor(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to op1 bitwise exclusive-or op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_com(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Set rop to the one’s complement of op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_popcount(Math.Gmp.Native.mpz_t) - Return the population count of op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_hamdist(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpz_t) - Return the hamming distance between the two operands.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_scan0(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Scan op for 0 bit.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_scan1(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Scan op for 1 bit.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_setbit(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Set bit bit_index in rop.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_clrbit(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Clear bit bit_index in rop.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_combit(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Complement bit bit_index in rop.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_tstbit(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_bitcnt_t) - Test bit bit_index in op and return 0 or 1 accordingly.
-
-
-
-
-
-
- I/O of Integers:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_out_str(Math.Gmp.Native.ptr{Math.Gmp.Native.FILE},System.Int32,Math.Gmp.Native.mpz_t) - Output op on stdio stream stream, as a string of digits in base base.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_inp_str(Math.Gmp.Native.mpz_t,Math.Gmp.Native.ptr{Math.Gmp.Native.FILE},System.Int32) - Input a possibly white-space preceded string in base base from stdio stream stream, and put the read integer in rop.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_out_raw(Math.Gmp.Native.ptr{Math.Gmp.Native.FILE},Math.Gmp.Native.mpz_t) - Output op on stdio stream stream, in raw binary format.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_inp_raw(Math.Gmp.Native.mpz_t,Math.Gmp.Native.ptr{Math.Gmp.Native.FILE}) - Input from stdio stream stream in the format written by M:Math.Gmp.Native.gmp_lib.mpz_out_raw(Math.Gmp.Native.ptr{Math.Gmp.Native.FILE},Math.Gmp.Native.mpz_t), and put the result in rop.
-
-
-
-
-
-
- Integer Random Numbers:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_urandomb(Math.Gmp.Native.mpz_t,Math.Gmp.Native.gmp_randstate_t,Math.Gmp.Native.mp_bitcnt_t) - Generate a uniformly distributed random integer in the range 0 to 2^n - 1, inclusive.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_urandomm(Math.Gmp.Native.mpz_t,Math.Gmp.Native.gmp_randstate_t,Math.Gmp.Native.mpz_t) - Generate a uniform random integer in the range 0 to n - 1, inclusive.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_rrandomb(Math.Gmp.Native.mpz_t,Math.Gmp.Native.gmp_randstate_t,Math.Gmp.Native.mp_bitcnt_t) - Generate a random integer with long strings of zeros and ones in the binary representation.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_random(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_size_t) - Generate a random integer of at most max_size limbs.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_random2(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_size_t) - Generate a random integer of at most max_size limbs, with long strings of zeros and ones in the binary representation.
-
-
-
-
-
-
- Integer Import and Export:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_import(Math.Gmp.Native.mpz_t,Math.Gmp.Native.size_t,System.Int32,Math.Gmp.Native.size_t,System.Int32,Math.Gmp.Native.size_t,Math.Gmp.Native.void_ptr) - Set rop from an array of word data at op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_export(Math.Gmp.Native.void_ptr,Math.Gmp.Native.size_t@,System.Int32,Math.Gmp.Native.size_t,System.Int32,Math.Gmp.Native.size_t,Math.Gmp.Native.mpz_t) - Fill rop with word data from op.
-
-
-
-
-
-
- Miscellaneous Integer Functions:
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fits_sint_p(Math.Gmp.Native.mpz_t) - Return non-zero iff the value of op fits in a signed 32-bit integer. Otherwise, return zero.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fits_slong_p(Math.Gmp.Native.mpz_t) - Return non-zero iff the value of op fits in a signed 32-bit integer. Otherwise, return zero.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fits_sshort_p(Math.Gmp.Native.mpz_t) - Return non-zero iff the value of op fits in a signed 16-bit integer. Otherwise, return zero.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fits_uint_p(Math.Gmp.Native.mpz_t) - Return non-zero iff the value of op fits in an unsigned 32-bit integer. Otherwise, return zero.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fits_ulong_p(Math.Gmp.Native.mpz_t) - Return non-zero iff the value of op fits in an unsigned 32-bit integer. Otherwise, return zero.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_fits_ushort_p(Math.Gmp.Native.mpz_t) - Return non-zero iff the value of op fits in an unsigned 16-bit integer. Otherwise, return zero.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_sizeinbase(Math.Gmp.Native.mpz_t,System.Int32) - Return the size of op measured in number of digits in the given base.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_even_p(Math.Gmp.Native.mpz_t) - Determine whether op is even.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_odd_p(Math.Gmp.Native.mpz_t) - Determine whether op is odd.
-
-
-
-
-
-
- Integer Special Functions:
-
-
- M:Math.Gmp.Native.gmp_lib._mpz_realloc(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_size_t) - Change the space for integer to new_alloc limbs.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_getlimbn(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_size_t) - Return limb number n from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_size(Math.Gmp.Native.mpz_t) - Return the size of op measured in number of limbs.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_limbs_read(Math.Gmp.Native.mpz_t) - Return a pointer to the limb array representing the absolute value of x.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_limbs_write(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_size_t) - Return a pointer to the limb array of x, intended for write access.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_limbs_modify(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_size_t) - Return a pointer to the limb array of x, intended for write access.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_limbs_finish(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_size_t) - Updates the internal size field of x.
-
-
- M:Math.Gmp.Native.gmp_lib.mpz_roinit_n(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Special initialization of x, using the given limb array and size.
-
-
-
-
-
-
-
-
-
- Rational Number Functions:
-
-
-
-
- Initializing Rationals:
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_canonicalize(Math.Gmp.Native.mpq_t) - Remove any factors that are common to the numerator and denominator of op, and make the denominator positive.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_init(Math.Gmp.Native.mpq_t) - Initialize x and set it to 0/1.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_inits(Math.Gmp.Native.mpq_t[]) - Initialize a NULL-terminated list of T:Math.Gmp.Native.mpq_t variables, and set their values to 0/1.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_clear(Math.Gmp.Native.mpq_t) - Free the space occupied by x.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_clears(Math.Gmp.Native.mpq_t[]) - Free the space occupied by a NULL-terminated list of T:Math.Gmp.Native.mpq_t variables.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_set(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t) - Assign rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_set_z(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpz_t) - Assign rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_set_ui(Math.Gmp.Native.mpq_t,System.UInt32,System.UInt32) - Set the value of rop to op1 / op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_set_si(Math.Gmp.Native.mpq_t,System.Int32,System.UInt32) - Set the value of rop to op1 / op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_set_str(Math.Gmp.Native.mpq_t,Math.Gmp.Native.char_ptr,System.Int32) - Set rop from a null-terminated string str in the given base.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_swap(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t) - Swap the values rop1 and rop2 efficiently.
-
-
-
-
-
-
- Rational Conversions:
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_get_d(Math.Gmp.Native.mpq_t) - Convert op to a T:System.Double, truncating if necessary (i.e. rounding towards zero).
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_set_d(Math.Gmp.Native.mpq_t,System.Double) - Set rop to the value of op. There is no rounding, this conversion is exact.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_set_f(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpf_t) - Set rop to the value of op. There is no rounding, this conversion is exact.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_get_str(Math.Gmp.Native.char_ptr,System.Int32,Math.Gmp.Native.mpq_t) - Convert op to a string of digits in base base.
-
-
-
-
-
-
- Rational Arithmetic:
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_add(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t) - Set sum to addend1 + addend2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_sub(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t) - Set difference to minuend - subtrahend.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_mul(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t) - Set product to multiplier * multiplicand.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_mul_2exp(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t,System.UInt32) - Set rop to op1 * 2*op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_div(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t) - Set quotient to dividend / divisor.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_div_2exp(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t,System.UInt32) - Set rop to op1 / 2^op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_neg(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t) - Set negated_operand to -operand.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_abs(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t) - Set rop to the absolute value of op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_inv(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t) - Set inverted_number to 1 / number.
-
-
-
-
-
-
- Comparing Rationals:
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_cmp(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t) - Compare op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_cmp_z(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpz_t) - Compare op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_cmp_ui(Math.Gmp.Native.mpq_t,System.UInt32,System.UInt32) - Compare op1 and num2 / den2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_cmp_si(Math.Gmp.Native.mpq_t,System.Int32,System.UInt32) - Compare op1 and num2 / den2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_sgn(Math.Gmp.Native.mpq_t) - Return +1 if op > 0, 0 if op = 0, and -1 if op < 0.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_equal(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpq_t) - Return non-zero if op1 and op2 are equal, zero if they are non-equal.
-
-
-
-
-
-
- Applying Integer Functions:
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_numref(Math.Gmp.Native.mpq_t) - Return a reference to the numerator op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_denref(Math.Gmp.Native.mpq_t) - Return a reference to the denominator op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_get_num(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpq_t) - Set numerator to the numerator of rational.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_get_den(Math.Gmp.Native.mpz_t,Math.Gmp.Native.mpq_t) - Set denominator to the denominator of rational.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_set_num(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpz_t) - Set the numerator of rational to numerator.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_set_den(Math.Gmp.Native.mpq_t,Math.Gmp.Native.mpz_t) - Set the denominator of rational to denominator.
-
-
-
-
-
-
- I/O of Rationals:
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_out_str(Math.Gmp.Native.ptr{Math.Gmp.Native.FILE},System.Int32,Math.Gmp.Native.mpq_t) - Output op on stdio stream stream, as a string of digits in base base.
-
-
- M:Math.Gmp.Native.gmp_lib.mpq_inp_str(Math.Gmp.Native.mpq_t,Math.Gmp.Native.ptr{Math.Gmp.Native.FILE},System.Int32) - Read a string of digits from stream and convert them to a rational in rop.
-
-
-
-
-
-
-
-
-
- Floating-point Functions:
-
-
-
-
- Initializing Floats:
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_set_default_prec(Math.Gmp.Native.mp_bitcnt_t) - Set the default precision to be at least prec bits.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_get_default_prec - Return the default precision actually used.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_init(Math.Gmp.Native.mpf_t) - Initialize x to 0.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_init2(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mp_bitcnt_t) - Initialize x to 0 and set its precision to be at least prec bits.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_inits(Math.Gmp.Native.mpf_t[]) - Initialize a NULL-terminated list of T:Math.Gmp.Native.mpf_t variables, and set their values to 0.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_clear(Math.Gmp.Native.mpf_t) - Free the space occupied by x.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_clears(Math.Gmp.Native.mpf_t[]) - Free the space occupied by a NULL-terminated list of T:Math.Gmp.Native.mpf_t variables.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_get_prec(Math.Gmp.Native.mpf_t) - Return the current precision of op, in bits.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_set_prec(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mp_bitcnt_t) - Set the precision of rop to be at least prec bits.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_set_prec_raw(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mp_bitcnt_t) - Set the precision of rop to be at least prec bits, without changing the memory allocated.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_size(Math.Gmp.Native.mpf_t) - Return the number of limbs currently in use.
-
-
-
-
-
-
- Assigning Floats:
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_set(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Set the value of rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_set_ui(Math.Gmp.Native.mpf_t,System.UInt32) - Set the value of rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_set_si(Math.Gmp.Native.mpf_t,System.Int32) - Set the value of rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_set_d(Math.Gmp.Native.mpf_t,System.Double) - Set the value of rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_set_z(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpz_t) - Set the value of rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_set_q(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpq_t) - Set the value of rop from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_set_str(Math.Gmp.Native.mpf_t,Math.Gmp.Native.char_ptr,System.Int32) - Set the value of rop from the string in str.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_swap(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Swap rop1 and rop2 efficiently.
-
-
-
-
-
-
- Simultaneous Float Init & Assign:
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_init_set(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Initialize rop and set its value from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_init_set_ui(Math.Gmp.Native.mpf_t,System.UInt32) - Initialize rop and set its value from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_init_set_si(Math.Gmp.Native.mpf_t,System.Int32) - Initialize rop and set its value from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_init_set_d(Math.Gmp.Native.mpf_t,System.Double) - Initialize rop and set its value from op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_init_set_str(Math.Gmp.Native.mpf_t,Math.Gmp.Native.char_ptr,System.Int32) - Initialize rop and set its value from the string in str.
-
-
-
-
-
-
- Converting Floats:
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_get_d(Math.Gmp.Native.mpf_t) - Convert op to a T:System.Double, truncating if necessary (i.e. rounding towards zero).
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_get_d_2exp(Math.Gmp.Native.ptr{System.Int32},Math.Gmp.Native.mpf_t) - Convert op to a double, truncating if necessary (i.e. rounding towards zero), and with an exponent returned separately.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_get_si(Math.Gmp.Native.mpf_t) - Convert op to a 32-bit integer, truncating any fraction part.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_get_ui(Math.Gmp.Native.mpf_t) - Convert op to an unsigned 32-bit integer, truncating any fraction part.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_get_str(Math.Gmp.Native.char_ptr,Math.Gmp.Native.ptr{Math.Gmp.Native.mp_exp_t},System.Int32,Math.Gmp.Native.size_t,Math.Gmp.Native.mpf_t) - Convert op to a string of digits in base base.
-
-
-
-
-
-
- Float Arithmetic:
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_add(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Set rop to op1 + op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_add_ui(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t,System.UInt32) - Set rop to op1 + op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_sub(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Set rop to op1 - op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_ui_sub(Math.Gmp.Native.mpf_t,System.UInt32,Math.Gmp.Native.mpf_t) - Set rop to op1 - op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_sub_ui(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t,System.UInt32) - Set rop to op1 - op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_mul(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Set rop to op1 * op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_mul_ui(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t,System.UInt32) - Set rop to op1 * op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_div(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Set rop to op1 / op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_ui_div(Math.Gmp.Native.mpf_t,System.UInt32,Math.Gmp.Native.mpf_t) - Set rop to op1 / op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_div_ui(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t,System.UInt32) - Set rop to op1 / op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_sqrt(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Set rop to the square root of op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_sqrt_ui(Math.Gmp.Native.mpf_t,System.UInt32) - Set rop to the square root of op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_pow_ui(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t,System.UInt32) - Set rop to op1^op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_neg(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Set rop to -op.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_abs(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Set rop to | op |.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_mul_2exp(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t,Math.Gmp.Native.mp_bitcnt_t) - Set rop to op1 * 2^op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_div_2exp(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t,System.UInt32) - Set rop to op1 / 2^op2.
-
-
-
-
-
-
- Float Comparison:
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_cmp(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Compare op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_cmp_z(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpz_t) - Compare op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_cmp_d(Math.Gmp.Native.mpf_t,System.Double) - Compare op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_cmp_ui(Math.Gmp.Native.mpf_t,System.UInt32) - Compare op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_cmp_si(Math.Gmp.Native.mpf_t,System.Int32) - Compare op1 and op2.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_reldiff(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Compute the relative difference between op1 and op2 and store the result in rop. This is | op1 - op2 | / op1.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_sgn(Math.Gmp.Native.mpf_t) - Return +1 if op > 0, 0 if op = 0, and -1 if op < 0.
-
-
-
-
-
-
- I/O of Floats:
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_out_str(Math.Gmp.Native.ptr{Math.Gmp.Native.FILE},System.Int32,Math.Gmp.Native.size_t,Math.Gmp.Native.mpf_t) - Print op to stream, as a string of digits.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_inp_str(Math.Gmp.Native.mpf_t,Math.Gmp.Native.ptr{Math.Gmp.Native.FILE},System.Int32) - Read a string in base base from stream, and put the read float in rop.
-
-
-
-
-
-
- Miscellaneous Float Functions:
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_ceil(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Set rop to op rounded to the next higher integer.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_floor(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Set rop to op rounded to the next lower integer.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_trunc(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mpf_t) - Set rop to op rounded to the integer towards zero.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_integer_p(Math.Gmp.Native.mpf_t) - Return non-zero if op is an integer.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_fits_ulong_p(Math.Gmp.Native.mpf_t) - Return non-zero if op fits in an unsigned 32-bit integer, when truncated to an integer.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_fits_slong_p(Math.Gmp.Native.mpf_t) - Return non-zero if op fits in a 32-bit integer, when truncated to an integer.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_fits_uint_p(Math.Gmp.Native.mpf_t) - Return non-zero if op fits in an unsigned 32-bit integer, when truncated to an integer.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_fits_sint_p(Math.Gmp.Native.mpf_t) - Return non-zero if op fits in a 32-bit integer, when truncated to an integer.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_fits_sshort_p(Math.Gmp.Native.mpf_t) - Return non-zero if op fits in a 16-bit integer, when truncated to an integer.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_fits_ushort_p(Math.Gmp.Native.mpf_t) - Return non-zero if op fits in an unsigned 16-bit integer, when truncated to an integer.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_urandomb(Math.Gmp.Native.mpf_t,Math.Gmp.Native.gmp_randstate_t,Math.Gmp.Native.mp_bitcnt_t) - Generate a uniformly distributed random float in rop, such that 0 ≤ rop < 1, with nbits significant bits in the mantissa or less if the precision of rop is smaller.
-
-
- M:Math.Gmp.Native.gmp_lib.mpf_random2(Math.Gmp.Native.mpf_t,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_exp_t) - Generate a random float of at most max_size limbs, with long strings of zeros and ones in the binary representation.
-
-
-
-
-
-
-
-
-
- Low-level Functions:
-
-
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_add_n(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Add {s1p, n} and {s2p, n}, and write the n least significant limbs of the result to rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_add_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t) - Add {s1p, n} and s2limb, and write the n least significant limbs of the result to rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_add(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Add {s1p, s1n} and {s2p, s2n}, and write the s1n least significant limbs of the result to rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sub_n(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Subtract {s2p, n} from {s1p, n}, and write the n least significant limbs of the result to rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sub_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t) - Subtract s2limb from {s1p, n}, and write the n least significant limbs of the result to rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sub(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Subtract {s2p, s2n} from {s1p, s1n}, and write the s1n least significant limbs of the result to rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_neg(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Perform the negation of {sp, n}, and write the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_mul_n(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Multiply {s1p, n} and {s2p, n}, and write the (2 * n)-limb result to rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_mul(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Multiply {s1p, s1n} and {s2p, s2n}, and write the (s1n + s2n)-limb result to rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sqr(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Compute the square of {s1p, n} and write the (2 * n)-limb result to rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_mul_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t) - Multiply {s1p, n} by s2limb, and write the n least significant limbs of the product to rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_addmul_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t) - Multiply {s1p, n} and s2limb, and add the n least significant limbs of the product to {rp, n} and write the result to rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_submul_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t) - Multiply {s1p, n} and s2limb, and subtract the n least significant limbs of the product from {rp, n} and write the result to rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_tdiv_qr(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Divide {np, nn} by {dp, dn} and put the quotient at {qp, nn - dn + 1} and the remainder at {rp, dn}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_divrem_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t) - Divide {s2p, s2n} by s3limb, and write the quotient at r1p.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_divmod_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t) - Divide {s2p, s2n} by s3limb, and write the quotient at r1p.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_divexact_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t) - Divide {sp, n} by d, expecting it to divide exactly, and writing the result to {rrp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_divexact_by3(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Divide {sp, n} by 3, expecting it to divide exactly, and writing the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_divexact_by3c(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t) - Divide {sp, n} by 3, expecting it to divide exactly, and writing the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_mod_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t) - Divide {s1p, s1n} by s2limb, and return the remainder.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_lshift(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,System.UInt32) - Shift {sp, n} left by count bits, and write the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_rshift(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,System.UInt32) - Shift {sp, n} right by count bits, and write the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_cmp(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Compare {s1p, n} and {s2p, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_zero_p(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Test {sp, n} and return 1 if the operand is zero, 0 otherwise.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_gcd(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Set {rp, retval} to the greatest common divisor of {xp, xn} and {yp, yn}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_gcd_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t) - Return the greatest common divisor of {xp, xn} and ylimb.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_gcdext(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.ptr{Math.Gmp.Native.mp_size_t},Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Compute the greatest common divisor G of U and V. Compute a cofactor S such that G = US + VT.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sqrtrem(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Compute the square root of {sp, n} and put the result at {r1p, ceil(n / 2)} and the remainder at {r2p, retval}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sizeinbase(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,System.Int32) - Return the size of {xp, n} measured in number of digits in the given base.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_get_str(Math.Gmp.Native.char_ptr,System.Int32,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Convert {s1p, s1n} to a raw unsigned char array at str in base base, and return the number of characters produced.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_set_str(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.char_ptr,Math.Gmp.Native.size_t,System.Int32) - Convert bytes {str, strsize} in the given base to limbs at rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_scan0(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_bitcnt_t) - Scan s1p from bit position bit for the next clear bit.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_scan1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_bitcnt_t) - Scan s1p from bit position bit for the next set bit.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_random(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Generate a random number of length r1n and store it at r1p.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_random2(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Generate a random number of length r1n and store it at r1p.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_popcount(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Count the number of set bits in {s1p, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_hamdist(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Compute the hamming distance between {s1p, n} and {s2p, n}, which is the number of bit positions where the two operands have different bit values.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_perfect_square_p(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Return non-zero iff {s1p, n} is a perfect square.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_perfect_power_p(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Return non-zero iff {sp, n} is a perfect power.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_and_n(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Perform the bitwise logical and of {s1p, n} and {s2p, n}, and write the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_ior_n(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Perform the bitwise logical inclusive or of {s1p, n} and {s2p, n}, and write the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_xor_n(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Perform the bitwise logical exclusive or of {s1p, n} and {s2p, n}, and write the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_andn_n(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Perform the bitwise logical and of {s1p, n} and the bitwise complement of {s2p, n}, and write the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_iorn_n(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Perform the bitwise logical inclusive or of {s1p, n} and the bitwise complement of {s2p, n}, and write the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_nand_n(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Perform the bitwise logical and of {s1p, n} and {s2p, n}, and write the bitwise complement of the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_nior_n(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Perform the bitwise logical inclusive or of {s1p, n} and {s2p, n}, and write the bitwise complement of the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_xnor_n(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Perform the bitwise logical exclusive or of {s1p, n} and {s2p, n}, and write the bitwise complement of the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_com(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Perform the bitwise complement of {sp, n}, and write the result to {rp, n}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_copyi(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Copy from {s1p, n} to {rp, n}, increasingly.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_copyd(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Copy from {s1p, n} to {rp, n}, decreasingly.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_zero(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - Zero {rp, n}.
-
-
-
-
-
-
- Low-level functions for cryptography:
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_cnd_add_n(Math.Gmp.Native.mp_limb_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - If cnd is non-zero, it produces the same result as a regular M:Math.Gmp.Native.gmp_lib.mpn_add_n(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t), and if cnd is zero, it copies {s1p, n} to the result area and returns zero.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_cnd_sub_n(Math.Gmp.Native.mp_limb_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - If cnd is non-zero, it produces the same result as a regular M:Math.Gmp.Native.gmp_lib.mpn_sub_n(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t), and if cnd is zero, it copies {s1p, n} to the result area and returns zero.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_add_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t,Math.Gmp.Native.mp_ptr) - Set R to A + b, where R = {rp, n}, A = {ap, n}, and b is a single limb.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_add_1_itch(Math.Gmp.Native.mp_size_t) - Return the scratch space in number of limbs required by the function M:Math.Gmp.Native.gmp_lib.mpn_sec_add_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t,Math.Gmp.Native.mp_ptr).
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_sub_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t,Math.Gmp.Native.mp_ptr) - Set R to A - b, where R = {rp, n}, A = {ap, n}, and b is a single limb.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_sub_1_itch(Math.Gmp.Native.mp_size_t) - Return the scratch space in number of limbs required by the function M:Math.Gmp.Native.gmp_lib.mpn_sec_sub_1(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_limb_t,Math.Gmp.Native.mp_ptr).
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_cnd_swap(Math.Gmp.Native.mp_limb_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t) - If cnd is non-zero, swaps the contents of the areas {ap, n} and {bp, n}. Otherwise, the areas are left unmodified.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_mul(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr) - Set R to A * B, where A = {ap, an}, B = {bp, bn}, and R = {rp, an + bn}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_mul_itch(Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_size_t) - Return the scratch space in number of limbs required by the function M:Math.Gmp.Native.gmp_lib.mpn_sec_mul(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr).
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_sqr(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr) - Set R to A^2, where A = {ap, an}, and R = {rp, 2 * an}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_sqr_itch(Math.Gmp.Native.mp_size_t) - Return the scratch space in number of limbs required by the function M:Math.Gmp.Native.gmp_lib.mpn_sec_sqr(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr).
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_powm(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_bitcnt_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr) - Set R to (B^E) modulo M, where R = {rp, n}, M = {mp, n}, and E = {ep, ceil(enb / F:Math.Gmp.Native.gmp_lib.mp_bits_per_limb)}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_powm_itch(Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_bitcnt_t,Math.Gmp.Native.mp_size_t) - Return the scratch space in number of limbs required by the function M:Math.Gmp.Native.gmp_lib.mpn_sec_powm(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_bitcnt_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr).
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_tabselect(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_size_t) - Select entry which from table tab, which has nents entries, each n limbs. Store the selected entry at rp.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_div_qr(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr) - Set Q to the truncated quotient N / D and R to N modulo D, where N = {np, nn}, D = {dp, dn}, Q’s most significant limb is the function return value and the remaining limbs are {qp, nn - dn}, and R = {np, dn}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_div_qr_itch(Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_size_t) - Return the scratch space in number of limbs required by the function M:Math.Gmp.Native.gmp_lib.mpn_sec_div_qr(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr).
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_div_r(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr) - Set R to N modulo D, where N = {np, nn}, D = {dp, dn}, and R = {np, dn}.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_div_r_itch(Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_size_t) - Return the scratch space in number of limbs required by the function M:Math.Gmp.Native.gmp_lib.mpn_sec_div_r(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_ptr).
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_invert(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_bitcnt_t,Math.Gmp.Native.mp_ptr) - Set R to the inverse of A modulo M, where R = {rp, n}, A = {ap, n}, and M = {mp, n}. This function’s interface is preliminary.
-
-
- M:Math.Gmp.Native.gmp_lib.mpn_sec_invert_itch(Math.Gmp.Native.mp_size_t) - Return the scratch space in number of limbs required by the function M:Math.Gmp.Native.gmp_lib.mpn_sec_invert(Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_ptr,Math.Gmp.Native.mp_size_t,Math.Gmp.Native.mp_bitcnt_t,Math.Gmp.Native.mp_ptr).
-
-
-
-
-
-
-
-
-
- Random Number Functions:
-
-
-
-
- Random State Initialization:
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_randinit_default(Math.Gmp.Native.gmp_randstate_t) - Initialize state with a default algorithm.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_randinit_mt(Math.Gmp.Native.gmp_randstate_t) - Initialize state for a Mersenne Twister algorithm.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_randinit_lc_2exp(Math.Gmp.Native.gmp_randstate_t,Math.Gmp.Native.mpz_t,System.UInt32,Math.Gmp.Native.mp_bitcnt_t) - Initialize state with a linear congruential algorithm X = (aX + c) mod 2^m2exp.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_randinit_lc_2exp_size(Math.Gmp.Native.gmp_randstate_t,Math.Gmp.Native.mp_bitcnt_t) - Initialize state for a linear congruential algorithm as per M:Math.Gmp.Native.gmp_lib.gmp_randinit_lc_2exp(Math.Gmp.Native.gmp_randstate_t,Math.Gmp.Native.mpz_t,System.UInt32,Math.Gmp.Native.mp_bitcnt_t).
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_randinit_set(Math.Gmp.Native.gmp_randstate_t,Math.Gmp.Native.gmp_randstate_t) - Initialize rop with a copy of the algorithm and state from op.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_randclear(Math.Gmp.Native.gmp_randstate_t) - Free all memory occupied by state.
-
-
-
-
-
-
- Random State Seeding:
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_randseed(Math.Gmp.Native.gmp_randstate_t,Math.Gmp.Native.mpz_t) - Set an initial seed value into state.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_randseed_ui(Math.Gmp.Native.gmp_randstate_t,System.UInt32) - Set an initial seed value into state.
-
-
-
-
-
-
- Random State Miscellaneous:
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_urandomb_ui(Math.Gmp.Native.gmp_randstate_t,System.UInt32) - Generate a uniformly distributed random number of n bits, i.e. in the range 0 to 2^n - 1 inclusive.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_urandomm_ui(Math.Gmp.Native.gmp_randstate_t,System.UInt32) - Generate a uniformly distributed random number in the range 0 to n - 1, inclusive.
-
-
-
-
-
-
-
-
-
- Formatted Output:
-
-
-
-
- Formatted Output Functions:
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_printf(System.String,System.Object[]) - Print to the standard output stdout.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_vprintf(System.String,System.Object[]) - Print to the standard output stdout.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_fprintf(Math.Gmp.Native.ptr{Math.Gmp.Native.FILE},System.String,System.Object[]) - Print to the stream fp.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_vfprintf(Math.Gmp.Native.ptr{Math.Gmp.Native.FILE},System.String,System.Object[]) - Print to the stream fp.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_sprintf(Math.Gmp.Native.char_ptr,System.String,System.Object[]) - Form a null-terminated string in buf.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_vsprintf(Math.Gmp.Native.char_ptr,System.String,System.Object[]) - Form a null-terminated string in buf.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_snprintf(Math.Gmp.Native.char_ptr,Math.Gmp.Native.size_t,System.String,System.Object[]) - Form a null-terminated string in buf.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_vsnprintf(Math.Gmp.Native.char_ptr,Math.Gmp.Native.size_t,System.String,System.Object[]) - Form a null-terminated string in buf.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_asprintf(Math.Gmp.Native.ptr{Math.Gmp.Native.char_ptr},System.String,System.Object[]) - Form a null-terminated string in a block of memory obtained from the current memory allocation function.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_vasprintf(Math.Gmp.Native.ptr{Math.Gmp.Native.char_ptr},System.String,System.Object[]) - Form a null-terminated string in a block of memory obtained from the current memory allocation function.
-
-
-
-
-
-
-
-
-
- Formatted Input:
-
-
-
-
- Formatted Input Functions:
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_scanf(System.String,System.Object[]) - Read from the standard input stdin.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_vscanf(System.String,System.Object[]) - Read from the standard input stdin.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_fscanf(Math.Gmp.Native.ptr{Math.Gmp.Native.FILE},System.String,System.Object[]) - Read from the stream fp.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_vfscanf(Math.Gmp.Native.ptr{Math.Gmp.Native.FILE},System.String,System.Object[]) - Read from the stream fp.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_sscanf(System.String,System.String,System.Object[]) - Read from a null-terminated string s.
-
-
- M:Math.Gmp.Native.gmp_lib.gmp_vsscanf(System.String,System.String,System.Object[]) - Read from a null-terminated string s.
-
-
-
-
-
-
-
-
-
- Custom Allocation:
-
-
-
-
- M:Math.Gmp.Native.gmp_lib.mp_set_memory_functions(Math.Gmp.Native.allocate_function,Math.Gmp.Native.reallocate_function,Math.Gmp.Native.free_function) - Replace the current allocation functions from the arguments.
-
-
- M:Math.Gmp.Native.gmp_lib.mp_get_memory_functions(Math.Gmp.Native.allocate_function@,Math.Gmp.Native.reallocate_function@,Math.Gmp.Native.free_function@) - Get the current allocation functions, storing function pointers to the locations given by the arguments.
-
-
- M:Math.Gmp.Native.gmp_lib.allocate(Math.Gmp.Native.size_t) - Return a pointer to newly allocated space with at least alloc_size bytes.
-
-
- M:Math.Gmp.Native.gmp_lib.reallocate(Math.Gmp.Native.void_ptr,Math.Gmp.Native.size_t,Math.Gmp.Native.size_t) - Resize a previously allocated block ptr of old_size bytes to be new_size bytes.
-
-
- M:Math.Gmp.Native.gmp_lib.free(Math.Gmp.Native.mp_ptr[]) - De-allocate the space pointed to by ptrs.
-
-
- M:Math.Gmp.Native.gmp_lib.free(Math.Gmp.Native.gmp_randstate_t) - De-allocate the space pointed to by ptr.
-
-
- M:Math.Gmp.Native.gmp_lib.free(Math.Gmp.Native.char_ptr) - De-allocate the space pointed to by ptr.
-
-
- M:Math.Gmp.Native.gmp_lib.free(Math.Gmp.Native.void_ptr) - De-allocate the space pointed to by ptr.
-
-
- M:Math.Gmp.Native.gmp_lib.free(Math.Gmp.Native.void_ptr,Math.Gmp.Native.size_t) - De-allocate the space pointed to by ptr.
-
-
- M:Math.Gmp.Native.gmp_lib.ZeroMemory(System.IntPtr,System.Int32) - The M:Math.Gmp.Native.gmp_lib.ZeroMemory(System.IntPtr,System.Int32) routine fills a block of memory with zeros, given a pointer to the block and the length, in bytes, to be filled.
-
-
-
-
-
-
-
-
-
-
-
C and .NET Types Equivalence
diff --git a/Documentation/Documentation.shfbproj b/Documentation/Documentation.shfbproj
index 10258b7..8b66045 100644
--- a/Documentation/Documentation.shfbproj
+++ b/Documentation/Documentation.shfbproj
@@ -14,7 +14,7 @@
Documentation
Documentation
- .NET Framework 2.0
+ .NET Framework 4.0
..\docs\
Gmp.Native
en-US
@@ -43,7 +43,8 @@
True
-The Math.Gmp.Native namespace contains types defined to expose all of the GNU GMP functionality to .NET.
+ The Math.Gmp.Native namespace contains types defined to expose all of the GNU GMP functionality to .NET.
+
False
1.0.0.0
2
diff --git a/Math.Gmp.Native.sln b/Math.Gmp.Native.sln
index b576192..723438a 100644
--- a/Math.Gmp.Native.sln
+++ b/Math.Gmp.Native.sln
@@ -1,7 +1,7 @@
Microsoft Visual Studio Solution File, Format Version 12.00
-# Visual Studio 14
-VisualStudioVersion = 14.0.25420.1
+# Visual Studio 15
+VisualStudioVersion = 15.0.27004.2008
MinimumVisualStudioVersion = 10.0.40219.1
Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Solution Items", "Solution Items", "{68DC166D-565A-4F3D-B777-B8E384F26864}"
ProjectSection(SolutionItems) = preProject
@@ -105,4 +105,7 @@ Global
GlobalSection(SolutionProperties) = preSolution
HideSolutionNode = FALSE
EndGlobalSection
+ GlobalSection(ExtensibilityGlobals) = postSolution
+ SolutionGuid = {6662125F-58CB-4865-A9D5-84C5BA376102}
+ EndGlobalSection
EndGlobal
diff --git a/Math.Gmp.Native/FILE.cs b/Math.Gmp.Native/FILE.cs
index 968ad8e..56c75fb 100644
--- a/Math.Gmp.Native/FILE.cs
+++ b/Math.Gmp.Native/FILE.cs
@@ -23,7 +23,7 @@ namespace Math.Gmp.Native
/// Returns a value indicating whether this instance is equal to a specified object.
///
/// An object to compare with this instance.
- /// True if is an instance of and equals the value of this instance; otherwise, False.
+ /// True if is an instance of FILE and equals the value of this instance; otherwise, False.
public override bool Equals(object obj)
{
if (!(obj is FILE))
@@ -33,9 +33,9 @@ namespace Math.Gmp.Native
}
///
- /// Returns a value indicating whether this instance is equal to a specified value.
+ /// Returns a value indicating whether this instance is equal to a specified FILE value.
///
- /// A value to compare to this instance.
+ /// A FILE value to compare to this instance.
/// True if has the same value as this instance; otherwise, False.
public bool Equals(FILE other)
{
@@ -54,8 +54,8 @@ namespace Math.Gmp.Native
///
/// Gets a value that indicates whether the two argument values are equal.
///
- /// A value.
- /// A value.
+ /// A FILE value.
+ /// A FILE value.
/// True if the two values are equal, and False otherwise.
public static bool operator ==(FILE value1, FILE value2)
{
@@ -65,8 +65,8 @@ namespace Math.Gmp.Native
///
/// Gets a value that indicates whether the two argument values are different.
///
- /// A value.
- /// A value.
+ /// A FILE value.
+ /// A FILE value.
/// True if the two FILE are different, and False otherwise.
public static bool operator !=(FILE value1, FILE value2)
{
diff --git a/Math.Gmp.Native/GMP_COPYING b/Math.Gmp.Native/GMP_COPYING
deleted file mode 100644
index 94a9ed0..0000000
--- a/Math.Gmp.Native/GMP_COPYING
+++ /dev/null
@@ -1,674 +0,0 @@
- GNU GENERAL PUBLIC LICENSE
- Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc.
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
- Preamble
-
- The GNU General Public License is a free, copyleft license for
-software and other kinds of works.
-
- The licenses for most software and other practical works are designed
-to take away your freedom to share and change the works. By contrast,
-the GNU General Public License is intended to guarantee your freedom to
-share and change all versions of a program--to make sure it remains free
-software for all its users. We, the Free Software Foundation, use the
-GNU General Public License for most of our software; it applies also to
-any other work released this way by its authors. You can apply it to
-your programs, too.
-
- When we speak of free software, we are referring to freedom, not
-price. Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-them if you wish), that you receive source code or can get it if you
-want it, that you can change the software or use pieces of it in new
-free programs, and that you know you can do these things.
-
- To protect your rights, we need to prevent others from denying you
-these rights or asking you to surrender the rights. Therefore, you have
-certain responsibilities if you distribute copies of the software, or if
-you modify it: responsibilities to respect the freedom of others.
-
- For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must pass on to the recipients the same
-freedoms that you received. You must make sure that they, too, receive
-or can get the source code. And you must show them these terms so they
-know their rights.
-
- Developers that use the GNU GPL protect your rights with two steps:
-(1) assert copyright on the software, and (2) offer you this License
-giving you legal permission to copy, distribute and/or modify it.
-
- For the developers' and authors' protection, the GPL clearly explains
-that there is no warranty for this free software. For both users' and
-authors' sake, the GPL requires that modified versions be marked as
-changed, so that their problems will not be attributed erroneously to
-authors of previous versions.
-
- Some devices are designed to deny users access to install or run
-modified versions of the software inside them, although the manufacturer
-can do so. This is fundamentally incompatible with the aim of
-protecting users' freedom to change the software. The systematic
-pattern of such abuse occurs in the area of products for individuals to
-use, which is precisely where it is most unacceptable. Therefore, we
-have designed this version of the GPL to prohibit the practice for those
-products. If such problems arise substantially in other domains, we
-stand ready to extend this provision to those domains in future versions
-of the GPL, as needed to protect the freedom of users.
-
- Finally, every program is threatened constantly by software patents.
-States should not allow patents to restrict development and use of
-software on general-purpose computers, but in those that do, we wish to
-avoid the special danger that patents applied to a free program could
-make it effectively proprietary. To prevent this, the GPL assures that
-patents cannot be used to render the program non-free.
-
- The precise terms and conditions for copying, distribution and
-modification follow.
-
- TERMS AND CONDITIONS
-
- 0. Definitions.
-
- "This License" refers to version 3 of the GNU General Public License.
-
- "Copyright" also means copyright-like laws that apply to other kinds of
-works, such as semiconductor masks.
-
- "The Program" refers to any copyrightable work licensed under this
-License. Each licensee is addressed as "you". "Licensees" and
-"recipients" may be individuals or organizations.
-
- To "modify" a work means to copy from or adapt all or part of the work
-in a fashion requiring copyright permission, other than the making of an
-exact copy. The resulting work is called a "modified version" of the
-earlier work or a work "based on" the earlier work.
-
- A "covered work" means either the unmodified Program or a work based
-on the Program.
-
- To "propagate" a work means to do anything with it that, without
-permission, would make you directly or secondarily liable for
-infringement under applicable copyright law, except executing it on a
-computer or modifying a private copy. Propagation includes copying,
-distribution (with or without modification), making available to the
-public, and in some countries other activities as well.
-
- To "convey" a work means any kind of propagation that enables other
-parties to make or receive copies. Mere interaction with a user through
-a computer network, with no transfer of a copy, is not conveying.
-
- An interactive user interface displays "Appropriate Legal Notices"
-to the extent that it includes a convenient and prominently visible
-feature that (1) displays an appropriate copyright notice, and (2)
-tells the user that there is no warranty for the work (except to the
-extent that warranties are provided), that licensees may convey the
-work under this License, and how to view a copy of this License. If
-the interface presents a list of user commands or options, such as a
-menu, a prominent item in the list meets this criterion.
-
- 1. Source Code.
-
- The "source code" for a work means the preferred form of the work
-for making modifications to it. "Object code" means any non-source
-form of a work.
-
- A "Standard Interface" means an interface that either is an official
-standard defined by a recognized standards body, or, in the case of
-interfaces specified for a particular programming language, one that
-is widely used among developers working in that language.
-
- The "System Libraries" of an executable work include anything, other
-than the work as a whole, that (a) is included in the normal form of
-packaging a Major Component, but which is not part of that Major
-Component, and (b) serves only to enable use of the work with that
-Major Component, or to implement a Standard Interface for which an
-implementation is available to the public in source code form. A
-"Major Component", in this context, means a major essential component
-(kernel, window system, and so on) of the specific operating system
-(if any) on which the executable work runs, or a compiler used to
-produce the work, or an object code interpreter used to run it.
-
- The "Corresponding Source" for a work in object code form means all
-the source code needed to generate, install, and (for an executable
-work) run the object code and to modify the work, including scripts to
-control those activities. However, it does not include the work's
-System Libraries, or general-purpose tools or generally available free
-programs which are used unmodified in performing those activities but
-which are not part of the work. For example, Corresponding Source
-includes interface definition files associated with source files for
-the work, and the source code for shared libraries and dynamically
-linked subprograms that the work is specifically designed to require,
-such as by intimate data communication or control flow between those
-subprograms and other parts of the work.
-
- The Corresponding Source need not include anything that users
-can regenerate automatically from other parts of the Corresponding
-Source.
-
- The Corresponding Source for a work in source code form is that
-same work.
-
- 2. Basic Permissions.
-
- All rights granted under this License are granted for the term of
-copyright on the Program, and are irrevocable provided the stated
-conditions are met. This License explicitly affirms your unlimited
-permission to run the unmodified Program. The output from running a
-covered work is covered by this License only if the output, given its
-content, constitutes a covered work. This License acknowledges your
-rights of fair use or other equivalent, as provided by copyright law.
-
- You may make, run and propagate covered works that you do not
-convey, without conditions so long as your license otherwise remains
-in force. You may convey covered works to others for the sole purpose
-of having them make modifications exclusively for you, or provide you
-with facilities for running those works, provided that you comply with
-the terms of this License in conveying all material for which you do
-not control copyright. Those thus making or running the covered works
-for you must do so exclusively on your behalf, under your direction
-and control, on terms that prohibit them from making any copies of
-your copyrighted material outside their relationship with you.
-
- Conveying under any other circumstances is permitted solely under
-the conditions stated below. Sublicensing is not allowed; section 10
-makes it unnecessary.
-
- 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
-
- No covered work shall be deemed part of an effective technological
-measure under any applicable law fulfilling obligations under article
-11 of the WIPO copyright treaty adopted on 20 December 1996, or
-similar laws prohibiting or restricting circumvention of such
-measures.
-
- When you convey a covered work, you waive any legal power to forbid
-circumvention of technological measures to the extent such circumvention
-is effected by exercising rights under this License with respect to
-the covered work, and you disclaim any intention to limit operation or
-modification of the work as a means of enforcing, against the work's
-users, your or third parties' legal rights to forbid circumvention of
-technological measures.
-
- 4. Conveying Verbatim Copies.
-
- You may convey verbatim copies of the Program's source code as you
-receive it, in any medium, provided that you conspicuously and
-appropriately publish on each copy an appropriate copyright notice;
-keep intact all notices stating that this License and any
-non-permissive terms added in accord with section 7 apply to the code;
-keep intact all notices of the absence of any warranty; and give all
-recipients a copy of this License along with the Program.
-
- You may charge any price or no price for each copy that you convey,
-and you may offer support or warranty protection for a fee.
-
- 5. Conveying Modified Source Versions.
-
- You may convey a work based on the Program, or the modifications to
-produce it from the Program, in the form of source code under the
-terms of section 4, provided that you also meet all of these conditions:
-
- a) The work must carry prominent notices stating that you modified
- it, and giving a relevant date.
-
- b) The work must carry prominent notices stating that it is
- released under this License and any conditions added under section
- 7. This requirement modifies the requirement in section 4 to
- "keep intact all notices".
-
- c) You must license the entire work, as a whole, under this
- License to anyone who comes into possession of a copy. This
- License will therefore apply, along with any applicable section 7
- additional terms, to the whole of the work, and all its parts,
- regardless of how they are packaged. This License gives no
- permission to license the work in any other way, but it does not
- invalidate such permission if you have separately received it.
-
- d) If the work has interactive user interfaces, each must display
- Appropriate Legal Notices; however, if the Program has interactive
- interfaces that do not display Appropriate Legal Notices, your
- work need not make them do so.
-
- A compilation of a covered work with other separate and independent
-works, which are not by their nature extensions of the covered work,
-and which are not combined with it such as to form a larger program,
-in or on a volume of a storage or distribution medium, is called an
-"aggregate" if the compilation and its resulting copyright are not
-used to limit the access or legal rights of the compilation's users
-beyond what the individual works permit. Inclusion of a covered work
-in an aggregate does not cause this License to apply to the other
-parts of the aggregate.
-
- 6. Conveying Non-Source Forms.
-
- You may convey a covered work in object code form under the terms
-of sections 4 and 5, provided that you also convey the
-machine-readable Corresponding Source under the terms of this License,
-in one of these ways:
-
- a) Convey the object code in, or embodied in, a physical product
- (including a physical distribution medium), accompanied by the
- Corresponding Source fixed on a durable physical medium
- customarily used for software interchange.
-
- b) Convey the object code in, or embodied in, a physical product
- (including a physical distribution medium), accompanied by a
- written offer, valid for at least three years and valid for as
- long as you offer spare parts or customer support for that product
- model, to give anyone who possesses the object code either (1) a
- copy of the Corresponding Source for all the software in the
- product that is covered by this License, on a durable physical
- medium customarily used for software interchange, for a price no
- more than your reasonable cost of physically performing this
- conveying of source, or (2) access to copy the
- Corresponding Source from a network server at no charge.
-
- c) Convey individual copies of the object code with a copy of the
- written offer to provide the Corresponding Source. This
- alternative is allowed only occasionally and noncommercially, and
- only if you received the object code with such an offer, in accord
- with subsection 6b.
-
- d) Convey the object code by offering access from a designated
- place (gratis or for a charge), and offer equivalent access to the
- Corresponding Source in the same way through the same place at no
- further charge. You need not require recipients to copy the
- Corresponding Source along with the object code. If the place to
- copy the object code is a network server, the Corresponding Source
- may be on a different server (operated by you or a third party)
- that supports equivalent copying facilities, provided you maintain
- clear directions next to the object code saying where to find the
- Corresponding Source. Regardless of what server hosts the
- Corresponding Source, you remain obligated to ensure that it is
- available for as long as needed to satisfy these requirements.
-
- e) Convey the object code using peer-to-peer transmission, provided
- you inform other peers where the object code and Corresponding
- Source of the work are being offered to the general public at no
- charge under subsection 6d.
-
- A separable portion of the object code, whose source code is excluded
-from the Corresponding Source as a System Library, need not be
-included in conveying the object code work.
-
- A "User Product" is either (1) a "consumer product", which means any
-tangible personal property which is normally used for personal, family,
-or household purposes, or (2) anything designed or sold for incorporation
-into a dwelling. In determining whether a product is a consumer product,
-doubtful cases shall be resolved in favor of coverage. For a particular
-product received by a particular user, "normally used" refers to a
-typical or common use of that class of product, regardless of the status
-of the particular user or of the way in which the particular user
-actually uses, or expects or is expected to use, the product. A product
-is a consumer product regardless of whether the product has substantial
-commercial, industrial or non-consumer uses, unless such uses represent
-the only significant mode of use of the product.
-
- "Installation Information" for a User Product means any methods,
-procedures, authorization keys, or other information required to install
-and execute modified versions of a covered work in that User Product from
-a modified version of its Corresponding Source. The information must
-suffice to ensure that the continued functioning of the modified object
-code is in no case prevented or interfered with solely because
-modification has been made.
-
- If you convey an object code work under this section in, or with, or
-specifically for use in, a User Product, and the conveying occurs as
-part of a transaction in which the right of possession and use of the
-User Product is transferred to the recipient in perpetuity or for a
-fixed term (regardless of how the transaction is characterized), the
-Corresponding Source conveyed under this section must be accompanied
-by the Installation Information. But this requirement does not apply
-if neither you nor any third party retains the ability to install
-modified object code on the User Product (for example, the work has
-been installed in ROM).
-
- The requirement to provide Installation Information does not include a
-requirement to continue to provide support service, warranty, or updates
-for a work that has been modified or installed by the recipient, or for
-the User Product in which it has been modified or installed. Access to a
-network may be denied when the modification itself materially and
-adversely affects the operation of the network or violates the rules and
-protocols for communication across the network.
-
- Corresponding Source conveyed, and Installation Information provided,
-in accord with this section must be in a format that is publicly
-documented (and with an implementation available to the public in
-source code form), and must require no special password or key for
-unpacking, reading or copying.
-
- 7. Additional Terms.
-
- "Additional permissions" are terms that supplement the terms of this
-License by making exceptions from one or more of its conditions.
-Additional permissions that are applicable to the entire Program shall
-be treated as though they were included in this License, to the extent
-that they are valid under applicable law. If additional permissions
-apply only to part of the Program, that part may be used separately
-under those permissions, but the entire Program remains governed by
-this License without regard to the additional permissions.
-
- When you convey a copy of a covered work, you may at your option
-remove any additional permissions from that copy, or from any part of
-it. (Additional permissions may be written to require their own
-removal in certain cases when you modify the work.) You may place
-additional permissions on material, added by you to a covered work,
-for which you have or can give appropriate copyright permission.
-
- Notwithstanding any other provision of this License, for material you
-add to a covered work, you may (if authorized by the copyright holders of
-that material) supplement the terms of this License with terms:
-
- a) Disclaiming warranty or limiting liability differently from the
- terms of sections 15 and 16 of this License; or
-
- b) Requiring preservation of specified reasonable legal notices or
- author attributions in that material or in the Appropriate Legal
- Notices displayed by works containing it; or
-
- c) Prohibiting misrepresentation of the origin of that material, or
- requiring that modified versions of such material be marked in
- reasonable ways as different from the original version; or
-
- d) Limiting the use for publicity purposes of names of licensors or
- authors of the material; or
-
- e) Declining to grant rights under trademark law for use of some
- trade names, trademarks, or service marks; or
-
- f) Requiring indemnification of licensors and authors of that
- material by anyone who conveys the material (or modified versions of
- it) with contractual assumptions of liability to the recipient, for
- any liability that these contractual assumptions directly impose on
- those licensors and authors.
-
- All other non-permissive additional terms are considered "further
-restrictions" within the meaning of section 10. If the Program as you
-received it, or any part of it, contains a notice stating that it is
-governed by this License along with a term that is a further
-restriction, you may remove that term. If a license document contains
-a further restriction but permits relicensing or conveying under this
-License, you may add to a covered work material governed by the terms
-of that license document, provided that the further restriction does
-not survive such relicensing or conveying.
-
- If you add terms to a covered work in accord with this section, you
-must place, in the relevant source files, a statement of the
-additional terms that apply to those files, or a notice indicating
-where to find the applicable terms.
-
- Additional terms, permissive or non-permissive, may be stated in the
-form of a separately written license, or stated as exceptions;
-the above requirements apply either way.
-
- 8. Termination.
-
- You may not propagate or modify a covered work except as expressly
-provided under this License. Any attempt otherwise to propagate or
-modify it is void, and will automatically terminate your rights under
-this License (including any patent licenses granted under the third
-paragraph of section 11).
-
- However, if you cease all violation of this License, then your
-license from a particular copyright holder is reinstated (a)
-provisionally, unless and until the copyright holder explicitly and
-finally terminates your license, and (b) permanently, if the copyright
-holder fails to notify you of the violation by some reasonable means
-prior to 60 days after the cessation.
-
- Moreover, your license from a particular copyright holder is
-reinstated permanently if the copyright holder notifies you of the
-violation by some reasonable means, this is the first time you have
-received notice of violation of this License (for any work) from that
-copyright holder, and you cure the violation prior to 30 days after
-your receipt of the notice.
-
- Termination of your rights under this section does not terminate the
-licenses of parties who have received copies or rights from you under
-this License. If your rights have been terminated and not permanently
-reinstated, you do not qualify to receive new licenses for the same
-material under section 10.
-
- 9. Acceptance Not Required for Having Copies.
-
- You are not required to accept this License in order to receive or
-run a copy of the Program. Ancillary propagation of a covered work
-occurring solely as a consequence of using peer-to-peer transmission
-to receive a copy likewise does not require acceptance. However,
-nothing other than this License grants you permission to propagate or
-modify any covered work. These actions infringe copyright if you do
-not accept this License. Therefore, by modifying or propagating a
-covered work, you indicate your acceptance of this License to do so.
-
- 10. Automatic Licensing of Downstream Recipients.
-
- Each time you convey a covered work, the recipient automatically
-receives a license from the original licensors, to run, modify and
-propagate that work, subject to this License. You are not responsible
-for enforcing compliance by third parties with this License.
-
- An "entity transaction" is a transaction transferring control of an
-organization, or substantially all assets of one, or subdividing an
-organization, or merging organizations. If propagation of a covered
-work results from an entity transaction, each party to that
-transaction who receives a copy of the work also receives whatever
-licenses to the work the party's predecessor in interest had or could
-give under the previous paragraph, plus a right to possession of the
-Corresponding Source of the work from the predecessor in interest, if
-the predecessor has it or can get it with reasonable efforts.
-
- You may not impose any further restrictions on the exercise of the
-rights granted or affirmed under this License. For example, you may
-not impose a license fee, royalty, or other charge for exercise of
-rights granted under this License, and you may not initiate litigation
-(including a cross-claim or counterclaim in a lawsuit) alleging that
-any patent claim is infringed by making, using, selling, offering for
-sale, or importing the Program or any portion of it.
-
- 11. Patents.
-
- A "contributor" is a copyright holder who authorizes use under this
-License of the Program or a work on which the Program is based. The
-work thus licensed is called the contributor's "contributor version".
-
- A contributor's "essential patent claims" are all patent claims
-owned or controlled by the contributor, whether already acquired or
-hereafter acquired, that would be infringed by some manner, permitted
-by this License, of making, using, or selling its contributor version,
-but do not include claims that would be infringed only as a
-consequence of further modification of the contributor version. For
-purposes of this definition, "control" includes the right to grant
-patent sublicenses in a manner consistent with the requirements of
-this License.
-
- Each contributor grants you a non-exclusive, worldwide, royalty-free
-patent license under the contributor's essential patent claims, to
-make, use, sell, offer for sale, import and otherwise run, modify and
-propagate the contents of its contributor version.
-
- In the following three paragraphs, a "patent license" is any express
-agreement or commitment, however denominated, not to enforce a patent
-(such as an express permission to practice a patent or covenant not to
-sue for patent infringement). To "grant" such a patent license to a
-party means to make such an agreement or commitment not to enforce a
-patent against the party.
-
- If you convey a covered work, knowingly relying on a patent license,
-and the Corresponding Source of the work is not available for anyone
-to copy, free of charge and under the terms of this License, through a
-publicly available network server or other readily accessible means,
-then you must either (1) cause the Corresponding Source to be so
-available, or (2) arrange to deprive yourself of the benefit of the
-patent license for this particular work, or (3) arrange, in a manner
-consistent with the requirements of this License, to extend the patent
-license to downstream recipients. "Knowingly relying" means you have
-actual knowledge that, but for the patent license, your conveying the
-covered work in a country, or your recipient's use of the covered work
-in a country, would infringe one or more identifiable patents in that
-country that you have reason to believe are valid.
-
- If, pursuant to or in connection with a single transaction or
-arrangement, you convey, or propagate by procuring conveyance of, a
-covered work, and grant a patent license to some of the parties
-receiving the covered work authorizing them to use, propagate, modify
-or convey a specific copy of the covered work, then the patent license
-you grant is automatically extended to all recipients of the covered
-work and works based on it.
-
- A patent license is "discriminatory" if it does not include within
-the scope of its coverage, prohibits the exercise of, or is
-conditioned on the non-exercise of one or more of the rights that are
-specifically granted under this License. You may not convey a covered
-work if you are a party to an arrangement with a third party that is
-in the business of distributing software, under which you make payment
-to the third party based on the extent of your activity of conveying
-the work, and under which the third party grants, to any of the
-parties who would receive the covered work from you, a discriminatory
-patent license (a) in connection with copies of the covered work
-conveyed by you (or copies made from those copies), or (b) primarily
-for and in connection with specific products or compilations that
-contain the covered work, unless you entered into that arrangement,
-or that patent license was granted, prior to 28 March 2007.
-
- Nothing in this License shall be construed as excluding or limiting
-any implied license or other defenses to infringement that may
-otherwise be available to you under applicable patent law.
-
- 12. No Surrender of Others' Freedom.
-
- If conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License. If you cannot convey a
-covered work so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you may
-not convey it at all. For example, if you agree to terms that obligate you
-to collect a royalty for further conveying from those to whom you convey
-the Program, the only way you could satisfy both those terms and this
-License would be to refrain entirely from conveying the Program.
-
- 13. Use with the GNU Affero General Public License.
-
- Notwithstanding any other provision of this License, you have
-permission to link or combine any covered work with a work licensed
-under version 3 of the GNU Affero General Public License into a single
-combined work, and to convey the resulting work. The terms of this
-License will continue to apply to the part which is the covered work,
-but the special requirements of the GNU Affero General Public License,
-section 13, concerning interaction through a network will apply to the
-combination as such.
-
- 14. Revised Versions of this License.
-
- The Free Software Foundation may publish revised and/or new versions of
-the GNU General Public License from time to time. Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
- Each version is given a distinguishing version number. If the
-Program specifies that a certain numbered version of the GNU General
-Public License "or any later version" applies to it, you have the
-option of following the terms and conditions either of that numbered
-version or of any later version published by the Free Software
-Foundation. If the Program does not specify a version number of the
-GNU General Public License, you may choose any version ever published
-by the Free Software Foundation.
-
- If the Program specifies that a proxy can decide which future
-versions of the GNU General Public License can be used, that proxy's
-public statement of acceptance of a version permanently authorizes you
-to choose that version for the Program.
-
- Later license versions may give you additional or different
-permissions. However, no additional obligations are imposed on any
-author or copyright holder as a result of your choosing to follow a
-later version.
-
- 15. Disclaimer of Warranty.
-
- THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
-APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
-HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
-OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
-THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
-IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
-ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
- 16. Limitation of Liability.
-
- IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
-THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
-GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
-USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
-DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
-PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
-EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
-SUCH DAMAGES.
-
- 17. Interpretation of Sections 15 and 16.
-
- If the disclaimer of warranty and limitation of liability provided
-above cannot be given local legal effect according to their terms,
-reviewing courts shall apply local law that most closely approximates
-an absolute waiver of all civil liability in connection with the
-Program, unless a warranty or assumption of liability accompanies a
-copy of the Program in return for a fee.
-
- END OF TERMS AND CONDITIONS
-
- How to Apply These Terms to Your New Programs
-
- If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
- To do so, attach the following notices to the program. It is safest
-to attach them to the start of each source file to most effectively
-state the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-
- Copyright (C)
-
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program. If not, see .
-
-Also add information on how to contact you by electronic and paper mail.
-
- If the program does terminal interaction, make it output a short
-notice like this when it starts in an interactive mode:
-
- Copyright (C)
- This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
- This is free software, and you are welcome to redistribute it
- under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License. Of course, your program's commands
-might be different; for a GUI interface, you would use an "about box".
-
- You should also get your employer (if you work as a programmer) or school,
-if any, to sign a "copyright disclaimer" for the program, if necessary.
-For more information on this, and how to apply and follow the GNU GPL, see
-.
-
- The GNU General Public License does not permit incorporating your program
-into proprietary programs. If your program is a subroutine library, you
-may consider it more useful to permit linking proprietary applications with
-the library. If this is what you want to do, use the GNU Lesser General
-Public License instead of this License. But first, please read
-.
diff --git a/Math.Gmp.Native/GMP_README b/Math.Gmp.Native/GMP_README
deleted file mode 100644
index 73ce364..0000000
--- a/Math.Gmp.Native/GMP_README
+++ /dev/null
@@ -1,111 +0,0 @@
-Copyright 1991, 1996, 1999, 2000, 2007 Free Software Foundation, Inc.
-
-This file is part of the GNU MP Library.
-
-The GNU MP Library is free software; you can redistribute it and/or modify
-it under the terms of either:
-
- * the GNU Lesser General Public License as published by the Free
- Software Foundation; either version 3 of the License, or (at your
- option) any later version.
-
-or
-
- * the GNU General Public License as published by the Free Software
- Foundation; either version 2 of the License, or (at your option) any
- later version.
-
-or both in parallel, as here.
-
-The GNU MP Library is distributed in the hope that it will be useful, but
-WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
-or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-for more details.
-
-You should have received copies of the GNU General Public License and the
-GNU Lesser General Public License along with the GNU MP Library. If not,
-see https://www.gnu.org/licenses/.
-
-
-
-
-
-
- THE GNU MP LIBRARY
-
-
-GNU MP is a library for arbitrary precision arithmetic, operating on signed
-integers, rational numbers, and floating point numbers. It has a rich set of
-functions, and the functions have a regular interface.
-
-GNU MP is designed to be as fast as possible, both for small operands and huge
-operands. The speed is achieved by using fullwords as the basic arithmetic
-type, by using fast algorithms, with carefully optimized assembly code for the
-most common inner loops for lots of CPUs, and by a general emphasis on speed
-(instead of simplicity or elegance).
-
-GNU MP is believed to be faster than any other similar library. Its advantage
-increases with operand sizes for certain operations, since GNU MP in many
-cases has asymptotically faster algorithms.
-
-GNU MP is free software and may be freely copied on the terms contained in the
-files COPYING* (see the manual for information on which license(s) applies to
-which components of GNU MP).
-
-
-
- OVERVIEW OF GNU MP
-
-There are four classes of functions in GNU MP.
-
- 1. Signed integer arithmetic functions (mpz). These functions are intended
- to be easy to use, with their regular interface. The associated type is
- `mpz_t'.
-
- 2. Rational arithmetic functions (mpq). For now, just a small set of
- functions necessary for basic rational arithmetics. The associated type
- is `mpq_t'.
-
- 3. Floating-point arithmetic functions (mpf). If the C type `double'
- doesn't give enough precision for your application, declare your
- variables as `mpf_t' instead, set the precision to any number desired,
- and call the functions in the mpf class for the arithmetic operations.
-
- 4. Positive-integer, hard-to-use, very low overhead functions are in the
- mpn class. No memory management is performed. The caller must ensure
- enough space is available for the results. The set of functions is not
- regular, nor is the calling interface. These functions accept input
- arguments in the form of pairs consisting of a pointer to the least
- significant word, and an integral size telling how many limbs (= words)
- the pointer points to.
-
- Almost all calculations, in the entire package, are made by calling these
- low-level functions.
-
-For more information on how to use GNU MP, please refer to the documentation.
-It is composed from the file doc/gmp.texi, and can be displayed on the screen
-or printed. How to do that, as well how to build the library, is described in
-the INSTALL file in this directory.
-
-
-
- REPORTING BUGS
-
-If you find a bug in the library, please make sure to tell us about it!
-
-You should first check the GNU MP web pages at https://gmplib.org/, under
-"Status of the current release". There will be patches for all known serious
-bugs there.
-
-Report bugs to gmp-bugs@gmplib.org. What information is needed in a useful bug
-report is described in the manual. The same address can be used for suggesting
-modifications and enhancements.
-
-
-
-
-----------------
-Local variables:
-mode: text
-fill-column: 78
-End:
diff --git a/Math.Gmp.Native/Math.Gmp.Native.csproj b/Math.Gmp.Native/Math.Gmp.Native.csproj
index ef5037c..4a249c8 100644
--- a/Math.Gmp.Native/Math.Gmp.Native.csproj
+++ b/Math.Gmp.Native/Math.Gmp.Native.csproj
@@ -9,9 +9,11 @@
Properties
Math.Gmp.Native
Math.Gmp.Native
- v2.0
+ v4.0
512
+
+
true
@@ -89,12 +91,6 @@
-
- PreserveNewest
-
-
- PreserveNewest
-
@@ -106,6 +102,18 @@
PreserveNewest
+
+ PreserveNewest
+
+
+ PreserveNewest
+
+
+ PreserveNewest
+
+
+ PreserveNewest
+
diff --git a/Math.Gmp.Native/char_ptr.cs b/Math.Gmp.Native/char_ptr.cs
index acf0918..91f27b6 100644
--- a/Math.Gmp.Native/char_ptr.cs
+++ b/Math.Gmp.Native/char_ptr.cs
@@ -27,7 +27,7 @@ namespace Math.Gmp.Native
/// The value of the new string.
///
///
- /// When done with the string, unmanaged memory must be released with .
+ /// When done with the string, unmanaged memory must be released with free.
///
///
public char_ptr(string str)
@@ -57,14 +57,14 @@ namespace Math.Gmp.Native
}
///
- /// Gets a null .
+ /// Gets a null char_ptr.
///
public static readonly char_ptr Zero = new char_ptr(IntPtr.Zero);
///
- /// Gets the .NET equivalent of the unmanaged string.
+ /// Gets the .NET string equivalent of the unmanaged string.
///
- /// The .NET equivalent of the unmanaged string.
+ /// The .NET string equivalent of the unmanaged string.
public override string ToString()
{
return Marshal.PtrToStringAnsi(Pointer);
@@ -74,7 +74,7 @@ namespace Math.Gmp.Native
/// Returns a value indicating whether this instance is equal to a specified object.
///
/// An object to compare with this instance.
- /// True if is an instance of and equals the value of this instance; otherwise, False.
+ /// True if is an instance of char_ptr and equals the value of this instance; otherwise, False.
public override bool Equals(object obj)
{
if (!(obj is char_ptr))
@@ -84,9 +84,9 @@ namespace Math.Gmp.Native
}
///
- /// Returns a value indicating whether this instance is equal to a specified value.
+ /// Returns a value indicating whether this instance is equal to a specified char_ptr value.
///
- /// A value to compare to this instance.
+ /// A char_ptr value to compare to this instance.
/// True if has the same value as this instance; otherwise, False.
public bool Equals(char_ptr other)
{
@@ -105,8 +105,8 @@ namespace Math.Gmp.Native
///
/// Gets a value that indicates whether the two argument values are equal.
///
- /// A value.
- /// A value.
+ /// A char_ptr value.
+ /// A char_ptr value.
/// True if the two values are equal, and False otherwise.
public static bool operator ==(char_ptr value1, char_ptr value2)
{
@@ -116,8 +116,8 @@ namespace Math.Gmp.Native
///
/// Gets a value that indicates whether the two argument values are different.
///
- /// A value.
- /// A value.
+ /// A char_ptr value.
+ /// A char_ptr value.
/// True if the two values are different, and False otherwise.
public static bool operator !=(char_ptr value1, char_ptr value2)
{
diff --git a/Math.Gmp.Native/gmp_lib.cs b/Math.Gmp.Native/gmp_lib.cs
index fbde7a0..c0f32e1 100644
--- a/Math.Gmp.Native/gmp_lib.cs
+++ b/Math.Gmp.Native/gmp_lib.cs
@@ -11,6 +11,509 @@ namespace Math.Gmp.Native
///
/// Represents all of the functions of the GNU MP library.
///
+ ///
+ ///
+ /// Functions Categories
+ ///
+ /// Global Variable and Constants:
+ ///
+ /// - gmp_errno - Gets or sets the global GMP error number.
+ /// - gmp_version - The GMP version number in the form “i.j.k”. This release is "6.1.2".
+ /// - mp_bits_per_limb - The number of bits per limb.
+ /// - mp_bytes_per_limb - The number of bytes per limb.
+ /// - mp_uint_per_limb - The number of 32-bit, unsigned integers per limb.
+ ///
+ /// Integer Functions:
+ /// Initializing Integers:
+ ///
+ /// - mpz_init - Initialize x, and set its value to 0.
+ /// - mpz_inits - Initialize a NULL-terminated list of mpz_t variables, and set their values to 0.
+ /// - mpz_init2 - Initialize x, with space for n-bit numbers, and set its value to 0.
+ /// - mpz_clear - Free the space occupied by x.
+ /// - mpz_clears - Free the space occupied by a NULL-terminated list of mpz_t variables.
+ /// - mpz_realloc2 - Change the space allocated for x to n bits.
+ ///
+ /// Assigning Integers:
+ ///
+ /// - mpz_set - Set the value of rop from op.
+ /// - mpz_set_ui - Set the value of rop from op.
+ /// - mpz_set_si - Set the value of rop from op.
+ /// - mpz_set_d - Set the value of rop from op.
+ /// - mpz_set_q - Set the value of rop from op.
+ /// - mpz_set_f - Set the value of rop from op.
+ /// - mpz_set_str - Set the value of rop from str, a null-terminated C string in base base.
+ /// - mpz_swap - Swap the values rop1 and rop2 efficiently.
+ ///
+ /// Simultaneous Integer Init & Assign:
+ ///
+ /// - mpz_init_set - Initialize rop with limb space and set the initial numeric value from op.
+ /// - mpz_init_set_ui - Initialize rop with limb space and set the initial numeric value from op.
+ /// - mpz_init_set_si - Initialize rop with limb space and set the initial numeric value from op.
+ /// - mpz_init_set_d - Initialize rop with limb space and set the initial numeric value from op.
+ /// - mpz_set_str - Set the value of rop from str, a null-terminated C string in base base.
+ ///
+ /// Converting Integers:
+ ///
+ /// - mpz_get_ui - Return the value of op as an unsigned long.
+ /// - mpz_get_si - Return the value of op as an signed long.
+ /// - mpz_get_d - Convert op to a double, truncating if necessary (i.e. rounding towards zero).
+ /// - mpz_get_d_2exp - Convert op to a double, truncating if necessary (i.e. rounding towards zero), and returning the exponent separately.
+ /// - mpz_get_str - Convert op to a string of digits in base base.
+ ///
+ /// Integer Arithmetic:
+ ///
+ /// - mpz_add - Set rop to op1 + op2.
+ /// - mpz_add_ui - Set rop to op1 + op2.
+ /// - mpz_sub - Set rop to op1 - op2.
+ /// - mpz_sub_ui - Set rop to op1 - op2.
+ /// - mpz_ui_sub - Set rop to op1 - op2.
+ /// - mpz_mul - Set rop to op1 * op2.
+ /// - mpz_mul_si - Set rop to op1 * op2.
+ /// - mpz_mul_ui - Set rop to op1 * op2.
+ /// - mpz_addmul - Set rop to rop + op1 * op2.
+ /// - mpz_addmul_ui - Set rop to rop + op1 * op2.
+ /// - mpz_submul - Set rop to rop - op1 * op2.
+ /// - mpz_submul_ui - Set rop to rop - op1 * op2.
+ /// - mpz_mul_2exp - Set rop to op1 * 2^op2.
+ /// - mpz_neg - Set rop to -op.
+ /// - mpz_abs - Set rop to the absolute value of op.
+ ///
+ /// Integer Division:
+ ///
+ /// - mpz_cdiv_q - Set the quotient q to ceiling(n / d).
+ /// - mpz_cdiv_r - Set the remainder r to n - q * d where q = ceiling(n / d).
+ /// - mpz_cdiv_qr - Set the quotient q to ceiling(n / d), and set the remainder r to n - q * d.
+ /// - mpz_cdiv_q_ui - Set the quotient q to ceiling(n / d), and return the remainder r = | n - q * d |.
+ /// - mpz_cdiv_r_ui - Set the remainder r to n - q * d where q = ceiling(n / d), and return | r |.
+ /// - mpz_cdiv_qr_ui - Set quotient q to ceiling(n / d), set the remainder r to n - q * d, and return | r |.
+ /// - mpz_cdiv_ui - Return the remainder | r | where r = n - q * d, and where q = ceiling(n / d).
+ /// - mpz_cdiv_q_2exp - Set the quotient q to ceiling(n / 2^b).
+ /// - mpz_cdiv_r_2exp - Set the remainder r to n - q * 2^b where q = ceiling(n / 2^b).
+ /// - mpz_fdiv_q - Set the quotient q to floor(n / d).
+ /// - mpz_fdiv_r - Set the remainder r to n - q * d where q = floor(n / d).
+ /// - mpz_fdiv_qr - Set the quotient q to floor(n / d), and set the remainder r to n - q * d.
+ /// - mpz_fdiv_q_ui - Set the quotient q to floor(n / d), and return the remainder r = | n - q * d |.
+ /// - mpz_fdiv_r_ui - Set the remainder r to n - q * d where q = floor(n / d), and return | r |.
+ /// - mpz_fdiv_qr_ui - Set quotient q to floor(n / d), set the remainder r to n - q * d, and return | r |.
+ /// - mpz_fdiv_ui - Return the remainder | r | where r = n - q * d, and where q = floor(n / d).
+ /// - mpz_fdiv_q_2exp - Set the quotient q to floor(n / 2^b).
+ /// - mpz_fdiv_r_2exp - Set the remainder r to n - q * 2^b where q = floor(n / 2^b).
+ /// - mpz_tdiv_q - Set the quotient q to trunc(n / d).
+ /// - mpz_tdiv_r - Set the remainder r to n - q * d where q = trunc(n / d).
+ /// - mpz_tdiv_qr - Set the quotient q to trunc(n / d), and set the remainder r to n - q * d.
+ /// - mpz_tdiv_q_ui - Set the quotient q to trunc(n / d), and return the remainder r = | n - q * d |.
+ /// - mpz_tdiv_r_ui - Set the remainder r to n - q * d where q = trunc(n / d), and return | r |.
+ /// - mpz_tdiv_qr_ui - Set quotient q to trunc(n / d), set the remainder r to n - q * d, and return | r |.
+ /// - mpz_tdiv_ui - Return the remainder | r | where r = n - q * d, and where q = trunc(n / d).
+ /// - mpz_tdiv_q_2exp - Set the quotient q to trunc(n / 2^b).
+ /// - mpz_tdiv_r_2exp - Set the remainder r to n - q * 2^b where q = trunc(n / 2^b).
+ /// - mpz_mod - Set r to n mod d.
+ /// - mpz_mod_ui - Set r to n mod d.
+ /// - mpz_divexact - Set q to n / d when it is known in advance that d divides n.
+ /// - mpz_divexact_ui - Set q to n / d when it is known in advance that d divides n.
+ /// - mpz_divisible_p - Return non-zero if n is exactly divisible by d.
+ /// - mpz_divisible_ui_p - Return non-zero if n is exactly divisible by d.
+ /// - mpz_divisible_2exp_p - Return non-zero if n is exactly divisible by 2^b.
+ /// - mpz_congruent_p - Return non-zero if n is congruent to c modulo d.
+ /// - mpz_congruent_ui_p - Return non-zero if n is congruent to c modulo d.
+ /// - mpz_congruent_2exp_p - Return non-zero if n is congruent to c modulo 2^b.
+ ///
+ /// Integer Exponentiation:
+ ///
+ /// - mpz_powm - Set rop to (base^exp) modulo mod.
+ /// - mpz_powm_ui - Set rop to (base^exp) modulo mod.
+ /// - mpz_powm_sec - Set rop to (base^exp) modulo mod.
+ /// - mpz_pow_ui - Set rop to base^exp. The case 0^0 yields 1.
+ /// - mpz_ui_pow_ui - Set rop to base^exp. The case 0^0 yields 1.
+ ///
+ /// Integer Roots:
+ ///
+ /// - mpz_root - Set rop to the truncated integer part of the nth root of op.
+ /// - mpz_rootrem - Set root to the truncated integer part of the nth root of u. Set rem to the remainder, u - root^n.
+ /// - mpz_sqrt - Set rop to the truncated integer part of the square root of op.
+ /// - mpz_sqrtrem - Set rop1 to the truncated integer part of the square root of op, like mpz_sqrt. Set rop2 to the remainder op - rop1 * rop1, which will be zero if op is a perfect square.
+ /// - mpz_perfect_power_p - Return non-zero if op is a perfect power, i.e., if there exist integers a and b, with b > 1, such that op = a^b.
+ /// - mpz_perfect_square_p - Return non-zero if op is a perfect square, i.e., if the square root of op is an integer.
+ ///
+ /// Number Theoretic Functions:
+ ///
+ /// - mpz_probab_prime_p - Determine whether n is prime.
+ /// - mpz_nextprime - Set rop to the next prime greater than op.
+ /// - mpz_gcd - Set rop to the greatest common divisor of op1 and op2.
+ /// - mpz_gcd_ui - Compute the greatest common divisor of op1 and op2. If rop is not null, store the result there.
+ /// - mpz_gcdext - Set g to the greatest common divisor of a and b, and in addition set s and t to coefficients satisfying a * s + b * t = g.
+ /// - mpz_lcm - Set rop to the least common multiple of op1 and op2.
+ /// - mpz_lcm_ui - Set rop to the least common multiple of op1 and op2.
+ /// - mpz_invert - Compute the inverse of op1 modulo op2 and put the result in rop.
+ /// - mpz_jacobi - Calculate the Jacobi symbol (a/b).
+ /// - mpz_legendre - Calculate the Legendre symbol (a/p).
+ /// - mpz_kronecker - Calculate the Jacobi symbol (a/b) with the Kronecker extension (a/2) = (2/a) when a odd, or (a/2) = 0 when a even.
+ /// - mpz_kronecker_si - Calculate the Jacobi symbol (a/b) with the Kronecker extension (a/2) = (2/a) when a odd, or (a/2) = 0 when a even.
+ /// - mpz_kronecker_ui - Calculate the Jacobi symbol (a/b) with the Kronecker extension (a/2) = (2/a) when a odd, or (a/2) = 0 when a even.
+ /// - mpz_si_kronecker - Calculate the Jacobi symbol (a/b) with the Kronecker extension (a/2) = (2/a) when a odd, or (a/2) = 0 when a even.
+ /// - mpz_ui_kronecker - Calculate the Jacobi symbol (a/b) with the Kronecker extension (a/2) = (2/a) when a odd, or (a/2) = 0 when a even.
+ /// - mpz_remove - Remove all occurrences of the factor f from op and store the result in rop.
+ /// - mpz_fac_ui - Set rop to the factorial n!.
+ /// - mpz_2fac_ui - Set rop to the double-factorial n!!.
+ /// - mpz_mfac_uiui - Set rop to the m-multi-factorial n!^(m)n.
+ /// - mpz_primorial_ui - Set rop to the primorial of n, i.e. the product of all positive prime numbers ≤ n.
+ /// - mpz_bin_ui - Compute the binomial coefficient n over k and store the result in rop.
+ /// - mpz_bin_uiui - Compute the binomial coefficient n over k and store the result in rop.
+ /// - mpz_fib_ui - Sets fn to to F[n], the n’th Fibonacci number.
+ /// - mpz_fib2_ui - Sets fn to F[n], and fnsub1 to F[n - 1].
+ /// - mpz_lucnum_ui - Sets ln to to L[n], the n’th Lucas number.
+ /// - mpz_lucnum2_ui - Sets ln to L[n], and lnsub1 to L[n - 1].
+ /// - mpz_millerrabin - An implementation of the probabilistic primality test found in Knuth's Seminumerical Algorithms book.
+ ///
+ /// Integer Comparisons:
+ ///
+ /// - mpz_cmp - Compare op1 and op2.
+ /// - mpz_cmp_d - Compare op1 and op2.
+ /// - mpz_cmp_si - Compare op1 and op2.
+ /// - mpz_cmp_ui - Compare op1 and op2.
+ /// - mpz_cmpabs - Compare the absolute values of op1 and op2.
+ /// - mpz_cmpabs_d - Compare the absolute values of op1 and op2.
+ /// - mpz_cmpabs_ui - Compare the absolute values of op1 and op2.
+ /// - mpz_sgn - Return +1 if op > 0, 0 if op = 0, and -1 if op < 0.
+ ///
+ /// Integer Logic and Bit Fiddling:
+ ///
+ /// - mpz_and - Set rop to op1 bitwise-and op2.
+ /// - mpz_ior - Set rop to op1 bitwise inclusive-or op2.
+ /// - mpz_xor - Set rop to op1 bitwise exclusive-or op2.
+ /// - mpz_com - Set rop to the one’s complement of op.
+ /// - mpz_popcount - Return the population count of op.
+ /// - mpz_hamdist - Return the hamming distance between the two operands.
+ /// - mpz_scan0 - Scan op for 0 bit.
+ /// - mpz_scan1 - Scan op for 1 bit.
+ /// - mpz_setbit - Set bit bit_index in rop.
+ /// - mpz_clrbit - Clear bit bit_index in rop.
+ /// - mpz_combit - Complement bit bit_index in rop.
+ /// - mpz_tstbit - Test bit bit_index in op and return 0 or 1 accordingly.
+ ///
+ /// I/O of Integers:
+ ///
+ /// - mpz_out_str - Output op on stdio stream stream, as a string of digits in base base.
+ /// - mpz_inp_str - Input a possibly white-space preceded string in base base from stdio stream stream, and put the read integer in rop.
+ /// - mpz_out_raw - Output op on stdio stream stream, in raw binary format.
+ /// - mpz_out_raw, and put the result in rop.
+ ///
+ /// Integer Random Numbers:
+ ///
+ /// - mpz_urandomb - Generate a uniformly distributed random integer in the range 0 to 2^n - 1, inclusive.
+ /// - mpz_urandomm - Generate a uniform random integer in the range 0 to n - 1, inclusive.
+ /// - mpz_rrandomb - Generate a random integer with long strings of zeros and ones in the binary representation.
+ /// - mpz_random - Generate a random integer of at most max_size limbs.
+ /// - mpz_random2 - Generate a random integer of at most max_size limbs, with long strings of zeros and ones in the binary representation.
+ ///
+ /// Integer Import and Export:
+ ///
+ /// - mpz_import - Set rop from an array of word data at op.
+ /// - mpz_export - Fill rop with word data from op.
+ ///
+ /// Miscellaneous Integer Functions:
+ ///
+ /// - mpz_fits_sint_p - Return non-zero iff the value of op fits in a signed 32-bit integer. Otherwise, return zero.
+ /// - mpz_fits_slong_p - Return non-zero iff the value of op fits in a signed 32-bit integer. Otherwise, return zero.
+ /// - mpz_fits_sshort_p - Return non-zero iff the value of op fits in a signed 16-bit integer. Otherwise, return zero.
+ /// - mpz_fits_uint_p - Return non-zero iff the value of op fits in an unsigned 32-bit integer. Otherwise, return zero.
+ /// - mpz_fits_ulong_p - Return non-zero iff the value of op fits in an unsigned 32-bit integer. Otherwise, return zero.
+ /// - mpz_fits_ushort_p - Return non-zero iff the value of op fits in an unsigned 16-bit integer. Otherwise, return zero.
+ /// - mpz_sizeinbase - Return the size of op measured in number of digits in the given base.
+ /// - mpz_even_p - Determine whether op is even.
+ /// - mpz_odd_p - Determine whether op is odd.
+ ///
+ /// Integer Special Functions:
+ ///
+ /// - _mpz_realloc - Change the space for integer to new_alloc limbs.
+ /// - mpz_getlimbn - Return limb number n from op.
+ /// - mpz_size - Return the size of op measured in number of limbs.
+ /// - mpz_limbs_read - Return a pointer to the limb array representing the absolute value of x.
+ /// - mpz_limbs_write - Return a pointer to the limb array of x, intended for write access.
+ /// - mpz_limbs_modify - Return a pointer to the limb array of x, intended for write access.
+ /// - mpz_limbs_finish - Updates the internal size field of x.
+ /// - mpz_roinit_n - Special initialization of x, using the given limb array and size.
+ ///
+ /// Rational Number Functions:
+ /// Initializing Rationals:
+ ///
+ /// - mpq_canonicalize - Remove any factors that are common to the numerator and denominator of op, and make the denominator positive.
+ /// - mpq_init - Initialize x and set it to 0/1.
+ /// - mpq_inits - Initialize a NULL-terminated list of mpq_t variables, and set their values to 0/1.
+ /// - mpq_clear - Free the space occupied by x.
+ /// - mpq_clears - Free the space occupied by a NULL-terminated list of mpq_t variables.
+ /// - mpq_set - Assign rop from op.
+ /// - mpq_set_z - Assign rop from op.
+ /// - mpq_set_ui - Set the value of rop to op1 / op2.
+ /// - mpq_set_si - Set the value of rop to op1 / op2.
+ /// - mpq_set_str - Set rop from a null-terminated string str in the given base.
+ /// - mpq_swap - Swap the values rop1 and rop2 efficiently.
+ ///
+ /// Rational Conversions:
+ ///
+ /// - mpq_get_d - Convert op to a System.Double, truncating if necessary (i.e. rounding towards zero).
+ /// - mpq_set_d - Set rop to the value of op. There is no rounding, this conversion is exact.
+ /// - mpq_set_f - Set rop to the value of op. There is no rounding, this conversion is exact.
+ /// - mpq_get_str - Convert op to a string of digits in base base.
+ ///
+ /// Rational Arithmetic:
+ ///
+ /// - mpq_add - Set sum to addend1 + addend2.
+ /// - mpq_sub - Set difference to minuend - subtrahend.
+ /// - mpq_mul - Set product to multiplier * multiplicand.
+ /// - mpq_mul_2exp - Set rop to op1 * 2^op2.
+ /// - mpq_div - Set quotient to dividend / divisor.
+ /// - mpq_div_2exp - Set rop to op1 / 2^op2.
+ /// - mpq_neg - Set negated_operand to -operand.
+ /// - mpq_abs - Set rop to the absolute value of op.
+ /// - mpq_inv - Set inverted_number to 1 / number.
+ ///
+ /// Comparing Rationals:
+ ///
+ /// - mpq_cmp - Compare op1 and op2.
+ /// - mpq_cmp_z - Compare op1 and op2.
+ /// - mpq_cmp_ui - Compare op1 and num2 / den2.
+ /// - mpq_cmp_si - Compare op1 and num2 / den2.
+ /// - mpq_sgn - Return +1 if op > 0, 0 if op = 0, and -1 if op < 0.
+ /// - mpq_equal - Return non-zero if op1 and op2 are equal, zero if they are non-equal.
+ ///
+ /// Applying Integer Functions:
+ ///
+ /// - mpq_numref - Return a reference to the numerator op.
+ /// - mpq_denref - Return a reference to the denominator op.
+ /// - mpq_get_num - Set numerator to the numerator of rational.
+ /// - mpq_get_den - Set denominator to the denominator of rational.
+ /// - mpq_set_num - Set the numerator of rational to numerator.
+ /// - mpq_set_den - Set the denominator of rational to denominator.
+ ///
+ /// I/O of Rationals:
+ ///
+ /// - mpq_out_str - Output op on stdio stream stream, as a string of digits in base base.
+ /// - mpq_inp_str - Read a string of digits from stream and convert them to a rational in rop.
+ ///
+ /// Floating-point Functions:
+ /// Initializing Floats:
+ ///
+ /// - mpf_set_default_prec - Set the default precision to be at least prec bits.
+ /// - mpf_get_default_prec - Return the default precision actually used.
+ /// - mpf_init - Initialize x to 0.
+ /// - mpf_init2 - Initialize x to 0 and set its precision to be at least prec bits.
+ /// - mpf_inits - Initialize a NULL-terminated list of mpf_t variables, and set their values to 0.
+ /// - mpf_clear - Free the space occupied by x.
+ /// - mpf_clears - Free the space occupied by a NULL-terminated list of mpf_t variables.
+ /// - mpf_get_prec - Return the current precision of op, in bits.
+ /// - mpf_set_prec - Set the precision of rop to be at least prec bits.
+ /// - mpf_set_prec_raw - Set the precision of rop to be at least prec bits, without changing the memory allocated.
+ /// - mpf_size - Return the number of limbs currently in use.
+ ///
+ /// Assigning Floats:
+ ///
+ /// - mpf_set - Set the value of rop from op.
+ /// - mpf_set_ui - Set the value of rop from op.
+ /// - mpf_set_si - Set the value of rop from op.
+ /// - mpf_set_d - Set the value of rop from op.
+ /// - mpf_set_z - Set the value of rop from op.
+ /// - mpf_set_q - Set the value of rop from op.
+ /// - mpf_set_str - Set the value of rop from the string in str.
+ /// - mpf_swap - Swap rop1 and rop2 efficiently.
+ ///
+ /// Simultaneous Float Init & Assign:
+ ///
+ /// - mpf_init_set - Initialize rop and set its value from op.
+ /// - mpf_init_set_ui - Initialize rop and set its value from op.
+ /// - mpf_init_set_si - Initialize rop and set its value from op.
+ /// - mpf_init_set_d - Initialize rop and set its value from op.
+ /// - mpf_init_set_str - Initialize rop and set its value from the string in str.
+ ///
+ /// Converting Floats:
+ ///
+ /// - mpf_get_d - Convert op to a System.Double, truncating if necessary (i.e. rounding towards zero).
+ /// - mpf_get_d_2exp - Convert op to a double, truncating if necessary (i.e. rounding towards zero), and with an exponent returned separately.
+ /// - mpf_get_si - Convert op to a 32-bit integer, truncating any fraction part.
+ /// - mpf_get_ui - Convert op to an unsigned 32-bit integer, truncating any fraction part.
+ /// - mpf_get_str - Convert op to a string of digits in base base.
+ ///
+ /// Float Arithmetic:
+ ///
+ /// - mpf_add - Set rop to op1 + op2.
+ /// - mpf_add_ui - Set rop to op1 + op2.
+ /// - mpf_sub - Set rop to op1 - op2.
+ /// - mpf_ui_sub - Set rop to op1 - op2.
+ /// - mpf_sub_ui - Set rop to op1 - op2.
+ /// - mpf_mul - Set rop to op1 * op2.
+ /// - mpf_mul_ui - Set rop to op1 * op2.
+ /// - mpf_div - Set rop to op1 / op2.
+ /// - mpf_ui_div - Set rop to op1 / op2.
+ /// - mpf_div_ui - Set rop to op1 / op2.
+ /// - mpf_sqrt - Set rop to the square root of op.
+ /// - mpf_sqrt_ui - Set rop to the square root of op.
+ /// - mpf_pow_ui - Set rop to op1^op2.
+ /// - mpf_neg - Set rop to -op.
+ /// - mpf_abs - Set rop to | op |.
+ /// - mpf_mul_2exp - Set rop to op1 * 2^op2.
+ /// - mpf_div_2exp - Set rop to op1 / 2^op2.
+ ///
+ /// Float Comparison:
+ ///
+ /// - mpf_cmp - Compare op1 and op2.
+ /// - mpf_cmp_z - Compare op1 and op2.
+ /// - mpf_cmp_d - Compare op1 and op2.
+ /// - mpf_cmp_ui - Compare op1 and op2.
+ /// - mpf_cmp_si - Compare op1 and op2.
+ /// - mpf_reldiff - Compute the relative difference between op1 and op2 and store the result in rop. This is | op1 - op2 | / op1.
+ /// - mpf_sgn - Return +1 if op > 0, 0 if op = 0, and -1 if op < 0.
+ ///
+ /// I/O of Floats:
+ ///
+ /// - mpf_out_str - Print op to stream, as a string of digits.
+ /// - mpf_inp_str - Read a string in base base from stream, and put the read float in rop.
+ ///
+ /// Miscellaneous Float Functions:
+ ///
+ /// - mpf_ceil - Set rop to op rounded to the next higher integer.
+ /// - mpf_floor - Set rop to op rounded to the next lower integer.
+ /// - mpf_trunc - Set rop to op rounded to the integer towards zero.
+ /// - mpf_integer_p - Return non-zero if op is an integer.
+ /// - mpf_fits_ulong_p - Return non-zero if op fits in an unsigned 32-bit integer, when truncated to an integer.
+ /// - mpf_fits_slong_p - Return non-zero if op fits in a 32-bit integer, when truncated to an integer.
+ /// - mpf_fits_uint_p - Return non-zero if op fits in an unsigned 32-bit integer, when truncated to an integer.
+ /// - mpf_fits_sint_p - Return non-zero if op fits in a 32-bit integer, when truncated to an integer.
+ /// - mpf_fits_sshort_p - Return non-zero if op fits in a 16-bit integer, when truncated to an integer.
+ /// - mpf_fits_ushort_p - Return non-zero if op fits in an unsigned 16-bit integer, when truncated to an integer.
+ /// - mpf_urandomb - Generate a uniformly distributed random float in rop, such that 0 ≤ rop < 1, with nbits significant bits in the mantissa or less if the precision of rop is smaller.
+ /// - mpf_random2 - Generate a random float of at most max_size limbs, with long strings of zeros and ones in the binary representation.
+ ///
+ /// Low-level Functions:
+ ///
+ /// - mpn_add_n - Add {s1p, n} and {s2p, n}, and write the n least significant limbs of the result to rp.
+ /// - mpn_add_1 - Add {s1p, n} and s2limb, and write the n least significant limbs of the result to rp.
+ /// - mpn_add - Add {s1p, s1n} and {s2p, s2n}, and write the s1n least significant limbs of the result to rp.
+ /// - mpn_sub_n - Subtract {s2p, n} from {s1p, n}, and write the n least significant limbs of the result to rp.
+ /// - mpn_sub_1 - Subtract s2limb from {s1p, n}, and write the n least significant limbs of the result to rp.
+ /// - mpn_sub - Subtract {s2p, s2n} from {s1p, s1n}, and write the s1n least significant limbs of the result to rp.
+ /// - mpn_neg - Perform the negation of {sp, n}, and write the result to {rp, n}.
+ /// - mpn_mul_n - Multiply {s1p, n} and {s2p, n}, and write the (2 * n)-limb result to rp.
+ /// - mpn_mul - Multiply {s1p, s1n} and {s2p, s2n}, and write the (s1n + s2n)-limb result to rp.
+ /// - mpn_sqr - Compute the square of {s1p, n} and write the (2 * n)-limb result to rp.
+ /// - mpn_mul_1 - Multiply {s1p, n} by s2limb, and write the n least significant limbs of the product to rp.
+ /// - mpn_addmul_1 - Multiply {s1p, n} and s2limb, and add the n least significant limbs of the product to {rp, n} and write the result to rp.
+ /// - mpn_submul_1 - Multiply {s1p, n} and s2limb, and subtract the n least significant limbs of the product from {rp, n} and write the result to rp.
+ /// - mpn_tdiv_qr - Divide {np, nn} by {dp, dn} and put the quotient at {qp, nn - dn + 1} and the remainder at {rp, dn}.
+ /// - mpn_divrem_1 - Divide {s2p, s2n} by s3limb, and write the quotient at r1p.
+ /// - mpn_divmod_1 - Divide {s2p, s2n} by s3limb, and write the quotient at r1p.
+ /// - mpn_divexact_1 - Divide {sp, n} by d, expecting it to divide exactly, and writing the result to {rrp, n}.
+ /// - mpn_divexact_by3 - Divide {sp, n} by 3, expecting it to divide exactly, and writing the result to {rp, n}.
+ /// - mpn_divexact_by3c - Divide {sp, n} by 3, expecting it to divide exactly, and writing the result to {rp, n}.
+ /// - mpn_mod_1 - Divide {s1p, s1n} by s2limb, and return the remainder.
+ /// - mpn_lshift - Shift {sp, n} left by count bits, and write the result to {rp, n}.
+ /// - mpn_rshift - Shift {sp, n} right by count bits, and write the result to {rp, n}.
+ /// - mpn_cmp - Compare {s1p, n} and {s2p, n}.
+ /// - mpn_zero_p - Test {sp, n} and return 1 if the operand is zero, 0 otherwise.
+ /// - mpn_gcd - Set {rp, retval} to the greatest common divisor of {xp, xn} and {yp, yn}.
+ /// - mpn_gcd_1 - Return the greatest common divisor of {xp, xn} and ylimb.
+ /// - mpn_gcdext - Compute the greatest common divisor G of U and V. Compute a cofactor S such that G = US + VT.
+ /// - mpn_sqrtrem - Compute the square root of {sp, n} and put the result at {r1p, ceil(n / 2)} and the remainder at {r2p, retval}.
+ /// - mpn_sizeinbase - Return the size of {xp, n} measured in number of digits in the given base.
+ /// - mpn_get_str - Convert {s1p, s1n} to a raw unsigned char array at str in base base, and return the number of characters produced.
+ /// - mpn_set_str - Convert bytes {str, strsize} in the given base to limbs at rp.
+ /// - mpn_scan0 - Scan s1p from bit position bit for the next clear bit.
+ /// - mpn_scan1 - Scan s1p from bit position bit for the next set bit.
+ /// - mpn_random - Generate a random number of length r1n and store it at r1p.
+ /// - mpn_random2 - Generate a random number of length r1n and store it at r1p.
+ /// - mpn_popcount - Count the number of set bits in {s1p, n}.
+ /// - mpn_hamdist - Compute the hamming distance between {s1p, n} and {s2p, n}, which is the number of bit positions where the two operands have different bit values.
+ /// - mpn_perfect_square_p - Return non-zero iff {s1p, n} is a perfect square.
+ /// - mpn_perfect_power_p - Return non-zero iff {sp, n} is a perfect power.
+ /// - mpn_and_n - Perform the bitwise logical and of {s1p, n} and {s2p, n}, and write the result to {rp, n}.
+ /// - mpn_ior_n - Perform the bitwise logical inclusive or of {s1p, n} and {s2p, n}, and write the result to {rp, n}.
+ /// - mpn_xor_n - Perform the bitwise logical exclusive or of {s1p, n} and {s2p, n}, and write the result to {rp, n}.
+ /// - mpn_andn_n - Perform the bitwise logical and of {s1p, n} and the bitwise complement of {s2p, n}, and write the result to {rp, n}.
+ /// - mpn_iorn_n - Perform the bitwise logical inclusive or of {s1p, n} and the bitwise complement of {s2p, n}, and write the result to {rp, n}.
+ /// - mpn_nand_n - Perform the bitwise logical and of {s1p, n} and {s2p, n}, and write the bitwise complement of the result to {rp, n}.
+ /// - mpn_nior_n - Perform the bitwise logical inclusive or of {s1p, n} and {s2p, n}, and write the bitwise complement of the result to {rp, n}.
+ /// - mpn_xnor_n - Perform the bitwise logical exclusive or of {s1p, n} and {s2p, n}, and write the bitwise complement of the result to {rp, n}.
+ /// - mpn_com - Perform the bitwise complement of {sp, n}, and write the result to {rp, n}.
+ /// - mpn_copyi - Copy from {s1p, n} to {rp, n}, increasingly.
+ /// - mpn_copyd - Copy from {s1p, n} to {rp, n}, decreasingly.
+ /// - mpn_zero - Zero {rp, n}.
+ ///
+ /// Low-level functions for cryptography:
+ ///
+ /// - mpn_cnd_add_n - If cnd is non-zero, it produces the same result as a regular mpn_add_n, and if cnd is zero, it copies {s1p, n} to the result area and returns zero.
+ /// - mpn_cnd_sub_n - If cnd is non-zero, it produces the same result as a regular mpn_sub_n, and if cnd is zero, it copies {s1p, n} to the result area and returns zero.
+ /// - mpn_sec_add_1 - Set R to A + b, where R = {rp, n}, A = {ap, n}, and b is a single limb.
+ /// - mpn_sec_add_1_itch - Return the scratch space in number of limbs required by the function mpn_sec_add_1.
+ /// - mpn_sec_sub_1 - Set R to A - b, where R = {rp, n}, A = {ap, n}, and b is a single limb.
+ /// - mpn_sec_sub_1_itch - Return the scratch space in number of limbs required by the function mpn_sec_sub_1.
+ /// - mpn_cnd_swap - If cnd is non-zero, swaps the contents of the areas {ap, n} and {bp, n}. Otherwise, the areas are left unmodified.
+ /// - mpn_sec_mul - Set R to A * B, where A = {ap, an}, B = {bp, bn}, and R = {rp, an + bn}.
+ /// - mpn_sec_mul_itch - Return the scratch space in number of limbs required by the function mpn_sec_mul.
+ /// - mpn_sec_sqr - Set R to A^2, where A = {ap, an}, and R = {rp, 2 * an}.
+ /// - mpn_sec_sqr_itch - Return the scratch space in number of limbs required by the function mpn_sec_sqr.
+ /// - mpn_sec_powm - Set R to (B^E) modulo M, where R = {rp, n}, M = {mp, n}, and E = {ep, ceil(enb / mp_bits_per_limb)}.
+ /// - mpn_sec_powm_itch - Return the scratch space in number of limbs required by the function mpn_sec_powm.
+ /// - mpn_sec_tabselect - Select entry which from table tab, which has nents entries, each n limbs. Store the selected entry at rp.
+ /// - mpn_sec_div_qr - Set Q to the truncated quotient N / D and R to N modulo D, where N = {np, nn}, D = {dp, dn}, Q’s most significant limb is the function return value and the remaining limbs are {qp, nn - dn}, and R = {np, dn}.
+ /// - mpn_sec_div_qr_itch - Return the scratch space in number of limbs required by the function mpn_sec_div_qr.
+ /// - mpn_sec_div_r - Set R to N modulo D, where N = {np, nn}, D = {dp, dn}, and R = {np, dn}.
+ /// - mpn_sec_div_r_itch - Return the scratch space in number of limbs required by the function mpn_sec_div_r.
+ /// - mpn_sec_invert - Set R to the inverse of A modulo M, where R = {rp, n}, A = {ap, n}, and M = {mp, n}. This function’s interface is preliminary.
+ /// - mpn_sec_invert_itch - Return the scratch space in number of limbs required by the function mpn_sec_invert.
+ ///
+ /// Random Number Functions:
+ /// Random State Initialization:
+ ///
+ /// - gmp_randinit_default - Initialize state with a default algorithm.
+ /// - gmp_randinit_mt - Initialize state for a Mersenne Twister algorithm.
+ /// - gmp_randinit_lc_2exp - Initialize state with a linear congruential algorithm X = (aX + c) mod 2^m2exp.
+ /// - gmp_randinit_lc_2exp_size - Initialize state for a linear congruential algorithm as per gmp_randinit_lc_2exp.
+ /// - gmp_randinit_set - Initialize rop with a copy of the algorithm and state from op.
+ /// - gmp_randclear - Free all memory occupied by state.
+ ///
+ /// Random State Seeding:
+ ///
+ /// - gmp_randseed - Set an initial seed value into state.
+ /// - gmp_randseed_ui - Set an initial seed value into state.
+ ///
+ /// Random State Miscellaneous:
+ ///
+ /// - gmp_urandomb_ui - Generate a uniformly distributed random number of n bits, i.e. in the range 0 to 2^n - 1 inclusive.
+ /// - gmp_urandomm_ui - Generate a uniformly distributed random number in the range 0 to n - 1, inclusive.
+ ///
+ /// Formatted Output:
+ /// Formatted Output Functions:
+ ///
+ /// - gmp_printf - Print to the standard output stdout.
+ /// - gmp_vprintf - Print to the standard output stdout.
+ /// - gmp_fprintf - Print to the stream fp.
+ /// - gmp_vfprintf - Print to the stream fp.
+ /// - gmp_sprintf - Form a null-terminated string in buf.
+ /// - gmp_vsprintf - Form a null-terminated string in buf.
+ /// - gmp_snprintf - Form a null-terminated string in buf.
+ /// - gmp_vsnprintf - Form a null-terminated string in buf.
+ /// - gmp_asprintf - Form a null-terminated string in a block of memory obtained from the current memory allocation function.
+ /// - gmp_vasprintf - Form a null-terminated string in a block of memory obtained from the current memory allocation function.
+ ///
+ /// Formatted Input:
+ /// Formatted Input Functions:
+ ///
+ /// - gmp_scanf - Read from the standard input stdin.
+ /// - gmp_vscanf - Read from the standard input stdin.
+ /// - gmp_fscanf - Read from the stream fp.
+ /// - gmp_vfscanf - Read from the stream fp.
+ /// - gmp_sscanf - Read from a null-terminated string s.
+ /// - gmp_vsscanf - Read from a null-terminated string s.
+ ///
+ /// Custom Allocation:
+ ///
+ /// - mp_set_memory_functions - Replace the current allocation functions from the arguments.
+ /// - mp_get_memory_functions - Get the current allocation functions, storing function pointers to the locations given by the arguments.
+ /// - allocate - Return a pointer to newly allocated space with at least alloc_size bytes.
+ /// - reallocate - Resize a previously allocated block ptr of old_size bytes to be new_size bytes.
+ /// - free - De-allocate the space pointed to by ptrs.
+ /// - ZeroMemory - The ZeroMemory routine fills a block of memory with zeros, given a pointer to the block and the length, in bytes, to be filled.
+ ///
+ ///
public static class gmp_lib
{
@@ -48,6 +551,8 @@ namespace Math.Gmp.Native
///
/// Gets or sets the global GMP error number.
///
+ /// Global Variable and Constants
+ /// GNU MP - Useful Macros and Constants
public static int gmp_errno
{
get
@@ -63,6 +568,7 @@ namespace Math.Gmp.Native
///
/// The GMP version number in the form “i.j.k”. This release is "6.1.2".
///
+ /// Global Variable and Constants
/// GNU MP - Useful Macros and Constants
///
///
@@ -79,8 +585,9 @@ namespace Math.Gmp.Native
///
/// The number of bits per limb.
///
- ///
- ///
+ /// mp_bytes_per_limb
+ /// mp_uint_per_limb
+ /// Global Variable and Constants
/// GNU MP - Useful Macros and Constants
///
///
@@ -97,8 +604,9 @@ namespace Math.Gmp.Native
///
/// The number of bytes per limb.
///
- ///
- ///
+ /// mp_bits_per_limb
+ /// mp_uint_per_limb
+ /// Global Variable and Constants
///
///
/// mp_size_t bytesPerLimb = gmp_lib.mp_bytes_per_limb;
@@ -114,8 +622,9 @@ namespace Math.Gmp.Native
///
/// The number of 32-bit, unsigned integers per limb.
///
- ///
- ///
+ /// mp_bits_per_limb
+ /// mp_bytes_per_limb
+ /// Global Variable and Constants
///
///
/// mp_size_t uintsPerLimb = gmp_lib.mp_uint_per_limb;
@@ -138,8 +647,9 @@ namespace Math.Gmp.Native
/// The minimum number of bytes to allocate.
/// A pointer to newly allocated space with at least bytes.
///
- ///
- ///
+ /// free
+ /// reallocate
+ /// Custom Allocation
/// GNU MP - Custom Allocation
public static void_ptr allocate(size_t alloc_size)
{
@@ -168,8 +678,9 @@ namespace Math.Gmp.Native
/// if not needed by an implementation. The default functions using malloc and friends for instance don’t use it.
///
///
- ///
- ///
+ /// allocate
+ /// free
+ /// Custom Allocation
/// GNU MP - Custom Allocation
public static void_ptr reallocate(void_ptr ptr, size_t old_size, size_t new_size)
{
@@ -244,8 +755,9 @@ namespace Math.Gmp.Native
/// if not needed by an implementation. The default functions using malloc and friends for instance don’t use it.
///
///
- ///
- ///
+ /// allocate
+ /// reallocate
+ /// Custom Allocation
/// GNU MP - Custom Allocation
public static void free(void_ptr ptr, size_t size)
{
@@ -258,7 +770,8 @@ namespace Math.Gmp.Native
/// The memory allocation function.
/// The memory reallocation function.
/// The memory de-allocation function.
- ///
+ /// mp_set_memory_functions
+ /// Custom Allocation
/// GNU MP - Custom Allocation
///
///
@@ -313,7 +826,8 @@ namespace Math.Gmp.Native
/// default function is used.
///
///
- ///
+ /// mp_get_memory_functions
+ /// Custom Allocation
/// GNU MP - Custom Allocation
///
///
@@ -483,7 +997,7 @@ namespace Math.Gmp.Native
}
///
- /// The routine fills a block of memory with zeros, given a pointer to the block and the length, in bytes, to be filled.
+ /// The ZeroMemory routine fills a block of memory with zeros, given a pointer to the block and the length, in bytes, to be filled.
///
/// A pointer to the memory block to be filled with zeros.
/// The number of bytes to fill with zeros.
@@ -504,14 +1018,15 @@ namespace Math.Gmp.Native
///
/// This will be a compromise between speed and randomness,
/// and is recommended for applications with no special requirements.
- /// Currently this is .
+ /// Currently this is gmp_randinit_mt.
///
///
- ///
- ///
- ///
- ///
- ///
+ /// gmp_randclear
+ /// gmp_randinit_lc_2exp
+ /// gmp_randinit_lc_2exp_size
+ /// gmp_randinit_mt
+ /// gmp_randinit_set
+ /// Random State Initialization
/// GNU MP - Random State Initialization
///
///
@@ -559,11 +1074,12 @@ namespace Math.Gmp.Native
/// multiple iterations of the recurrence are used and the results concatenated.
///
///
- ///
- ///
- ///
- ///
- ///
+ /// gmp_randclear
+ /// gmp_randinit_default
+ /// gmp_randinit_lc_2exp_size
+ /// gmp_randinit_mt
+ /// gmp_randinit_set
+ /// Random State Initialization
/// GNU MP - Random State Initialization
///
///
@@ -602,7 +1118,7 @@ namespace Math.Gmp.Native
}
///
- /// Initialize for a linear congruential algorithm as per .
+ /// Initialize for a linear congruential algorithm as per gmp_randinit_lc_2exp.
///
/// The state to initialize.
///
@@ -613,11 +1129,12 @@ namespace Math.Gmp.Native
/// bits (or more) of each X will be used, i.e. m2exp / 2 ≥ .
///
///
- ///
- ///
- ///
- ///
- ///
+ /// gmp_randclear
+ /// gmp_randinit_default
+ /// gmp_randinit_lc_2exp
+ /// gmp_randinit_mt
+ /// gmp_randinit_set
+ /// Random State Initialization
/// GNU MP - Random State Initialization
///
///
@@ -656,11 +1173,12 @@ namespace Math.Gmp.Native
/// This algorithm is fast and has good randomness properties.
///
///
- ///
- ///
- ///
- ///
- ///
+ /// gmp_randclear
+ /// gmp_randinit_default
+ /// gmp_randinit_lc_2exp
+ /// gmp_randinit_lc_2exp_size
+ /// gmp_randinit_set
+ /// Random State Initialization
/// GNU MP - Random State Initialization
///
///
@@ -695,11 +1213,12 @@ namespace Math.Gmp.Native
///
/// The state to initialize.
/// The source state.
- ///
- ///
- ///
- ///
- ///
+ /// gmp_randclear
+ /// gmp_randinit_default
+ /// gmp_randinit_lc_2exp
+ /// gmp_randinit_lc_2exp_size
+ /// gmp_randinit_mt
+ /// Random State Initialization
/// GNU MP - Random State Initialization
///
///
@@ -759,7 +1278,8 @@ namespace Math.Gmp.Native
/// there’s a special device /dev/random which provides random data better suited for use as a seed.
///
///
- ///
+ /// gmp_randseed_ui
+ /// Random State Seeding
/// GNU MP - Random State Seeding
///
///
@@ -821,7 +1341,8 @@ namespace Math.Gmp.Native
/// there’s a special device /dev/random which provides random data better suited for use as a seed.
///
///
- ///
+ /// gmp_randseed
+ /// Random State Seeding
/// GNU MP - Random State Seeding
///
///
@@ -857,11 +1378,12 @@ namespace Math.Gmp.Native
/// Free all memory occupied by .
///
/// A state.
- ///
- ///
- ///
- ///
- ///
+ /// gmp_randinit_default
+ /// gmp_randinit_lc_2exp
+ /// gmp_randinit_lc_2exp_size
+ /// gmp_randinit_mt
+ /// gmp_randinit_set
+ /// Random State Initialization
/// GNU MP - Random State Initialization
public static void gmp_randclear(gmp_randstate_t state)
{
@@ -884,7 +1406,8 @@ namespace Math.Gmp.Native
/// In .NET, must be less than or equal to the number of bits in an unsigned 32-bit integer.
///
///
- ///
+ /// gmp_urandomm_ui
+ /// Random State Miscellaneous
/// GNU MP - Random State Miscellaneous
///
///
@@ -924,7 +1447,8 @@ namespace Math.Gmp.Native
/// The state of the random number generator to use.
/// The upper bound of the range.
/// The generated random number.
- ///
+ /// gmp_urandomb_ui
+ /// Random State Miscellaneous
/// GNU MP - Random State Miscellaneous
///
///
@@ -975,13 +1499,14 @@ namespace Math.Gmp.Native
/// The block will be the size of the string and null-terminator. The address of the block in stored to .
///
///
- /// Unlike the C library asprintf, doesn’t return -1 if there’s no more memory available,
+ /// Unlike the C library asprintf, gmp_asprintf doesn’t return -1 if there’s no more memory available,
/// it lets the current allocation function handle that.
///
///
- ///
- ///
- ///
+ /// gmp_snprintf
+ /// gmp_sprintf
+ /// gmp_vasprintf
+ /// Formatted Output Functions
/// GNU MP - Formatted Output Functions
/// GNU MP - Formatted Output Strings
///
@@ -1036,9 +1561,10 @@ namespace Math.Gmp.Native
/// Format string. See Formatted Output Strings.
/// Arguments.
/// Return the number of characters written, or -1 if an error occurred.
- ///
- ///
- ///
+ /// gmp_printf
+ /// gmp_sprintf
+ /// gmp_vfprintf
+ /// Formatted Output Functions
/// GNU MP - Formatted Output Functions
/// GNU MP - Formatted Output Strings
///
@@ -1106,9 +1632,10 @@ namespace Math.Gmp.Native
/// Format string. See Formatted Output Strings.
/// Arguments.
/// Return the number of characters written, or -1 if an error occurred.
- ///
- ///
- ///
+ /// gmp_fprintf
+ /// gmp_sprintf
+ /// gmp_vprintf
+ /// Formatted Output Functions
/// GNU MP - Formatted Output Functions
/// GNU MP - Formatted Output Strings
///
@@ -1165,9 +1692,10 @@ namespace Math.Gmp.Native
/// Notice the return value is in ISO C99 snprintf style. This is so even if the C library vsnprintf is the older GLIBC 2.0.x style.
///
///
- ///
- ///
- ///
+ /// gmp_asprintf
+ /// gmp_sprintf
+ /// gmp_vsnprintf
+ /// Formatted Output Functions
/// GNU MP - Formatted Output Functions
/// GNU MP - Formatted Output Strings
///
@@ -1230,11 +1758,12 @@ namespace Math.Gmp.Native
/// These functions are not recommended, since there’s no protection against exceeding the space available at .
///
///
- ///
- ///
- ///
- ///
- ///
+ /// gmp_asprintf
+ /// gmp_printf
+ /// gmp_fprintf
+ /// gmp_snprintf
+ /// gmp_vsprintf
+ /// Formatted Output Functions
/// GNU MP - Formatted Output Functions
/// GNU MP - Formatted Output Strings
///
@@ -1294,11 +1823,12 @@ namespace Math.Gmp.Native
/// The block will be the size of the string and null-terminator. The address of the block in stored to .
///
///
- /// Unlike the C library vasprintf, doesn’t return -1 if there’s no more memory available,
+ /// Unlike the C library vasprintf, gmp_vasprintf doesn’t return -1 if there’s no more memory available,
/// it lets the current allocation function handle that.
///
///
- ///
+ /// gmp_asprintf
+ /// Formatted Output Functions
/// GNU MP - Formatted Output Functions
/// GNU MP - Formatted Output Strings
///
@@ -1361,7 +1891,8 @@ namespace Math.Gmp.Native
/// Format string. See Formatted Output Strings.
/// Arguments.
/// Return the number of characters written, or -1 if an error occurred.
- ///
+ /// gmp_fprintf
+ /// Formatted Output Functions
/// GNU MP - Formatted Output Functions
/// GNU MP - Formatted Output Strings
///
@@ -1426,7 +1957,8 @@ namespace Math.Gmp.Native
/// Format string. See Formatted Output Strings.
/// Arguments.
/// Return the number of characters written, or -1 if an error occurred.
- ///
+ /// gmp_printf
+ /// Formatted Output Functions
/// GNU MP - Formatted Output Functions
/// GNU MP - Formatted Output Strings
///
@@ -1490,7 +2022,8 @@ namespace Math.Gmp.Native
/// Notice the return value is in ISO C99 snprintf style. This is so even if the C library vsnprintf is the older GLIBC 2.0.x style.
///
///
- ///
+ /// gmp_snprintf
+ /// Formatted Output Functions
/// GNU MP - Formatted Output Functions
/// GNU MP - Formatted Output Strings
///
@@ -1565,7 +2098,8 @@ namespace Math.Gmp.Native
/// These functions are not recommended, since there’s no protection against exceeding the space available at .
///
///
- ///
+ /// gmp_sprintf
+ /// Formatted Output Functions
/// GNU MP - Formatted Output Functions
/// GNU MP - Formatted Output Strings
///
@@ -1632,9 +2166,10 @@ namespace Math.Gmp.Native
/// Format string. See Formatted Input Strings.
/// Arguments.
/// The return value the number of fields successfully parsed and stored. ‘%n’ fields and fields read but suppressed by ‘*’ don’t count towards the return value.
- ///
- ///
- ///
+ /// gmp_scanf
+ /// gmp_sscanf
+ /// gmp_vfscanf
+ /// Formatted Input Functions
/// GNU MP - Formatted Input Functions
/// GNU MP - Formatted Input Strings
///
@@ -1712,9 +2247,10 @@ namespace Math.Gmp.Native
/// Format string. See Formatted Input Strings.
/// Arguments.
/// The return value the number of fields successfully parsed and stored. ‘%n’ fields and fields read but suppressed by ‘*’ don’t count towards the return value.
- ///
- ///
- ///
+ /// gmp_fscanf
+ /// gmp_sscanf
+ /// gmp_vscanf
+ /// Formatted Input Functions
/// GNU MP - Formatted Input Functions
/// GNU MP - Formatted Input Strings
///
@@ -1779,9 +2315,10 @@ namespace Math.Gmp.Native
/// Format string. See Formatted Input Strings.
/// Arguments.
/// The return value the number of fields successfully parsed and stored. ‘%n’ fields and fields read but suppressed by ‘*’ don’t count towards the return value.
- ///
- ///
- ///
+ /// gmp_fscanf
+ /// gmp_scanf
+ /// gmp_vsscanf
+ /// Formatted Input Functions
/// GNU MP - Formatted Input Functions
/// GNU MP - Formatted Input Strings
///
@@ -1842,9 +2379,10 @@ namespace Math.Gmp.Native
/// Format string. See Formatted Input Strings.
/// Arguments.
/// The return value the number of fields successfully parsed and stored. ‘%n’ fields and fields read but suppressed by ‘*’ don’t count towards the return value.
- ///
- ///
- ///
+ /// gmp_fscanf
+ /// gmp_vscanf
+ /// gmp_vsscanf
+ /// Formatted Input Functions
/// GNU MP - Formatted Input Functions
/// GNU MP - Formatted Input Strings
///
@@ -1930,9 +2468,10 @@ namespace Math.Gmp.Native
/// Format string. See Formatted Input Strings.
/// Arguments.
/// The return value the number of fields successfully parsed and stored. ‘%n’ fields and fields read but suppressed by ‘*’ don’t count towards the return value.
- ///
- ///
- ///
+ /// gmp_scanf
+ /// gmp_vfscanf
+ /// gmp_vsscanf
+ /// Formatted Input Functions
/// GNU MP - Formatted Input Functions
/// GNU MP - Formatted Input Strings
///
@@ -2004,9 +2543,10 @@ namespace Math.Gmp.Native
/// Format string. See Formatted Input Strings.
/// Arguments.
/// The return value the number of fields successfully parsed and stored. ‘%n’ fields and fields read but suppressed by ‘*’ don’t count towards the return value.
- ///
- ///
- ///
+ /// gmp_sscanf
+ /// gmp_vfscanf
+ /// gmp_vscanf
+ /// Formatted Input Functions
/// GNU MP - Formatted Input Functions
/// GNU MP - Formatted Input Strings
///
@@ -2084,19 +2624,20 @@ namespace Math.Gmp.Native
/// The value in is preserved if it fits, or is set to 0 if not.
///
///
- /// is the preferred way to accomplish allocation changes like this.
- /// and are the same except that
- /// takes its size in limbs.
+ /// mpz_realloc2 is the preferred way to accomplish allocation changes like this.
+ /// mpz_realloc2 and _mpz_realloc are the same except that
+ /// _mpz_realloc takes its size in limbs.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_realloc2
+ /// mpz_getlimbn
+ /// mpz_size
+ /// mpz_limbs_read
+ /// mpz_limbs_write
+ /// mpz_limbs_modify
+ /// mpz_limbs_finish
+ /// mpz_roinit_n
+ /// Integer Special Functions
/// GNU MP - Integer Special Functions
///
///
@@ -2157,12 +2698,13 @@ namespace Math.Gmp.Native
///
/// The result integer.
/// The operand integer.
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_add
+ /// mpz_addmul
+ /// mpz_mul
+ /// mpz_neg
+ /// mpz_sub
+ /// mpz_submul
+ /// Integer Arithmetic
/// GNU MP - Integer Arithmetic
///
///
@@ -2215,13 +2757,14 @@ namespace Math.Gmp.Native
/// The result integer.
/// The first operand integer.
/// The second operand integer.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_abs
+ /// mpz_add_ui
+ /// mpz_addmul
+ /// mpz_mul
+ /// mpz_neg
+ /// mpz_sub
+ /// mpz_submul
+ /// Integer Arithmetic
/// GNU MP - Integer Arithmetic
///
///
@@ -2283,13 +2826,14 @@ namespace Math.Gmp.Native
/// The result integer.
/// The first operand integer.
/// The second operand integer.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_abs
+ /// mpz_add
+ /// mpz_addmul
+ /// mpz_mul
+ /// mpz_neg
+ /// mpz_sub
+ /// mpz_submul
+ /// Integer Arithmetic
/// GNU MP - Integer Arithmetic
///
///
@@ -2336,13 +2880,14 @@ namespace Math.Gmp.Native
/// The result integer.
/// The first operand integer.
/// The second operand integer.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_abs
+ /// mpz_add
+ /// mpz_addmul_ui
+ /// mpz_mul
+ /// mpz_neg
+ /// mpz_sub
+ /// mpz_submul
+ /// Integer Arithmetic
/// GNU MP - Integer Arithmetic
///
///
@@ -2404,13 +2949,14 @@ namespace Math.Gmp.Native
/// The result integer.
/// The first operand integer.
/// The second operand integer.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_abs
+ /// mpz_add
+ /// mpz_addmul
+ /// mpz_mul
+ /// mpz_neg
+ /// mpz_sub
+ /// mpz_submul
+ /// Integer Arithmetic
/// GNU MP - Integer Arithmetic
///
///
@@ -2469,17 +3015,18 @@ namespace Math.Gmp.Native
/// The least significant bit is number 0.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_ior
+ /// mpz_xor
+ /// mpz_com
+ /// mpz_popcount
+ /// mpz_hamdist
+ /// mpz_scan0
+ /// mpz_scan1
+ /// mpz_setbit
+ /// mpz_clrbit
+ /// mpz_combit
+ /// mpz_tstbit
+ /// Integer Logic and Bit Fiddling
/// GNU MP - Integer Logic and Bit Fiddling
///
///
@@ -2543,12 +3090,13 @@ namespace Math.Gmp.Native
/// The second operand integer.
///
///
- /// Negative values of n are supported by , using the identity
+ /// Negative values of n are supported by mpz_bin_ui, using the identity
/// bin(-, ) = (-1)^ * bin( + - 1, ),
/// see Knuth volume 1 section 1.2.6 part G.
///
///
- ///
+ /// mpz_bin_uiui
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -2601,7 +3149,8 @@ namespace Math.Gmp.Native
/// The result integer.
/// The first operand integer.
/// The second operand integer.
- ///
+ /// mpz_bin_ui
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -2645,20 +3194,21 @@ namespace Math.Gmp.Native
/// The result quotient integer.
/// The numerator integer.
/// The denominator integer.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_r
+ /// mpz_cdiv_qr
+ /// mpz_cdiv_q_ui
+ /// mpz_cdiv_r_ui
+ /// mpz_cdiv_qr_ui
+ /// mpz_cdiv_ui
+ /// mpz_cdiv_q_2exp
+ /// mpz_cdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -2720,20 +3270,21 @@ namespace Math.Gmp.Native
/// The result quotient integer.
/// The numerator integer.
/// The exponent of the power of two denominator.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_q
+ /// mpz_cdiv_r
+ /// mpz_cdiv_qr
+ /// mpz_cdiv_q_ui
+ /// mpz_cdiv_r_ui
+ /// mpz_cdiv_qr_ui
+ /// mpz_cdiv_ui
+ /// mpz_cdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -2787,20 +3338,21 @@ namespace Math.Gmp.Native
/// The numerator integer.
/// The denominator integer.
/// Return the remainder r = | - * |.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_q
+ /// mpz_cdiv_r
+ /// mpz_cdiv_qr
+ /// mpz_cdiv_r_ui
+ /// mpz_cdiv_qr_ui
+ /// mpz_cdiv_ui
+ /// mpz_cdiv_q_2exp
+ /// mpz_cdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -2852,20 +3404,21 @@ namespace Math.Gmp.Native
/// The result remainder integer.
/// The numerator integer.
/// The denominator integer.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_q
+ /// mpz_cdiv_r
+ /// mpz_cdiv_q_ui
+ /// mpz_cdiv_r_ui
+ /// mpz_cdiv_qr_ui
+ /// mpz_cdiv_ui
+ /// mpz_cdiv_q_2exp
+ /// mpz_cdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -2934,20 +3487,21 @@ namespace Math.Gmp.Native
/// The numerator integer.
/// The denominator integer.
/// Return | |.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_q
+ /// mpz_cdiv_r
+ /// mpz_cdiv_qr
+ /// mpz_cdiv_q_ui
+ /// mpz_cdiv_r_ui
+ /// mpz_cdiv_ui
+ /// mpz_cdiv_q_2exp
+ /// mpz_cdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -3005,20 +3559,21 @@ namespace Math.Gmp.Native
/// The result remainder integer.
/// The numerator integer.
/// The denominator integer.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_q
+ /// mpz_cdiv_qr
+ /// mpz_cdiv_q_ui
+ /// mpz_cdiv_r_ui
+ /// mpz_cdiv_qr_ui
+ /// mpz_cdiv_ui
+ /// mpz_cdiv_q_2exp
+ /// mpz_cdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -3080,20 +3635,21 @@ namespace Math.Gmp.Native
/// The result remainder integer.
/// The numerator integer.
/// The exponent of the power of two denominator.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_q
+ /// mpz_cdiv_r
+ /// mpz_cdiv_qr
+ /// mpz_cdiv_q_ui
+ /// mpz_cdiv_r_ui
+ /// mpz_cdiv_qr_ui
+ /// mpz_cdiv_ui
+ /// mpz_cdiv_q_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -3146,20 +3702,21 @@ namespace Math.Gmp.Native
/// The numerator integer.
/// The denominator integer.
/// Return | |.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_q
+ /// mpz_cdiv_r
+ /// mpz_cdiv_qr
+ /// mpz_cdiv_q_ui
+ /// mpz_cdiv_qr_ui
+ /// mpz_cdiv_ui
+ /// mpz_cdiv_q_2exp
+ /// mpz_cdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -3212,20 +3769,21 @@ namespace Math.Gmp.Native
/// The numerator integer.
/// The denominator integer.
/// The remainder | r | where r = - q * , and where q = ceiling( / ).
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_q
+ /// mpz_cdiv_r
+ /// mpz_cdiv_qr
+ /// mpz_cdiv_q_ui
+ /// mpz_cdiv_r_ui
+ /// mpz_cdiv_qr_ui
+ /// mpz_cdiv_q_2exp
+ /// mpz_cdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -3263,14 +3821,15 @@ namespace Math.Gmp.Native
/// The integer.
///
///
- /// Call this function for all variables when you are done with them.
+ /// Call this function for all mpz_t variables when you are done with them.
///
///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_clears
+ /// mpz_init
+ /// mpz_inits
+ /// mpz_init2
+ /// mpz_realloc2
+ /// Initializing Integers
/// GNU MP - Initializing Integers
///
///
@@ -3304,14 +3863,15 @@ namespace Math.Gmp.Native
}
///
- /// Free the space occupied by a NULL-terminated list of variables.
+ /// Free the space occupied by a NULL-terminated list of mpz_t variables.
///
- /// A NULL-terminated list of variables.
- ///
- ///
- ///
- ///
- ///
+ /// A NULL-terminated list of mpz_t variables.
+ /// mpz_clear
+ /// mpz_init
+ /// mpz_inits
+ /// mpz_init2
+ /// mpz_realloc2
+ /// Initializing Integers
/// GNU MP - Initializing Integers
///
///
@@ -3366,17 +3926,18 @@ namespace Math.Gmp.Native
/// The least significant bit is number 0.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_and
+ /// mpz_ior
+ /// mpz_xor
+ /// mpz_com
+ /// mpz_popcount
+ /// mpz_hamdist
+ /// mpz_scan0
+ /// mpz_scan1
+ /// mpz_setbit
+ /// mpz_combit
+ /// mpz_tstbit
+ /// Integer Logic and Bit Fiddling
/// GNU MP - Integer Logic and Bit Fiddling
///
///
@@ -3420,13 +3981,14 @@ namespace Math.Gmp.Native
/// The first operand integer.
/// The second operand integer.
/// Return a positive value if > , zero if = , or a negative value if < .
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cmp_d
+ /// mpz_cmp_si
+ /// mpz_cmp_ui
+ /// mpz_cmpabs
+ /// mpz_cmpabs_d
+ /// mpz_cmpabs_ui
+ /// mpz_sgn
+ /// Integer Comparisons
/// GNU MP - Integer Comparisons
///
///
@@ -3475,17 +4037,18 @@ namespace Math.Gmp.Native
/// Return a positive value if > , zero if = , or a negative value if < .
///
///
- /// can be called with an infinity (see or ),
- /// but results are undefined for a .
+ /// mpz_cmp_d can be called with an infinity (see double.PositiveInfinity or double.NegativeInfinity),
+ /// but results are undefined for a double.NaN.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cmp
+ /// mpz_cmp_si
+ /// mpz_cmp_ui
+ /// mpz_cmpabs
+ /// mpz_cmpabs_d
+ /// mpz_cmpabs_ui
+ /// mpz_sgn
+ /// Integer Comparisons
/// GNU MP - Integer Comparisons
///
///
@@ -3523,13 +4086,14 @@ namespace Math.Gmp.Native
/// The first operand integer.
/// The second operand integer.
/// Return a positive value if > , zero if = , or a negative value if < .
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cmp
+ /// mpz_cmp_d
+ /// mpz_cmp_ui
+ /// mpz_cmpabs
+ /// mpz_cmpabs_d
+ /// mpz_cmpabs_ui
+ /// mpz_sgn
+ /// Integer Comparisons
/// GNU MP - Integer Comparisons
///
///
@@ -3567,12 +4131,13 @@ namespace Math.Gmp.Native
/// The first operand integer.
/// The second operand integer.
/// Return a positive value if > , zero if = , or a negative value if < .
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cmp
+ /// mpz_cmp_d
+ /// mpz_cmp_si
+ /// mpz_cmpabs
+ /// mpz_cmpabs_d
+ /// mpz_sgn
+ /// Integer Comparisons
/// GNU MP - Integer Comparisons
///
///
@@ -3610,13 +4175,14 @@ namespace Math.Gmp.Native
/// The first operand integer.
/// The second operand integer.
/// Return a positive value if | | > | |, zero if | | = | |, or a negative value if | | < | |.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cmp
+ /// mpz_cmp_d
+ /// mpz_cmp_si
+ /// mpz_cmp_ui
+ /// mpz_cmpabs_d
+ /// mpz_cmpabs_ui
+ /// mpz_sgn
+ /// Integer Comparisons
/// GNU MP - Integer Comparisons
///
///
@@ -3665,17 +4231,18 @@ namespace Math.Gmp.Native
/// Return a positive value if | | > | |, zero if | | = | |, or a negative value if | | < | |.
///
///
- /// can be called with an infinity (see or ),
- /// but results are undefined for a .
+ /// mpz_cmpabs_d can be called with an infinity (see double.PositiveInfinity or double.NegativeInfinity),
+ /// but results are undefined for a double.NaN.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cmp
+ /// mpz_cmp_d
+ /// mpz_cmp_si
+ /// mpz_cmp_ui
+ /// mpz_cmpabs
+ /// mpz_cmpabs_ui
+ /// mpz_sgn
+ /// Integer Comparisons
/// GNU MP - Integer Comparisons
///
///
@@ -3713,13 +4280,14 @@ namespace Math.Gmp.Native
/// The first operand integer.
/// The second operand integer.
/// Return a positive value if | | > | |, zero if | | = | |, or a negative value if | | < | |.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cmp
+ /// mpz_cmp_d
+ /// mpz_cmp_si
+ /// mpz_cmp_ui
+ /// mpz_cmpabs
+ /// mpz_cmpabs_d
+ /// mpz_sgn
+ /// Integer Comparisons
/// GNU MP - Integer Comparisons
///
///
@@ -3753,17 +4321,18 @@ namespace Math.Gmp.Native
/// The least significant bit is number 0.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_and
+ /// mpz_ior
+ /// mpz_xor
+ /// mpz_popcount
+ /// mpz_hamdist
+ /// mpz_scan0
+ /// mpz_scan1
+ /// mpz_setbit
+ /// mpz_clrbit
+ /// mpz_combit
+ /// mpz_tstbit
+ /// Integer Logic and Bit Fiddling
/// GNU MP - Integer Logic and Bit Fiddling
///
///
@@ -3822,17 +4391,18 @@ namespace Math.Gmp.Native
/// The least significant bit is number 0.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_and
+ /// mpz_ior
+ /// mpz_xor
+ /// mpz_com
+ /// mpz_popcount
+ /// mpz_hamdist
+ /// mpz_scan0
+ /// mpz_scan1
+ /// mpz_setbit
+ /// mpz_clrbit
+ /// mpz_tstbit
+ /// Integer Logic and Bit Fiddling
/// GNU MP - Integer Logic and Bit Fiddling
///
///
@@ -3884,14 +4454,15 @@ namespace Math.Gmp.Native
/// that and are considered congruent mod 0 only when exactly equal.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_congruent_2exp_p
+ /// mpz_congruent_ui_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -3954,14 +4525,15 @@ namespace Math.Gmp.Native
/// satisfying = + q * 2^.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_congruent_p
+ /// mpz_congruent_ui_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -4017,14 +4589,15 @@ namespace Math.Gmp.Native
/// that and are considered congruent mod 0 only when exactly equal.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_congruent_2exp_p
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -4062,13 +4635,14 @@ namespace Math.Gmp.Native
/// The result quotient integer.
/// The numerator integer.
/// The denominator integer.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_congruent_p
+ /// mpz_divexact_ui
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -4130,13 +4704,14 @@ namespace Math.Gmp.Native
/// The result quotient integer.
/// The numerator integer.
/// The denominator integer.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -4197,14 +4772,15 @@ namespace Math.Gmp.Native
/// considered divisible by 0.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_2exp_p
+ /// mpz_divisible_ui_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -4259,14 +4835,15 @@ namespace Math.Gmp.Native
/// considered divisible by 0.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_2exp_p
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -4310,14 +4887,15 @@ namespace Math.Gmp.Native
/// satisfying = q * 2^.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_divisible_ui_p
+ /// mpz_fdiv_qr
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -4352,14 +4930,15 @@ namespace Math.Gmp.Native
///
/// The operand integer.
/// Return non-zero if even, zero if odd.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_fits_ulong_p
+ /// mpz_fits_slong_p
+ /// mpz_fits_uint_p
+ /// mpz_fits_sint_p
+ /// mpz_fits_ushort_p
+ /// mpz_fits_sshort_p
+ /// mpz_odd_p
+ /// mpz_sizeinbase
+ /// Miscellaneous Integer Functions
/// GNU MP - Miscellaneous Integer Functions
///
///
@@ -4428,7 +5007,7 @@ namespace Math.Gmp.Native
///
///
/// The sign of is ignored, just the absolute value is exported.
- /// An application can use to get the sign and handle it as desired.
+ /// An application can use mpz_sgn to get the sign and handle it as desired.
/// (see GNU MP - Integer Comparisons)
///
///
@@ -4436,7 +5015,7 @@ namespace Math.Gmp.Native
///
///
/// When an application is allocating space itself the required size can be determined with a calculation like the following.
- /// Since always returns at least 1, count here will be at least one, which avoids any portability
+ /// Since mpz_sizeinbase always returns at least 1, count here will be at least one, which avoids any portability
/// problems with malloc(0), though if z is zero no space at all is actually needed (or written).
///
///
@@ -4445,7 +5024,8 @@ namespace Math.Gmp.Native
/// p = malloc(count * size);
///
///
- ///
+ /// mpz_import
+ /// Integer Import and Export
/// GNU MP - Integer Import and Export
///
///
@@ -4567,7 +5147,7 @@ namespace Math.Gmp.Native
///
///
/// The sign of is ignored, just the absolute value is exported.
- /// An application can use to get the sign and handle it as desired.
+ /// An application can use mpz_sgn to get the sign and handle it as desired.
/// (see GNU MP - Integer Comparisons)
///
///
@@ -4575,7 +5155,7 @@ namespace Math.Gmp.Native
///
///
/// When an application is allocating space itself the required size can be determined with a calculation like the following.
- /// Since always returns at least 1, count here will be at least one, which avoids any portability
+ /// Since mpz_sizeinbase always returns at least 1, count here will be at least one, which avoids any portability
/// problems with malloc(0), though if z is zero no space at all is actually needed (or written).
///
///
@@ -4584,7 +5164,8 @@ namespace Math.Gmp.Native
/// p = malloc(count * size);
///
///
- ///
+ /// mpz_import
+ /// Integer Import and Export
/// GNU MP - Integer Import and Export
///
///
@@ -4677,8 +5258,9 @@ namespace Math.Gmp.Native
///
/// The result integer.
/// The operand integer.
- ///
- ///
+ /// mpz_2fac_ui
+ /// mpz_mfac_uiui
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -4721,8 +5303,9 @@ namespace Math.Gmp.Native
///
/// The result integer.
/// The operand integer.
- ///
- ///
+ /// mpz_fac_ui
+ /// mpz_mfac_uiui
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -4766,8 +5349,9 @@ namespace Math.Gmp.Native
/// The result integer.
/// The first operand integer.
/// The second operand integer.
- ///
- ///
+ /// mpz_fac_ui
+ /// mpz_2fac_ui
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -4810,6 +5394,7 @@ namespace Math.Gmp.Native
///
/// The result integer.
/// The operand integer.
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -4853,20 +5438,21 @@ namespace Math.Gmp.Native
/// The result quotient integer.
/// The numerator integer.
/// The denominator integer.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_fdiv_r
+ /// mpz_fdiv_qr
+ /// mpz_fdiv_q_ui
+ /// mpz_fdiv_r_ui
+ /// mpz_fdiv_qr_ui
+ /// mpz_fdiv_ui
+ /// mpz_fdiv_q_2exp
+ /// mpz_fdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -4928,20 +5514,21 @@ namespace Math.Gmp.Native
/// The result quotient integer.
/// The numerator integer.
/// The exponent of the power of two denominator.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_fdiv_q
+ /// mpz_fdiv_r
+ /// mpz_fdiv_qr
+ /// mpz_fdiv_q_ui
+ /// mpz_fdiv_r_ui
+ /// mpz_fdiv_qr_ui
+ /// mpz_fdiv_ui
+ /// mpz_fdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -4995,19 +5582,20 @@ namespace Math.Gmp.Native
/// The numerator integer.
/// The denominator integer.
/// Return the remainder r = | - * |.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_fdiv_r
+ /// mpz_fdiv_qr
+ /// mpz_fdiv_r_ui
+ /// mpz_fdiv_qr_ui
+ /// mpz_fdiv_ui
+ /// mpz_fdiv_q_2exp
+ /// mpz_fdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -5059,20 +5647,21 @@ namespace Math.Gmp.Native
/// The result remainder integer.
/// The numerator integer.
/// The denominator integer.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_fdiv_q
+ /// mpz_fdiv_r
+ /// mpz_fdiv_q_ui
+ /// mpz_fdiv_r_ui
+ /// mpz_fdiv_qr_ui
+ /// mpz_fdiv_ui
+ /// mpz_fdiv_q_2exp
+ /// mpz_fdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -5141,20 +5730,21 @@ namespace Math.Gmp.Native
/// The numerator integer.
/// The denominator integer.
/// Return | |.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_fdiv_q
+ /// mpz_fdiv_r
+ /// mpz_fdiv_qr
+ /// mpz_fdiv_q_ui
+ /// mpz_fdiv_r_ui
+ /// mpz_fdiv_ui
+ /// mpz_fdiv_q_2exp
+ /// mpz_fdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -5212,20 +5802,21 @@ namespace Math.Gmp.Native
/// The result remainder integer.
/// The numerator integer.
/// The denominator integer.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_fdiv_q
+ /// mpz_fdiv_qr
+ /// mpz_fdiv_q_ui
+ /// mpz_fdiv_r_ui
+ /// mpz_fdiv_qr_ui
+ /// mpz_fdiv_ui
+ /// mpz_fdiv_q_2exp
+ /// mpz_fdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -5286,20 +5877,21 @@ namespace Math.Gmp.Native
/// The result remainder integer.
/// The numerator integer.
/// The exponent of the power of two denominator.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_fdiv_q
+ /// mpz_fdiv_r
+ /// mpz_fdiv_qr
+ /// mpz_fdiv_q_ui
+ /// mpz_fdiv_r_ui
+ /// mpz_fdiv_qr_ui
+ /// mpz_fdiv_ui
+ /// mpz_fdiv_q_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -5353,20 +5945,21 @@ namespace Math.Gmp.Native
/// The numerator integer.
/// The denominator integer.
/// Return | |.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_fdiv_q
+ /// mpz_fdiv_r
+ /// mpz_fdiv_qr
+ /// mpz_fdiv_q_ui
+ /// mpz_fdiv_qr_ui
+ /// mpz_fdiv_ui
+ /// mpz_fdiv_q_2exp
+ /// mpz_fdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -5420,20 +6013,21 @@ namespace Math.Gmp.Native
/// The numerator integer.
/// The denominator integer.
/// The remainder | r | where r = - q * , and where q = floor( / ).
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_fdiv_q
+ /// mpz_fdiv_r
+ /// mpz_fdiv_qr
+ /// mpz_fdiv_q_ui
+ /// mpz_fdiv_r_ui
+ /// mpz_fdiv_qr_ui
+ /// mpz_fdiv_q_2exp
+ /// mpz_fdiv_r_2exp
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_mod
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -5473,13 +6067,14 @@ namespace Math.Gmp.Native
///
///
/// The Fibonacci numbers and Lucas numbers are related sequences, so it’s never necessary to call both
- /// and .
+ /// mpz_fib2_ui and mpz_lucnum2_ui.
/// The formulas for going from Fibonacci to Lucas can be found in
/// GNU MP - Lucas Numbers Algorithm,
/// the reverse is straightforward too.
///
///
- ///
+ /// mpz_fib2_ui
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -5526,18 +6121,19 @@ namespace Math.Gmp.Native
///
///
/// This function is designed for calculating isolated Fibonacci numbers.
- /// When a sequence of values is wanted it’s best to start with
+ /// When a sequence of values is wanted it’s best to start with mpz_fib2_ui
/// and iterate the defining F[n + 1] = F[n] + F[n - 1] or similar.
///
///
/// The Fibonacci numbers and Lucas numbers are related sequences, so it’s never necessary to call both
- /// and .
+ /// mpz_fib2_ui and mpz_lucnum2_ui.
/// The formulas for going from Fibonacci to Lucas can be found in
/// GNU MP - Lucas Numbers Algorithm,
/// the reverse is straightforward too.
///
///
- ///
+ /// mpz_fib_ui
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -5585,14 +6181,15 @@ namespace Math.Gmp.Native
///
/// The operand integer.
/// Return non-zero iff the value of fits in a signed 32-bit integer. Otherwise, return zero.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_fits_ulong_p
+ /// mpz_fits_slong_p
+ /// mpz_fits_uint_p
+ /// mpz_fits_ushort_p
+ /// mpz_fits_sshort_p
+ /// mpz_odd_p
+ /// mpz_even_p
+ /// mpz_sizeinbase
+ /// Miscellaneous Integer Functions
/// GNU MP - Miscellaneous Integer Functions
///
///
@@ -5629,14 +6226,15 @@ namespace Math.Gmp.Native
///
/// The operand integer.
/// Return non-zero iff the value of fits in a signed 32-bit integer. Otherwise, return zero.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_fits_ulong_p
+ /// mpz_fits_uint_p
+ /// mpz_fits_sint_p
+ /// mpz_fits_ushort_p
+ /// mpz_fits_sshort_p
+ /// mpz_odd_p
+ /// mpz_even_p
+ /// mpz_sizeinbase
+ /// Miscellaneous Integer Functions
/// GNU MP - Miscellaneous Integer Functions
///
///
@@ -5673,14 +6271,15 @@ namespace Math.Gmp.Native
///
/// The operand integer.
/// Return non-zero iff the value of fits in a signed 16-bit integer. Otherwise, return zero.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_fits_ulong_p
+ /// mpz_fits_slong_p
+ /// mpz_fits_uint_p
+ /// mpz_fits_sint_p
+ /// mpz_fits_ushort_p
+ /// mpz_odd_p
+ /// mpz_even_p
+ /// mpz_sizeinbase
+ /// Miscellaneous Integer Functions
/// GNU MP - Miscellaneous Integer Functions
///
///
@@ -5717,14 +6316,15 @@ namespace Math.Gmp.Native
///
/// The operand integer.
/// Return non-zero iff the value of fits in an unsigned 32-bit integer. Otherwise, return zero.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_fits_ulong_p
+ /// mpz_fits_slong_p
+ /// mpz_fits_sint_p
+ /// mpz_fits_ushort_p
+ /// mpz_fits_sshort_p
+ /// mpz_odd_p
+ /// mpz_even_p
+ /// mpz_sizeinbase
+ /// Miscellaneous Integer Functions
/// GNU MP - Miscellaneous Integer Functions
///
///
@@ -5761,14 +6361,15 @@ namespace Math.Gmp.Native
///
/// The operand integer.
/// Return non-zero iff the value of fits in a signed 32-bit integer. Otherwise, return zero.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_fits_slong_p
+ /// mpz_fits_uint_p
+ /// mpz_fits_sint_p
+ /// mpz_fits_ushort_p
+ /// mpz_fits_sshort_p
+ /// mpz_odd_p
+ /// mpz_even_p
+ /// mpz_sizeinbase
+ /// Miscellaneous Integer Functions
/// GNU MP - Miscellaneous Integer Functions
///
///
@@ -5805,14 +6406,15 @@ namespace Math.Gmp.Native
///
/// The operand integer.
/// Return non-zero iff the value of fits in an unsigned 16-bit integer. Otherwise, return zero.
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_fits_ulong_p
+ /// mpz_fits_slong_p
+ /// mpz_fits_uint_p
+ /// mpz_fits_sint_p
+ /// mpz_fits_sshort_p
+ /// mpz_odd_p
+ /// mpz_even_p
+ /// mpz_sizeinbase
+ /// Miscellaneous Integer Functions
/// GNU MP - Miscellaneous Integer Functions
///
///
@@ -5856,8 +6458,9 @@ namespace Math.Gmp.Native
/// Except if both inputs are zero; then this function defines gcd(0,0) = 0.
///
///
- ///
- ///
+ /// mpz_gcd_ui
+ /// mpz_gcdext
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -5925,8 +6528,9 @@ namespace Math.Gmp.Native
/// Note that the result will always fit if is non-zero.
///
///
- ///
- ///
+ /// mpz_gcd
+ /// mpz_gcdext
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -5992,8 +6596,9 @@ namespace Math.Gmp.Native
/// If is null then that value is not computed.
///
///
- ///
- ///
+ /// mpz_gcd
+ /// mpz_gcd_ui
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -6069,10 +6674,11 @@ namespace Math.Gmp.Native
/// where available. A hardware overflow trap may or may not occur.
///
///
- ///
- ///
- ///
- ///
+ /// mpz_get_d_2exp
+ /// mpz_get_si
+ /// mpz_get_str
+ /// mpz_get_ui
+ /// Converting Integers
/// GNU MP - Converting Integers
///
///
@@ -6120,10 +6726,11 @@ namespace Math.Gmp.Native
/// This is similar to the standard C frexp function.
///
///
- ///
- ///
- ///
- ///
+ /// mpz_get_d
+ /// mpz_get_si
+ /// mpz_get_str
+ /// mpz_get_ui
+ /// Converting Integers
/// GNU MP - Converting Integers
///
///
@@ -6175,13 +6782,14 @@ namespace Math.Gmp.Native
///
///
/// If is too big to fit in a signed long int, the returned result is probably not very useful.
- /// To find out if the value will fit, use the function .
+ /// To find out if the value will fit, use the function mpz_fits_slong_p.
///
///
- ///
- ///
- ///
- ///
+ /// mpz_get_d
+ /// mpz_get_d_2exp
+ /// mpz_get_str
+ /// mpz_get_ui
+ /// Converting Integers
/// GNU MP - Converting Integers
///
///
@@ -6230,20 +6838,21 @@ namespace Math.Gmp.Native
/// significance order) are used.
///
///
- /// If is , the result string is allocated using the current
+ /// If is char_ptr.Zero, the result string is allocated using the current
/// allocation function. The block will be strlen(str)+1 bytes, that being exactly enough for the string and
/// null-terminator.
///
///
- /// If is not , it should point to a block of storage large
- /// enough for the result, that being (op, base) + 2.
+ /// If is not char_ptr.Zero, it should point to a block of storage large
+ /// enough for the result, that being mpz_sizeinbase(op, base) + 2.
/// The two extra bytes are for a possible minus sign, and the null-terminator.
///
///
- ///
- ///
- ///
- ///
+ /// mpz_get_d
+ /// mpz_get_d_2exp
+ /// mpz_get_si
+ /// mpz_get_ui
+ /// Converting Integers
/// GNU MP - Converting Integers
///
///
@@ -6291,10 +6900,11 @@ namespace Math.Gmp.Native
/// value is used.
///
///
- ///
- ///
- ///
- ///
+ /// mpz_get_d
+ /// mpz_get_d_2exp
+ /// mpz_get_si
+ /// mpz_get_str
+ /// Converting Integers
/// GNU MP - Converting Integers
///
///
@@ -6338,18 +6948,19 @@ namespace Math.Gmp.Native
/// The least significant limb is number 0.
///
///
- /// can be used to find how many limbs make up .
- /// returns zero if is outside the range 0
+ /// mpz_size can be used to find how many limbs make up .
+ /// mpz_getlimbn returns zero if is outside the range 0
/// to mpz_size() - 1.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// _mpz_realloc
+ /// mpz_size
+ /// mpz_limbs_read
+ /// mpz_limbs_write
+ /// mpz_limbs_modify
+ /// mpz_limbs_finish
+ /// mpz_roinit_n
+ /// Integer Special Functions
/// GNU MP - Integer Special Functions
///
///
@@ -6417,24 +7028,25 @@ namespace Math.Gmp.Native
/// return the hamming distance between the two operands, which is the number of bit positions where
/// and have different bit values. If one operand is
/// ≥ 0 and the other < 0 then the number of bits different is infinite, and the
- /// return value is the largest possible .
+ /// return value is the largest possible mp_bitcnt_t.
///
///
/// The function behaves as if twos complement arithmetic were used (although sign-magnitude is the actual implementation).
/// The least significant bit is number 0.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_and
+ /// mpz_ior
+ /// mpz_xor
+ /// mpz_com
+ /// mpz_popcount
+ /// mpz_scan0
+ /// mpz_scan1
+ /// mpz_setbit
+ /// mpz_clrbit
+ /// mpz_combit
+ /// mpz_tstbit
+ /// Integer Logic and Bit Fiddling
/// GNU MP - Integer Logic and Bit Fiddling
///
///
@@ -6495,7 +7107,7 @@ namespace Math.Gmp.Native
///
///
/// There is no sign taken from the data, will simply be a positive integer.
- /// An application can handle any sign itself, and apply it for instance with .
+ /// An application can handle any sign itself, and apply it for instance with mpz_neg.
///
///
/// There are no data alignment restrictions on , any address is allowed.
@@ -6515,7 +7127,8 @@ namespace Math.Gmp.Native
/// The feature can account for this, by passing for instance 8 * sizeof(int) - INT_BIT.
///
///
- ///
+ /// O:Math.Gmp.Native.gmp_lib.mpz_export
+ /// Integer Import and Export
/// GNU MP - Integer Import and Export
///
///
@@ -6574,11 +7187,12 @@ namespace Math.Gmp.Native
/// Initialize , and set its value to 0.
///
/// The integer.
- ///
- ///
- ///
- ///
- ///
+ /// mpz_clear
+ /// mpz_clears
+ /// mpz_inits
+ /// mpz_init2
+ /// mpz_realloc2
+ /// Initializing Integers
/// GNU MP - Initializing Integers
///
///
@@ -6622,25 +7236,26 @@ namespace Math.Gmp.Native
/// The number of bits.
///
///
- /// Calling this function instead of or
+ /// Calling this function instead of mpz_init or mpz_inits
/// is never necessary; reallocation is handled automatically by GMP when needed.
///
///
/// While defines the initial space, will grow automatically in the normal way,
/// if necessary, for subsequent values stored.
- /// makes it possible to avoid such reallocations if a maximum size is known in advance.
+ /// mpz_init2 makes it possible to avoid such reallocations if a maximum size is known in advance.
///
///
/// In preparation for an operation, GMP often allocates one limb more than ultimately needed.
/// To make sure GMP will not perform reallocation for , you need to add the number of bits
- /// in to .
+ /// in mp_limb_t to .
///
///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_clear
+ /// mpz_clears
+ /// mpz_init
+ /// mpz_inits
+ /// mpz_realloc2
+ /// Initializing Integers
/// GNU MP - Initializing Integers
///
///
@@ -6674,14 +7289,15 @@ namespace Math.Gmp.Native
}
///
- /// Initialize a NULL-terminated list of variables, and set their values to 0.
+ /// Initialize a NULL-terminated list of mpz_t variables, and set their values to 0.
///
- /// A NULL-terminated list of variables.
- ///
- ///
- ///
- ///
- ///
+ /// A NULL-terminated list of mpz_t variables.
+ /// mpz_clear
+ /// mpz_clears
+ /// mpz_init
+ /// mpz_init2
+ /// mpz_realloc2
+ /// Initializing Integers
/// GNU MP - Initializing Integers
///
///
@@ -6730,10 +7346,11 @@ namespace Math.Gmp.Native
///
/// The destination integer.
/// The source integer.
- ///
- ///
- ///
- ///
+ /// mpz_init_set_ui
+ /// mpz_init_set_si
+ /// mpz_init_set_d
+ /// mpz_init_set_str
+ /// Simultaneous Integer Init & Assign
/// GNU MP - Combined Integer Initialization and Assignment
///
///
@@ -6785,13 +7402,14 @@ namespace Math.Gmp.Native
/// The source integer.
///
///
- /// truncate to make it an integer.
+ /// mpz_init_set_d truncate to make it an integer.
///
///
- ///
- ///
- ///
- ///
+ /// mpz_init_set
+ /// mpz_init_set_ui
+ /// mpz_init_set_si
+ /// mpz_init_set_str
+ /// Simultaneous Integer Init & Assign
/// GNU MP - Combined Integer Initialization and Assignment
///
///
@@ -6830,10 +7448,11 @@ namespace Math.Gmp.Native
///
/// The destination integer.
/// The source integer.
- ///
- ///
- ///
- ///
+ /// mpz_init_set
+ /// mpz_init_set_ui
+ /// mpz_init_set_d
+ /// mpz_init_set_str
+ /// Simultaneous Integer Init & Assign
/// GNU MP - Combined Integer Initialization and Assignment
///
///
@@ -6868,7 +7487,7 @@ namespace Math.Gmp.Native
}
///
- /// Initialize and set its value like .
+ /// Initialize and set its value like mpz_set_str.
///
/// The destination integer.
/// The source integer.
@@ -6876,13 +7495,14 @@ namespace Math.Gmp.Native
/// If the string is a correct base number, the function returns 0; if an error occurs it returns −1. is initialized even if an error occurs.
///
///
- /// See for details.
+ /// See mpz_set_str for details.
///
///
- ///
- ///
- ///
- ///
+ /// mpz_init_set
+ /// mpz_init_set_ui
+ /// mpz_init_set_si
+ /// mpz_init_set_d
+ /// Simultaneous Integer Init & Assign
/// GNU MP - Combined Integer Initialization and Assignment
///
///
@@ -6928,10 +7548,11 @@ namespace Math.Gmp.Native
///
/// The destination integer.
/// The source integer.
- ///
- ///
- ///
- ///
+ /// mpz_init_set
+ /// mpz_init_set_si
+ /// mpz_init_set_d
+ /// mpz_init_set_str
+ /// Simultaneous Integer Init & Assign
/// GNU MP - Combined Integer Initialization and Assignment
///
///
@@ -6965,20 +7586,21 @@ namespace Math.Gmp.Native
}
///
- /// Input from stdio stream in the format written by , and put the result in .
+ /// Input from stdio stream in the format written by mpz_out_raw, and put the result in .
///
/// The result operand.
/// Pointer to file stream.
/// Return the number of bytes read, or if an error occurred, return 0.
///
///
- /// This routine can read the output from also from GMP 1,
+ /// This routine can read the output from mpz_out_raw also from GMP 1,
/// in spite of changes necessary for compatibility between 32-bit and 64-bit machines.
///
///
- ///
- ///
- ///
+ /// mpz_out_str
+ /// mpz_inp_str
+ /// mpz_out_raw
+ /// I/O of Integers
/// GNU MP - I/O of Integers
///
///
@@ -7063,9 +7685,10 @@ namespace Math.Gmp.Native
/// lower-case letter represent 36..61.
///
///
- ///
- ///
- ///
+ /// mpz_out_str
+ /// mpz_out_raw
+ /// mpz_inp_raw
+ /// I/O of Integers
/// GNU MP - I/O of Integers
///
///
@@ -7143,6 +7766,7 @@ namespace Math.Gmp.Native
/// The behaviour of this function is undefined when is zero.
///
///
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -7210,17 +7834,18 @@ namespace Math.Gmp.Native
/// The least significant bit is number 0.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_and
+ /// mpz_xor
+ /// mpz_com
+ /// mpz_popcount
+ /// mpz_hamdist
+ /// mpz_scan0
+ /// mpz_scan1
+ /// mpz_setbit
+ /// mpz_clrbit
+ /// mpz_combit
+ /// mpz_tstbit
+ /// Integer Logic and Bit Fiddling
/// GNU MP - Integer Logic and Bit Fiddling
///
///
@@ -7287,7 +7912,8 @@ namespace Math.Gmp.Native
/// This is defined only for odd.
///
///
- ///
+ /// mpz_legendre
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -7337,14 +7963,15 @@ namespace Math.Gmp.Native
///
///
/// When is odd the Jacobi symbol and Kronecker symbol are identical,
- /// so , etc. can be used for mixed precision Jacobi symbols too.
+ /// so mpz_kronecker_ui, etc. can be used for mixed precision Jacobi symbols too.
///
///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_kronecker_si
+ /// mpz_kronecker_ui
+ /// mpz_legendre
+ /// mpz_si_kronecker
+ /// mpz_ui_kronecker
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -7394,14 +8021,15 @@ namespace Math.Gmp.Native
///
///
/// When is odd the Jacobi symbol and Kronecker symbol are identical,
- /// so , etc. can be used for mixed precision Jacobi symbols too.
+ /// so mpz_kronecker_ui, etc. can be used for mixed precision Jacobi symbols too.
///
///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_kronecker
+ /// mpz_kronecker_ui
+ /// mpz_legendre
+ /// mpz_si_kronecker
+ /// mpz_ui_kronecker
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -7442,14 +8070,15 @@ namespace Math.Gmp.Native
///
///
/// When is odd the Jacobi symbol and Kronecker symbol are identical,
- /// so , etc. can be used for mixed precision Jacobi symbols too.
+ /// so mpz_kronecker_ui, etc. can be used for mixed precision Jacobi symbols too.
///
///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_kronecker
+ /// mpz_kronecker_si
+ /// mpz_legendre
+ /// mpz_si_kronecker
+ /// mpz_ui_kronecker
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -7490,14 +8119,15 @@ namespace Math.Gmp.Native
///
///
/// When is odd the Jacobi symbol and Kronecker symbol are identical,
- /// so , etc. can be used for mixed precision Jacobi symbols too.
+ /// so mpz_kronecker_ui, etc. can be used for mixed precision Jacobi symbols too.
///
///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_kronecker
+ /// mpz_kronecker_si
+ /// mpz_kronecker_ui
+ /// mpz_legendre
+ /// mpz_ui_kronecker
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -7538,14 +8168,15 @@ namespace Math.Gmp.Native
///
///
/// When is odd the Jacobi symbol and Kronecker symbol are identical,
- /// so , etc. can be used for mixed precision Jacobi symbols too.
+ /// so mpz_kronecker_ui, etc. can be used for mixed precision Jacobi symbols too.
///
///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_kronecker
+ /// mpz_kronecker_si
+ /// mpz_kronecker_ui
+ /// mpz_legendre
+ /// mpz_si_kronecker
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -7589,7 +8220,8 @@ namespace Math.Gmp.Native
/// will be zero if either or is zero.
///
///
- ///
+ /// mpz_lcm_ui
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -7657,7 +8289,8 @@ namespace Math.Gmp.Native
/// will be zero if either or is zero.
///
///
- ///
+ /// mpz_lcm
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -7684,7 +8317,8 @@ namespace Math.Gmp.Native
/// and for such it’s identical to the Jacobi symbol.
///
///
- ///
+ /// mpz_jacobi
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -7733,13 +8367,14 @@ namespace Math.Gmp.Native
///
///
/// The Fibonacci numbers and Lucas numbers are related sequences, so it’s never necessary to call both
- /// and .
+ /// mpz_fib2_ui and mpz_lucnum2_ui.
/// The formulas for going from Fibonacci to Lucas can be found in
/// GNU MP - Lucas Numbers Algorithm,
/// the reverse is straightforward too.
///
///
- ///
+ /// mpz_lucnum2_ui
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -7786,18 +8421,19 @@ namespace Math.Gmp.Native
///
///
/// This function is designed for calculating isolated Lucas numbers.
- /// When a sequence of values is wanted it’s best to start with
+ /// When a sequence of values is wanted it’s best to start with mpz_lucnum2_ui
/// and iterate the defining L[n + 1] = L[n] + L[n - 1] or similar.
///
///
/// The Fibonacci numbers and Lucas numbers are related sequences, so it’s never necessary to call both
- /// and .
+ /// mpz_fib2_ui and mpz_lucnum2_ui.
/// The formulas for going from Fibonacci to Lucas can be found in
/// GNU MP - Lucas Numbers Algorithm,
/// the reverse is straightforward too.
///
///
- ///
+ /// mpz_lucnum_ui
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -7845,7 +8481,7 @@ namespace Math.Gmp.Native
///
/// The operand integer.
/// The number of internal passes of the probabilistic algorithm.
- /// If the function returns 0 then is not prime. If it returns 1, then is 'probably' prime.
+ /// If the function mpz_millerrabin returns 0 then is not prime. If it returns 1, then is 'probably' prime.
///
///
/// The probability of a false positive is (1/4)^, where
@@ -7853,7 +8489,8 @@ namespace Math.Gmp.Native
/// Knuth indicates that 25 passes are reasonable.
///
///
- ///
+ /// mpz_probab_prime_p
+ /// Number Theoretic Functions
/// GNU MP - Number Theoretic Functions
///
///
@@ -7896,13 +8533,14 @@ namespace Math.Gmp.Native
/// The sign of the divisor is ignored; the result is always non-negative.
///
///
- ///
- ///
- ///
- ///
- ///
- ///
- ///
+ /// mpz_cdiv_qr
+ /// mpz_congruent_p
+ /// mpz_divexact
+ /// mpz_divisible_p
+ /// mpz_fdiv_qr
+ /// mpz_mod_ui
+ /// mpz_tdiv_qr
+ /// Integer Division
/// GNU MP - Integer Division
///
///
@@ -7970,17 +8608,18 @@ namespace Math.Gmp.Native
/// The sign of the divisor is ignored; the result is always non-negative.
///
///