96 ASSERT( 0,
"not a valid generator" );
101 ASSERT( 0,
"not a valid generator" );
106 ASSERT( 0,
"not a valid generator" );
112 ASSERT( a.
level() < 0,
"not an algebraic extension" );
119 for (
int i = 0;
i <
n;
i++ )
125 for (
int i = 0;
i <
n;
i++ )
135 for (
int i = 0;
i <
n;
i++ )
141 for (
int i = 0;
i <
n;
i++ )
151 for (
int i = 0;
i <
n;
i++ )
156 for (
int i = 0;
i <
n;
i++ )
168 for (
int i = 0;
i <
n;
i++ )
173 for (
int i = 0;
i <
n;
i++ )
186 while ( ! stop &&
i <
n )
200 while ( ! stop &&
i <
n )
#define ASSERT(expression, message)
generate integers, elements of finite fields
generate all elements in F_p(alpha) starting from 0
CanonicalForm item() const
CFGenerator * clone() const
AlgExtGenerator & operator=(const AlgExtGenerator &)
static CFGenerator * generate()
virtual class for generators
generate all elements in F_p starting from 0
CanonicalForm item() const
CFGenerator * clone() const
generate all elements in GF starting from 0
CanonicalForm item() const
CFGenerator * clone() const
generate integers starting from 0
CFGenerator * clone() const
CanonicalForm item() const
factory's class for variables
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)