38 m_basering(rBaseRing), m_bUsePolynomial(bUsePolynomial)
204 #endif // ifdef HAVE_SUMMATOR
void sBucket_Add_p(sBucket_pt bucket, poly p, int length)
adds poly p to bucket destroys p!
union CPolynomialSummator::@5 m_temp
static int pLength(poly a)
static poly p_Copy(poly p, const ring r)
returns a copy of p
CPolynomialSummator(const ring &rBaseRing, bool bUsePolynomial=false)
#define TEST_OPT_NOT_BUCKETS
void Add(poly pSummand, int iLength)
void sBucketDestroy(sBucket_pt *bucket)
sBucket_pt sBucketCreate(ring r)
const bool m_bUsePolynomial
static void p_Delete(poly *p, const ring r)
void AddAndDelete(poly pSummand, int iLength)
CPolynomialSummator: unifies bucket and polynomial summation as the later is brocken in buckets :(...
static poly p_Add_q(poly p, poly q, const ring r)
void sBucketClearAdd(sBucket_pt bucket, poly *p, int *length)
sBucket_pt sBucketCopy(const sBucket_pt bucket)
Copy sBucket non-intrusive!!!