p_Mult_q.h
Go to the documentation of this file.
1 /****************************************
2 * Computer Algebra System SINGULAR *
3 ****************************************/
4 /***************************************************************
5  * File: p_Mult_q.h
6  * Purpose: declaration of some auxillary routines for
7  * p_Mult_q
8  * Author: obachman (Olaf Bachmann)
9  * Created: 8/00
10  *******************************************************************/
11 
12 #ifndef P_MULT_Q_H
13 #define P_MULT_Q_H
14 
15 #include "misc/auxiliary.h"
16 #include "polys/monomials/ring.h"
17 
18 // Use buckets if min(pLength(p), pLength(q)) >= MIN_LENGTH_BUCKET
19 // Not thoroughly tested what is best
20 #ifndef MIN_LENGTH_BUCKET
21 #define MIN_LENGTH_BUCKET 10
22 #endif
23 
24 // Use factroy if min(pLength(p), pLength(q)) >= MIN_LENGTH_FACTORY
25 // Not thoroughly tested what is best
26 #ifndef MIN_LENGTH_FACTORY
27 #define MIN_LENGTH_FACTORY 1000
28 #endif
29 
30 // return TRUE and lp == pLength(p), lq == pLength(q),
31 // if min(pLength(p), pLength(q)) >= min
32 // FALSE if min(pLength(p), pLength(q)) < min
33 // and lp >= lq if pLength(p) >= pLength(lq)
34 // lp < lq if pLength(p) < pLength(q)
35 BOOLEAN pqLength(poly p, poly q, int &lp, int &lq, const int min);
36 
37 #endif // P_MULT_Q_H
static int min(int a, int b)
Definition: fast_mult.cc:268
BOOLEAN pqLength(poly p, poly q, int &lp, int &lq, const int min)
Definition: p_Mult_q.cc:29
All the auxiliary stuff.
Definition: lq.h:39
int p
Definition: cfModGcd.cc:4019
int BOOLEAN
Definition: auxiliary.h:85