20#ifndef __GMP_BITS_PER_MP_LIMB
21#define __GMP_BITS_PER_MP_LIMB GMP_LIMB_BITS
23#include <flint/flint.h>
115 ASSERT( 0,
"not a valid random generator" );
120 ASSERT( 0,
"not a valid random generator" );
125 ASSERT( 0,
"not a valid random generator" );
139 ASSERT( v1.
level() < 0 && v2.
level() < 0 && v1 != v2,
"not an algebraic extension" );
160 for (
int i = 0;
i <
n;
i++ )
#define ASSERT(expression, message)
INST_VAR RandomGenerator ranGen
int factoryrandom(int n)
random integers with abs less than n
void factoryseed(int s)
random seed initializer
GLOBAL_VAR flint_rand_t FLINTrandom
generate random integers, random elements of finite fields
int factoryrandom(int n)
random integers with abs less than n
generate random elements in F_p(alpha)
AlgExtRandomF & operator=(const AlgExtRandomF &)
CanonicalForm generate() const
static CFRandom * generate()
virtual class for random element generation
virtual CFRandom * clone() const
virtual CanonicalForm generate() const
generate random elements in F_p
CanonicalForm generate() const
generate random elements in GF
CanonicalForm generate() const
CanonicalForm generate() const
factory's class for variables
const CanonicalForm int s
const Variable & v
< [in] a sqrfree bivariate poly
operations in a finite prime field F_p.
Operations in GF, where GF is a finite field of size less than 2^16 represented by a root of Conway p...
operations on immediates, that is elements of F_p, GF, Z, Q that fit into intrinsic int,...
InternalCF * int2imm_p(long i)
InternalCF * int2imm_gf(long i)
CanonicalForm getMipo(const Variable &alpha, const Variable &x)