20 #define LIKELY(expression) (__builtin_expect(!!(expression), 1))
21 #define UNLIKELY(expression) (__builtin_expect(!!(expression), 0))
23 #define LIKELY(expression) (expression)
24 #define UNLIKELY(expression) (expression)
49 ASSERT( 0,
"illegal basic domain!" );
73 ASSERT1( 0,
"illegal basic domain (type = %d)!", type );
114 ASSERT( 0,
"illegal basic domain!" );
155 ASSERT( 0,
"illegal basic domain!" );
196 ASSERT( 0,
"illegal basic domain!" );
210 ASSERT( 0,
"illegal basic domain!" );
228 return res->normalize_myself();
236 return result->normalize_myself();
#define ASSERT1(expression, message, parameter1)
#define ASSERT(expression, message)
#define FiniteFieldDomain
#define GaloisFieldDomain
#define LIKELY(expression)
For optimizing if-branches.
void getmpi(InternalCF *value, mpz_t mpi)
Interface to generate InternalCF's over various domains from intrinsic types or mpz_t's.
static InternalCF * poly(const Variable &v, int exp, const CanonicalForm &c)
static InternalCF * rational(long num, long den)
static InternalCF * basic(long value)
virtual class for internal CanonicalForm's
virtual int levelcoeff() const
factory's class for integers
factory's class for polynomials
factory's class for rationals
factory's class for variables
const Variable & v
< [in] a sqrfree bivariate poly
operations on immediates, that is elements of F_p, GF, Z, Q that fit into intrinsic int,...
InternalCF * int2imm_p(long i)
static InternalCF * int2imm(long i)
InternalCF * int2imm_gf(long i)
Factory's internal CanonicalForm's.
Factory's internal integers.
Factory's internal polynomials.
Factory's internal rationals.
gmp_float exp(const gmp_float &a)
static poly normalize(poly next_p, ideal add_generators, syStrategy syzstr, int *g_l, int *p_l, int crit_comp)