source: git/kernel/kutil.h @ 61944d0

spielwiese
Last change on this file since 61944d0 was 6c55ae, checked in by Hans Schönemann <hannes@…>, 15 years ago
*hannes: chainCrit ->strat git-svn-id: file:///usr/local/Singular/svn/trunk@11439 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 22.4 KB
Line 
1#ifndef KUTIL_H
2#define KUTIL_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id: kutil.h,v 1.41 2009-02-22 17:37:55 Singular Exp $ */
7/*
8* ABSTRACT: kernel: utils for kStd
9*/
10
11
12#include <string.h>
13#include <mylimits.h>
14
15#include "structs.h"
16#include "omalloc.h"
17#include "ring.h"
18#include "structs.h"
19#include "pShallowCopyDelete.h"
20
21#if 1
22#define setmax 16
23#define setmaxL ((4096-12)/sizeof(LObject))
24#define setmaxLinc ((4096)/sizeof(LObject))
25
26#define setmaxT 64
27#define setmaxTinc 32
28#else
29#define setmax 16
30#define setmaxL 16
31#define setmaxLinc 16
32#define setmaxT 16
33#define setmaxTinc 16
34#endif
35
36// define if you want std computations as in Singular version < 2
37// This disbales RedThrough, tailReductions against T (bba),
38// sets posInT = posInT15 (bba, strat->honey), and enables redFirst with LDeg
39// NOTE: the same effect can be achieved with option(oldStd)
40// #define HAVE_OLD_STD
41
42#ifdef HAVE_OLD_STD
43#define K_TEST_OPT_REDTHROUGH 0
44#define K_TEST_OPT_OLDSTD 1
45#else
46#define K_TEST_OPT_REDTHROUGH TEST_OPT_REDTHROUGH
47#define K_TEST_OPT_OLDSTD     TEST_OPT_OLDSTD
48#endif
49
50#undef NO_KINLINE
51#if !defined(KDEBUG) && !defined(NO_INLINE)
52#define KINLINE inline
53#else
54#define KINLINE
55#define NO_KINLINE 1
56#endif
57
58typedef int* intset;
59typedef int64  wlen_type;
60typedef wlen_type* wlen_set;
61
62typedef class sTObject TObject;
63typedef class sLObject LObject;
64typedef TObject * TSet;
65typedef LObject * LSet;
66
67class sTObject
68{
69public:
70  poly p;       // Lm(p) \in currRing Tail(p) \in tailRing
71  poly t_p;     // t_p \in tailRing: as monomials Lm(t_p) == Lm(p)
72  poly max;     // p_GetMaxExpP(pNext(p))
73  ring tailRing;
74  long FDeg;    // pFDeg(p)
75  int ecart,
76    length,     // as of pLDeg
77    pLength,    // either == 0, or == pLength(p)
78    i_r;        // index of TObject in R set, or -1 if not in T
79  BOOLEAN is_normalized; // true, if pNorm was called on p, false otherwise
80
81  // initialization
82  KINLINE void Init(ring r = currRing);
83  KINLINE sTObject(ring tailRing = currRing);
84  KINLINE sTObject(poly p, ring tailRing = currRing);
85  KINLINE sTObject(poly p, ring c_r, ring tailRing);
86  KINLINE sTObject(sTObject* T, int copy);
87
88  KINLINE void Set(ring r=currRing);
89  KINLINE void Set(poly p_in, ring r=currRing);
90  KINLINE void Set(poly p_in, ring c_r, ring t_r);
91
92  // Frees the polys of T
93  KINLINE void Delete();
94  // Sets polys to NULL
95  KINLINE void Clear();
96  // makes a copy of the poly of T
97  KINLINE void Copy();
98
99  // ring-dependent Lm access: these might result in allocation of monomials
100  KINLINE poly GetLmCurrRing();
101  KINLINE poly GetLmTailRing();
102  KINLINE poly GetLm(ring r);
103  // this returns Lm and ring r (preferably from tailRing), but does not
104  // allocate a new poly
105  KINLINE void GetLm(poly &p, ring &r) const;
106
107#ifdef OLIVER_PRIVAT_LT
108  // routines for calc. with rings
109  KINLINE poly GetLtCurrRing();
110  KINLINE poly GetLtTailRing();
111  KINLINE poly GetLt(ring r);
112  KINLINE void GetLt(poly &p, ring &r) const;
113#endif
114
115  KINLINE BOOLEAN IsNull() const;
116
117  KINLINE int GetpLength();
118
119  // makes sure that T.p exists
120  KINLINE void SetLmCurrRing();
121
122  // Iterations
123  // simply get the next monomial
124  KINLINE poly Next();
125  KINLINE void LmDeleteAndIter();
126
127  // deg stuff
128  // computes pFDeg
129  KINLINE long pFDeg() const;
130  // computes and sets FDeg
131  KINLINE long SetpFDeg();
132  // gets stored FDeg
133  KINLINE long GetpFDeg() const;
134
135  // computes pLDeg
136  KINLINE long pLDeg();
137  // sets length, FDeg, returns LDeg
138  KINLINE long SetDegStuffReturnLDeg();
139
140  // arithmetic
141  KINLINE void Mult_nn(number n);
142  KINLINE void ShallowCopyDelete(ring new_tailRing, omBin new_tailBin,
143                                 pShallowCopyDeleteProc p_shallow_copy_delete,
144                                 BOOLEAN set_max = TRUE);
145  // manipulations
146  KINLINE void pNorm();
147  KINLINE void pCleardenom();
148
149#ifdef KDEBUG
150  void wrp();
151#endif
152};
153
154#ifndef NDEBUG
155extern int strat_nr;
156extern int strat_fac_debug;
157#endif
158
159class sLObject : public sTObject
160{
161
162public:
163  unsigned long sev;
164  poly  p1,p2; /*- the pair p comes from,
165                 lm(pi) in currRing, tail(pi) in tailring -*/
166
167  poly  lcm;   /*- the lcm of p1,p2 -*/
168  poly last;   // pLast(p) during reductions
169  kBucket_pt bucket;
170  int   i_r1, i_r2;
171
172  // initialization
173  KINLINE void Init(ring tailRing = currRing);
174  KINLINE sLObject(ring tailRing = currRing);
175  KINLINE sLObject(poly p, ring tailRing = currRing);
176  KINLINE sLObject(poly p, ring c_r, ring tailRing);
177
178  // Frees the polys of L
179  KINLINE void Delete();
180  KINLINE void Clear();
181
182  // Iterations
183  KINLINE void LmDeleteAndIter();
184  KINLINE poly LmExtractAndIter();
185
186  // spoly related things
187  // preparation for reduction if not spoly
188  KINLINE void PrepareRed(BOOLEAN use_bucket);
189  KINLINE void SetLmTail(poly lm, poly new_p, int length,
190                         int use_bucket, ring r, poly last);
191  KINLINE void Tail_Minus_mm_Mult_qq(poly m, poly qq, int lq, poly spNoether);
192  KINLINE void Tail_Mult_nn(number n);
193  // deletes bucket, makes sure that p and t_p exists
194  KINLINE poly GetP(omBin lmBin = NULL);
195  // similar, except that only t_p exists
196  KINLINE poly GetTP();
197
198  // does not delete bucket, just canonicalizes it
199  // returned poly is such that Lm(p) \in currRing, Tail(p) \in tailRing
200  KINLINE poly CanonicalizeP();
201
202  // makes a copy of the poly of L
203  KINLINE void Copy();
204  // gets the poly and makes a copy of it
205  KINLINE poly CopyGetP();
206
207  KINLINE int GetpLength();
208  KINLINE long pLDeg(BOOLEAN use_last);
209  KINLINE long pLDeg();
210  KINLINE int SetLength(BOOLEAN lengt_pLength = FALSE);
211  KINLINE long SetDegStuffReturnLDeg();
212  KINLINE long SetDegStuffReturnLDeg(BOOLEAN use_last);
213
214  // returns minimal component of p
215  KINLINE long MinComp();
216  // returns component of p
217  KINLINE long Comp();
218
219  KINLINE void ShallowCopyDelete(ring new_tailRing,
220                                 pShallowCopyDeleteProc p_shallow_copy_delete);
221
222  // sets sev
223  KINLINE void SetShortExpVector();
224
225  // enable assignment from TObject
226  KINLINE sLObject& operator=(const sTObject&);
227
228  // get T's corresponding to p1, p2: they might return NULL
229  KINLINE TObject* T_1(const skStrategy* strat);
230  KINLINE TObject* T_2(const skStrategy* strat);
231  KINLINE void     T_1_2(const skStrategy* strat,
232                         TObject* &T_1, TObject* &T_2);
233
234  // simplify coefficients
235  KINLINE void Normalize();
236  KINLINE void HeadNormalize();
237};
238
239
240extern int HCord;
241
242class skStrategy;
243typedef skStrategy * kStrategy;
244class skStrategy
245{
246public:
247  kStrategy next;
248  int (*red)(LObject * L,kStrategy strat);
249  void (*initEcart)(LObject * L);
250  int (*posInT)(const TSet T,const int tl,LObject &h);
251  int (*posInL)(const LSet set, const int length,
252                LObject* L,const kStrategy strat);
253  void (*enterS)(LObject h, int pos,kStrategy strat, int atR/* =-1*/ );
254  void (*initEcartPair)(LObject * h, poly f, poly g, int ecartF, int ecartG);
255  int (*posInLOld)(const LSet Ls,const int Ll,
256                   LObject* Lo,const kStrategy strat);
257  void (*enterOnePair) (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR /*= -1*/);
258  void (*chainCrit) (poly p,int ecart,kStrategy strat);
259  pFDegProc pOrigFDeg;
260  pLDegProc pOrigLDeg;
261  pFDegProc pOrigFDeg_TailRing;
262  pLDegProc pOrigLDeg_TailRing;
263
264  LObject P;
265  ideal Shdl;
266  ideal D; /*V(S) is in D(D)*/
267  ideal M; /*set of minimal generators*/
268  polyset S;
269  intset ecartS;
270  intset lenS;
271  wlen_set lenSw; /* for tgb.ccc */
272  intset fromQ;
273  unsigned long* sevS;
274  unsigned long* sevT;
275  TSet T;
276  LSet L;
277  LSet    B;
278  poly    kHEdge;
279  poly    kNoether;
280  poly    t_kHEdge; // same polys in tailring
281  KINLINE poly    kNoetherTail();
282  poly    t_kNoether;
283  BOOLEAN * NotUsedAxis;
284  BOOLEAN * pairtest;/*used for enterOnePair*/
285  poly tail;
286  leftv kIdeal;
287  intvec * kModW;
288  intvec * kHomW;
289  // procedure for ShalloCopy from tailRing  to currRing
290  pShallowCopyDeleteProc p_shallow_copy_delete;
291  // pointers to Tobjects R[i] is ith Tobject which is generated
292  TObject**  R;
293  // S_2_R[i] yields Tobject which corresponds to S[i]
294  int*      S_2_R;
295  ring tailRing;
296  omBin lmBin;
297  omBin tailBin;
298#ifndef NDEBUG
299  int nr;
300#endif
301  int cp,c3;
302  int cv; // in shift bases: counting V criterion
303  int sl,mu;
304  int tl,tmax;
305  int Ll,Lmax;
306  int Bl,Bmax;
307  int ak,LazyDegree,LazyPass;
308  int syzComp;
309  int HCord;
310  int lastAxis;
311  int newIdeal;
312  int minim;
313  BOOLEAN interpt;
314  BOOLEAN homog;
315#ifdef HAVE_PLURAL
316  BOOLEAN z2homog; // Z_2 - homogeneous input allows product criterion in commutative and SCA cases!
317#endif
318  BOOLEAN kHEdgeFound;
319  BOOLEAN honey,sugarCrit;
320  BOOLEAN Gebauer,noTailReduction;
321  BOOLEAN fromT;
322  BOOLEAN noetherSet;
323  BOOLEAN update;
324  BOOLEAN posInLOldFlag;
325  BOOLEAN use_buckets;
326  BOOLEAN interred_flag;
327  // if set, pLDeg(p, l) == (pFDeg(pLast(p), pLength)
328  BOOLEAN LDegLast;
329  // if set, then L.length == L.pLength
330  BOOLEAN length_pLength;
331  // if set, then posInL does not depend on L.length
332  BOOLEAN posInLDependsOnLength;
333  /*FALSE, if posInL == posInL10*/
334#ifdef HAVE_PLURAL
335  // set this flag to 1 to stop the product criteria
336  // use ALLOW_PROD_CRIT(strat) to test
337  BOOLEAN no_prod_crit;
338#define ALLOW_PROD_CRIT(A) (!(A)->no_prod_crit)
339#else
340#define ALLOW_PROD_CRIT(A) (1)
341#endif
342  char    redTailChange;
343  char    news;
344  char    newt;/*used for messageSets*/
345  char    noClearS;
346  char    completeReduce_retry;
347
348  skStrategy();
349  ~skStrategy();
350
351  // return TObject corresponding to S[i]: assume that it exists
352  // i.e. no error checking is done
353  KINLINE TObject* S_2_T(int i);
354  // like S_2_T, except that NULL is returned if it can not be found
355  KINLINE TObject* s_2_t(int i);
356};
357
358void deleteHC(poly *p, int *e, int *l, kStrategy strat);
359void deleteHC(LObject* L, kStrategy strat, BOOLEAN fromNext = FALSE);
360void deleteInS (int i,kStrategy strat);
361void cleanT (kStrategy strat);
362static inline LSet initL (int nr=setmaxL)
363{ return (LSet)omAlloc(nr*sizeof(LObject)); };
364void deleteInL(LSet set, int *length, int j,kStrategy strat);
365void enterL (LSet *set,int *length, int *LSetmax, LObject p,int at);
366void enterSBba (LObject p,int atS,kStrategy strat, int atR = -1);
367void initEcartPairBba (LObject* Lp,poly f,poly g,int ecartF,int ecartG);
368void initEcartPairMora (LObject* Lp,poly f,poly g,int ecartF,int ecartG);
369int posInS (const kStrategy strat, const int length, const poly p, 
370            const int ecart_p);
371int posInT0 (const TSet set,const int length,LObject &p);
372int posInT1 (const TSet set,const int length,LObject &p);
373int posInT2 (const TSet set,const int length,LObject &p);
374int posInT11 (const TSet set,const int length,LObject &p);
375int posInT110 (const TSet set,const int length,LObject &p);
376int posInT13 (const TSet set,const int length,LObject &p);
377int posInT15 (const TSet set,const int length,LObject &p);
378int posInT17 (const TSet set,const int length,LObject &p);
379int posInT19 (const TSet set,const int length,LObject &p);
380int posInT_EcartpLength(const TSet set,const int length,LObject &p);
381
382#ifdef HAVE_MORE_POS_IN_T
383int posInT_EcartFDegpLength(const TSet set,const int length,LObject &p);
384int posInT_FDegpLength(const TSet set,const int length,LObject &p);
385int posInT_pLength(const TSet set,const int length,LObject &p);
386#endif
387
388
389void reorderS (int* suc,kStrategy strat);
390int posInL0 (const LSet set, const int length,
391             LObject* L,const kStrategy strat);
392int posInL11 (const LSet set, const int length,
393             LObject* L,const kStrategy strat);
394int posInL13 (const LSet set, const int length,
395             LObject* L,const kStrategy strat);
396int posInL15 (const LSet set, const int length,
397             LObject* L,const kStrategy strat);
398int posInL17 (const LSet set, const int length,
399             LObject* L,const kStrategy strat);
400int posInL10 (const LSet set, const int length,
401             LObject* L,const kStrategy strat);
402KINLINE poly redtailBba (poly p,int pos,kStrategy strat,BOOLEAN normalize=FALSE);
403poly redtailBba (LObject *L, int pos,kStrategy strat,
404                 BOOLEAN withT = FALSE,BOOLEAN normalize=FALSE);
405poly redtailBba (TObject *T, int pos,kStrategy strat);
406poly redtail (poly p,int pos,kStrategy strat);
407poly redtail (LObject *L,int pos,kStrategy strat);
408poly redNF (poly h,int & max_ind,kStrategy strat);
409int redNF0 (LObject *P,kStrategy strat);
410poly redNFTail (poly h,const int sl,kStrategy strat);
411int redHoney (LObject* h, kStrategy strat);
412#ifdef HAVE_RINGS
413int redRing (LObject* h,kStrategy strat);
414void enterExtendedSpoly(poly h,kStrategy strat);
415void superenterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR = -1);
416poly kCreateZeroPoly(long exp[], long cabsind, poly* t_p, ring leadRing, ring tailRing);
417#endif
418#ifdef HAVE_RING2TOM
419long ind2(long arg);
420long ind_fact_2(long arg);
421long twoPow(long arg);
422ideal createG0();
423#endif
424int redLazy (LObject* h,kStrategy strat);
425int redHomog (LObject* h,kStrategy strat);
426void enterpairs (poly h, int k, int ec, int pos,kStrategy strat, int atR = -1);
427void entersets (LObject h);
428void pairs ();
429void message (int i,int* reduc,int* olddeg,kStrategy strat,int red_result);
430void messageStat (int srmax,int lrmax,int hilbcount,kStrategy strat);
431#ifdef KDEBUG
432void messageSets (kStrategy strat);
433#else
434#define messageSets(s)  ((void) 0)
435#endif
436
437void initEcartNormal (LObject* h);
438void initEcartBBA (LObject* h);
439void initS (ideal F, ideal Q,kStrategy strat);
440void initSL (ideal F, ideal Q,kStrategy strat);
441void updateS(BOOLEAN toT,kStrategy strat);
442void enterT (LObject p,kStrategy strat, int atT = -1);
443void cancelunit (LObject* p,BOOLEAN inNF=FALSE);
444void HEckeTest (poly pp,kStrategy strat);
445void initBuchMoraCrit(kStrategy strat);
446void initHilbCrit(ideal F, ideal Q, intvec **hilb,kStrategy strat);
447void initBuchMoraPos(kStrategy strat);
448void initBuchMora (ideal F, ideal Q,kStrategy strat);
449void exitBuchMora (kStrategy strat);
450void updateResult(ideal r,ideal Q,kStrategy strat);
451void completeReduce (kStrategy strat, BOOLEAN withT=FALSE);
452void kFreeStrat(kStrategy strat);
453void enterOnePairNormal (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR);
454void chainCritNormal (poly p,int ecart,kStrategy strat);
455BOOLEAN homogTest(polyset F, int Fmax);
456BOOLEAN newHEdge(polyset S, kStrategy strat);
457// returns index of p in TSet, or -1 if not found
458int kFindInT(poly p, TSet T, int tlength);
459
460// return -1 if no divisor is found
461//        number of first divisor, otherwise
462int kFindDivisibleByInT(const TSet &T, const unsigned long* sevT,
463                        const int tl, const LObject* L, const int start=0);
464// same with S
465int kFindDivisibleByInS(const kStrategy strat, int *max_ind, LObject* L);
466
467int kFindNextDivisibleByInS(const kStrategy strat, int start,int max_ind, LObject* L);
468TObject*
469kFindDivisibleByInS(kStrategy strat, int pos, LObject* L, TObject *T,
470                    long ecart = LONG_MAX);
471
472/***************************************************************
473 *
474 * stuff to be inlined
475 *
476 ***************************************************************/
477
478KINLINE TSet initT ();
479KINLINE TObject** initR();
480KINLINE unsigned long* initsevT();
481KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin bin);
482KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing, omBin bin);
483KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing, omBin bin);
484KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing,  omBin bin);
485
486KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing);
487KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing);
488KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing);
489KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing);
490
491// if exp bound is not violated, return TRUE and
492//                               get m1 = LCM(LM(p1), LM(p2))/LM(p1)
493//                                   m2 = LCM(LM(p1), LM(p2))/LM(p2)
494// return FALSE and m1 == NULL, m2 == NULL     , otherwise
495KINLINE BOOLEAN k_GetLeadTerms(const poly p1, const poly p2, const ring p_r,
496                               poly &m1, poly &m2, const ring m_r);
497#ifdef HAVE_RINGS
498KINLINE BOOLEAN k_GetStrongLeadTerms(const poly p1, const poly p2, const ring leadRing,
499                               poly &m1, poly &m2, poly &lcm, const ring taiRing);
500#endif
501#ifdef KDEBUG
502// test strat
503BOOLEAN kTest(kStrategy strat);
504// test strat, and test that S is contained in T
505BOOLEAN kTest_TS(kStrategy strat);
506// test LObject
507BOOLEAN kTest_L(LObject* L, ring tailRing = NULL,
508                 BOOLEAN testp = FALSE, int lpos = -1,
509                 TSet T = NULL, int tlength = -1);
510// test TObject
511BOOLEAN kTest_T(TObject* T, ring tailRing = NULL, int tpos = -1, char TN = '?');
512// test set strat->SevS
513BOOLEAN kTest_S(kStrategy strat);
514#else
515#define kTest(A)        ((void)0)
516#define kTest_TS(A)     ((void)0)
517#define kTest_T(T)      ((void)0)
518#define kTest_S(T)      ((void)0)
519#define kTest_L(T)      ((void)0)
520#endif
521
522
523/***************************************************************
524 *
525 * From kstd2.cc
526 *
527 ***************************************************************/
528poly kFindZeroPoly(poly input_p, ring leadRing, ring tailRing);
529ideal bba (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat);
530poly kNF2 (ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce);
531ideal kNF2 (ideal F,ideal Q,ideal q, kStrategy strat, int lazyReduce);
532void initBba(ideal F,kStrategy strat);
533
534/***************************************************************
535 *
536 * From kSpolys.cc
537 *
538 ***************************************************************/
539// Reduces PR with PW
540// Assumes PR != NULL, PW != NULL, Lm(PW) divides Lm(PR)
541// Changes: PR
542// Const:   PW
543// If coef != NULL, then *coef is a/gcd(a,b), where a = LC(PR), b = LC(PW)
544// If strat != NULL, tailRing is changed if reduction would violate exp bound
545// of tailRing
546// Returns: 0 everything ok, no tailRing change
547//          1 tailRing has successfully changed (strat != NULL)
548//          2 no reduction performed, tailRing needs to be changed first
549//            (strat == NULL)
550//         -1 tailRing change could not be performed due to exceeding exp
551//            bound of currRing
552int ksReducePoly(LObject* PR,
553                 TObject* PW,
554                 poly spNoether = NULL,
555                 number *coef = NULL,
556                 kStrategy strat = NULL);
557
558// Reduces PR at Current->next with PW
559// Assumes PR != NULL, Current contained in PR
560//         Current->next != NULL, LM(PW) devides LM(Current->next)
561// Changes: PR
562// Const:   PW
563// Return: see ksReducePoly
564int ksReducePolyTail(LObject* PR,
565                     TObject* PW,
566                     poly Current,
567                     poly spNoether = NULL);
568
569KINLINE int ksReducePolyTail(LObject* PR, TObject* PW, LObject* Red);
570
571// Creates S-Poly of Pair
572// Const:   Pair->p1, Pair->p2
573// Changes: Pair->p == S-Poly of p1, p2
574// Assume:  Pair->p1 != NULL && Pair->p2
575void ksCreateSpoly(LObject* Pair, poly spNoether = NULL,
576                   int use_buckets=0, ring tailRing=currRing,
577                   poly m1 = NULL, poly m2 = NULL, TObject** R = NULL);
578
579/*2
580* creates the leading term of the S-polynomial of p1 and p2
581* do not destroy p1 and p2
582* remarks:
583*   1. the coefficient is 0 (nNew)
584*   2. pNext is undefined
585*/
586poly ksCreateShortSpoly(poly p1, poly p2, ring tailRing);
587
588
589/*
590* input - output: a, b
591* returns:
592*   a := a/gcd(a,b), b := b/gcd(a,b)
593*   and return value
594*       0  ->  a != 1,  b != 1
595*       1  ->  a == 1,  b != 1
596*       2  ->  a != 1,  b == 1
597*       3  ->  a == 1,  b == 1
598*   this value is used to control the spolys
599*/
600int ksCheckCoeff(number *a, number *b);
601
602// old stuff
603KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether = NULL);
604KINLINE poly ksOldSpolyRedNew(poly p1, poly p2, poly spNoether = NULL);
605KINLINE poly ksOldCreateSpoly(poly p1, poly p2, poly spNoether = NULL, ring r = currRing);
606KINLINE void ksOldSpolyTail(poly p1, poly q, poly q2, poly spNoether, ring r = currRing);
607
608/***************************************************************
609 *
610 * Routines related for ring changes during std computations
611 *
612 ***************************************************************/
613// return TRUE and set m1, m2 to k_GetLcmTerms,
614//             if spoly creation of strat->P does not violate
615//             exponent bound of strat->tailRing
616//      FALSE, otherwise
617BOOLEAN kCheckSpolyCreation(LObject* L, kStrategy strat, poly &m1, poly &m2);
618#ifdef HAVE_RINGS
619// return TRUE if gcdpoly creation of R[atR] and S[atS] does not violate
620//             exponent bound of strat->tailRing
621//      FALSE, otherwise
622BOOLEAN kCheckStrongCreation(int atR, poly m1, int atS, poly m2, kStrategy strat);
623#endif
624// change strat->tailRing and adjust all data in strat, L, and T:
625// new tailRing has larger exponent bound
626// do nothing and return FALSE if exponent bound increase would result in
627// larger exponent bound that that of currRing
628BOOLEAN kStratChangeTailRing(kStrategy strat,
629                             LObject* L = NULL, TObject* T = NULL,
630                             // take this as new_expbound: if 0
631                             // new expbound is 2*expbound of tailRing
632                             unsigned long new_expbound = 0);
633// initiate a change of the tailRing of strat -- should be called
634// right before main loop in bba
635void kStratInitChangeTailRing(kStrategy strat);
636
637KINLINE void clearS (poly p, unsigned long p_sev, int* at, int* k,
638  kStrategy strat);
639#include "kInline.cc"
640
641/* shiftgb stuff */
642#include "shiftgb.h"
643
644poly pMove2CurrTail(poly p, kStrategy strat);
645
646poly pMoveCurrTail2poly(poly p, kStrategy strat);
647
648poly pCopyL2p(LObject h, kStrategy strat);
649
650void enterTShift(LObject p, kStrategy strat, int atT, int uptodeg, int lV);
651
652void initBuchMoraShift (ideal F,ideal Q,kStrategy strat);
653
654void enterOnePairManyShifts (int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV); // ok
655
656void enterOnePairSelfShifts (poly qq, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV);
657
658void enterOnePairShift (poly q, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int ecartq, int qisFromQ, int shiftcount, int ifromS, int uptodeg, int lV); // ok
659
660void enterpairsShift (poly h,int k,int ecart,int pos,kStrategy strat, int atR,int uptodeg, int lV);
661
662void initenterpairsShift (poly h,int k,int ecart,int isFromQ,kStrategy strat, int atR,int uptodeg, int lV); 
663
664void updateSShift(kStrategy strat,int uptodeg,int lV);
665
666void initBbaShift(ideal F,kStrategy strat);
667
668poly redtailBbaShift (LObject* L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize);
669
670int redFirstShift (LObject* h,kStrategy strat); // ok
671
672ideal freegb(ideal I, int uptodeg, int lVblock);
673
674ideal bbaShift(ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat, int uptodeg, int lV);
675#endif
Note: See TracBrowser for help on using the repository browser.