Go to the source code of this file.
◆ MULTIPLY_BUCKET
#define MULTIPLY_BUCKET |
( |
|
B, |
|
|
|
I |
|
) |
| |
◆ p_kBucketSetLm__T()
Definition at line 27 of file p_kBucketSetLm__T.cc.
33 DECLARE_LENGTH(
const unsigned long length =
r->ExpL_Size);
34 DECLARE_ORDSGN(
const long* ordsgn =
r->ordsgn);
40 for (
int i = 1;
i<=
bucket->buckets_used;
i++)
53 p_MemCmp__T(
bucket->buckets[
i]->exp,
p->exp, length, ordsgn,
goto Equal,
goto Greater,
goto Continue);
112 bucket->buckets_length[0] = 1;
114 kBucketAdjustBucketsUsed(
bucket);
static BOOLEAN Equal(number a, number b, const coeffs r)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
#define p_FreeBinAddr(p, r)
#define MULTIPLY_BUCKET(B, I)
#define n_Delete__T(n, r)
static bool Greater(mono_type m1, mono_type m2)