 |
My Project
debian-1:4.1.1-p2+ds-4
|
Go to the documentation of this file.
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)
47 ASSERT( 0,
"illegal basic domain!" );
70 ASSERT1( 0,
"illegal basic domain (type = %d)!", type );
111 ASSERT( 0,
"illegal basic domain!" );
152 ASSERT( 0,
"illegal basic domain!" );
193 ASSERT( 0,
"illegal basic domain!" );
207 ASSERT( 0,
"illegal basic domain!" );
225 return res->normalize_myself();
233 return result->normalize_myself();
static InternalCF * poly(const Variable &v, int exp, const CanonicalForm &c)
void getmpi(InternalCF *value, mpz_t mpi)
virtual class for internal CanonicalForm's
#define GaloisFieldDomain
virtual int levelcoeff() const
#define ASSERT(expression, message)
static InternalCF * int2imm(long i)
factory's class for polynomials
static InternalCF * basic(long value)
#define FiniteFieldDomain
static InternalCF * rational(long num, long den)
gmp_float exp(const gmp_float &a)
factory's class for rationals
static poly normalize(poly next_p, ideal add_generators, syStrategy syzstr, int *g_l, int *p_l, int crit_comp)
factory's class for variables
InternalCF * int2imm_p(long i)
#define LIKELY(expression)
For optimizing if-branches.
const Variable & v
< [in] a sqrfree bivariate poly
#define ASSERT1(expression, message, parameter1)
InternalCF * int2imm_gf(long i)
factory's class for integers