source: git/kernel/kutil.h @ 4f7d76

spielwiese
Last change on this file since 4f7d76 was 4f7d76, checked in by Oleksandr Motsak <motsak@…>, 13 years ago
moved all the user-space syzygy-related stuff into a synamic module TODO: add my syz-functions aswell From: Oleksandr Motsak <motsak@mathematik.uni-kl.de> git-svn-id: file:///usr/local/Singular/svn/trunk@13983 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 22.7 KB
Line 
1#ifndef KUTIL_H
2#define KUTIL_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id$ */
7/*
8* ABSTRACT: kernel: utils for kStd
9*/
10
11
12#include <string.h>
13#include <omalloc/mylimits.h>
14
15#include <kernel/structs.h>
16#include <omalloc/omalloc.h>
17#include <kernel/ring.h>
18#include <kernel/structs.h>
19#include <kernel/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// if you want std computations as in Singular version < 2:
37// This disables RedThrough, tailReductions against T (bba),
38// sets posInT = posInT15 (bba, strat->honey), and enables redFirst with LDeg
39// NOTE: can be achieved with option(oldStd)
40
41#undef NO_KINLINE
42#if !defined(KDEBUG) && !defined(NO_INLINE)
43#define KINLINE inline
44#else
45#define KINLINE
46#define NO_KINLINE 1
47#endif
48
49typedef int* intset;
50typedef int64  wlen_type;
51typedef wlen_type* wlen_set;
52
53typedef class sTObject TObject;
54typedef class sLObject LObject;
55typedef TObject * TSet;
56typedef LObject * LSet;
57
58class sTObject
59{
60public:
61  poly p;       // Lm(p) \in currRing Tail(p) \in tailRing
62  poly t_p;     // t_p \in tailRing: as monomials Lm(t_p) == Lm(p)
63  poly max;     // p_GetMaxExpP(pNext(p))
64  ring tailRing;
65  long FDeg;    // pFDeg(p)
66  int ecart,
67    length,     // as of pLDeg
68    pLength,    // either == 0, or == pLength(p)
69    i_r;        // index of TObject in R set, or -1 if not in T
70  BOOLEAN is_normalized; // true, if pNorm was called on p, false otherwise
71
72  // initialization
73  KINLINE void Init(ring r = currRing);
74  KINLINE sTObject(ring tailRing = currRing);
75  KINLINE sTObject(poly p, ring tailRing = currRing);
76  KINLINE sTObject(poly p, ring c_r, ring tailRing);
77  KINLINE sTObject(sTObject* T, int copy);
78
79  KINLINE void Set(ring r=currRing);
80  KINLINE void Set(poly p_in, ring r=currRing);
81  KINLINE void Set(poly p_in, ring c_r, ring t_r);
82
83  // Frees the polys of T
84  KINLINE void Delete();
85  // Sets polys to NULL
86  KINLINE void Clear();
87  // makes a copy of the poly of T
88  KINLINE void Copy();
89
90  // ring-dependent Lm access: these might result in allocation of monomials
91  KINLINE poly GetLmCurrRing();
92  KINLINE poly GetLmTailRing();
93  KINLINE poly GetLm(ring r);
94  // this returns Lm and ring r (preferably from tailRing), but does not
95  // allocate a new poly
96  KINLINE void GetLm(poly &p, ring &r) const;
97
98#ifdef OLIVER_PRIVAT_LT
99  // routines for calc. with rings
100  KINLINE poly GetLtCurrRing();
101  KINLINE poly GetLtTailRing();
102  KINLINE poly GetLt(ring r);
103  KINLINE void GetLt(poly &p, ring &r) const;
104#endif
105
106  KINLINE BOOLEAN IsNull() const;
107
108  KINLINE int GetpLength();
109
110  // makes sure that T.p exists
111  KINLINE void SetLmCurrRing();
112
113  // Iterations
114  // simply get the next monomial
115  KINLINE poly Next();
116  KINLINE void LmDeleteAndIter();
117
118  // deg stuff
119  // compute pTotalDegree
120  KINLINE long pTotalDeg() const;
121  // computes pFDeg
122  KINLINE long pFDeg() const;
123  // computes and sets FDeg
124  KINLINE long SetpFDeg();
125  // gets stored FDeg
126  KINLINE long GetpFDeg() const;
127
128  // computes pLDeg
129  KINLINE long pLDeg();
130  // sets length, FDeg, returns LDeg
131  KINLINE long SetDegStuffReturnLDeg();
132
133  // arithmetic
134  KINLINE void Mult_nn(number n);
135  KINLINE void ShallowCopyDelete(ring new_tailRing, omBin new_tailBin,
136                                 pShallowCopyDeleteProc p_shallow_copy_delete,
137                                 BOOLEAN set_max = TRUE);
138  // manipulations
139  KINLINE void pNorm();
140  KINLINE void pCleardenom();
141
142#ifdef KDEBUG
143  void wrp();
144#endif
145};
146
147#ifndef NDEBUG
148extern int strat_nr;
149extern int strat_fac_debug;
150#endif
151
152class sLObject : public sTObject
153{
154
155public:
156  unsigned long sev;
157  poly  p1,p2; /*- the pair p comes from,
158                 lm(pi) in currRing, tail(pi) in tailring -*/
159
160  poly  lcm;   /*- the lcm of p1,p2 -*/
161  poly last;   // pLast(p) during reductions
162  kBucket_pt bucket;
163  int   i_r1, i_r2;
164
165  // initialization
166  KINLINE void Init(ring tailRing = currRing);
167  KINLINE sLObject(ring tailRing = currRing);
168  KINLINE sLObject(poly p, ring tailRing = currRing);
169  KINLINE sLObject(poly p, ring c_r, ring tailRing);
170
171  // Frees the polys of L
172  KINLINE void Delete();
173  KINLINE void Clear();
174
175  // Iterations
176  KINLINE void LmDeleteAndIter();
177  KINLINE poly LmExtractAndIter();
178
179  // spoly related things
180  // preparation for reduction if not spoly
181  KINLINE void PrepareRed(BOOLEAN use_bucket);
182  KINLINE void SetLmTail(poly lm, poly new_p, int length,
183                         int use_bucket, ring r, poly last);
184  KINLINE void Tail_Minus_mm_Mult_qq(poly m, poly qq, int lq, poly spNoether);
185  KINLINE void Tail_Mult_nn(number n);
186  // deletes bucket, makes sure that p and t_p exists
187  KINLINE poly GetP(omBin lmBin = NULL);
188  // similar, except that only t_p exists
189  KINLINE poly GetTP();
190
191  // does not delete bucket, just canonicalizes it
192  // returned poly is such that Lm(p) \in currRing, Tail(p) \in tailRing
193  KINLINE poly CanonicalizeP();
194
195  // makes a copy of the poly of L
196  KINLINE void Copy();
197  // gets the poly and makes a copy of it
198  KINLINE poly CopyGetP();
199
200  KINLINE int GetpLength();
201  KINLINE long pLDeg(BOOLEAN use_last);
202  KINLINE long pLDeg();
203  KINLINE int SetLength(BOOLEAN lengt_pLength = FALSE);
204  KINLINE long SetDegStuffReturnLDeg();
205  KINLINE long SetDegStuffReturnLDeg(BOOLEAN use_last);
206
207  // returns minimal component of p
208  KINLINE long MinComp();
209  // returns component of p
210  KINLINE long Comp();
211
212  KINLINE void ShallowCopyDelete(ring new_tailRing,
213                                 pShallowCopyDeleteProc p_shallow_copy_delete);
214
215  // sets sev
216  KINLINE void SetShortExpVector();
217
218  // enable assignment from TObject
219  KINLINE sLObject& operator=(const sTObject&);
220
221  // get T's corresponding to p1, p2: they might return NULL
222  KINLINE TObject* T_1(const skStrategy* strat);
223  KINLINE TObject* T_2(const skStrategy* strat);
224  KINLINE void     T_1_2(const skStrategy* strat,
225                         TObject* &T_1, TObject* &T_2);
226
227  // simplify coefficients
228  KINLINE void Normalize();
229  KINLINE void HeadNormalize();
230};
231
232
233extern int HCord;
234
235class skStrategy;
236typedef skStrategy * kStrategy;
237class skStrategy
238{
239public:
240  kStrategy next;
241  int (*red)(LObject * L,kStrategy strat);
242  void (*initEcart)(LObject * L);
243  int (*posInT)(const TSet T,const int tl,LObject &h);
244  int (*posInL)(const LSet set, const int length,
245                LObject* L,const kStrategy strat);
246  void (*enterS)(LObject h, int pos,kStrategy strat, int atR/* =-1*/ );
247  void (*initEcartPair)(LObject * h, poly f, poly g, int ecartF, int ecartG);
248  int (*posInLOld)(const LSet Ls,const int Ll,
249                   LObject* Lo,const kStrategy strat);
250  void (*enterOnePair) (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR /*= -1*/);
251  void (*chainCrit) (poly p,int ecart,kStrategy strat);
252  pFDegProc pOrigFDeg;
253  pLDegProc pOrigLDeg;
254  pFDegProc pOrigFDeg_TailRing;
255  pLDegProc pOrigLDeg_TailRing;
256
257  LObject P;
258  ideal Shdl;
259  ideal D; /*V(S) is in D(D)*/
260  ideal M; /*set of minimal generators*/
261  polyset S;
262  intset ecartS;
263  intset lenS;
264  wlen_set lenSw; /* for tgb.ccc */
265  intset fromQ;
266  unsigned long* sevS;
267  unsigned long* sevT;
268  TSet T;
269  LSet L;
270  LSet    B;
271  poly    kHEdge;
272  poly    kNoether;
273  poly    t_kHEdge; // same polys in tailring
274  KINLINE poly    kNoetherTail();
275  poly    t_kNoether;
276  BOOLEAN * NotUsedAxis;
277  BOOLEAN * pairtest;/*used for enterOnePair*/
278  poly tail;
279  leftv kIdeal;
280  intvec * kModW;
281  intvec * kHomW;
282  // procedure for ShalloCopy from tailRing  to currRing
283  pShallowCopyDeleteProc p_shallow_copy_delete;
284  // pointers to Tobjects R[i] is ith Tobject which is generated
285  TObject**  R;
286  // S_2_R[i] yields Tobject which corresponds to S[i]
287  int*      S_2_R;
288  ring tailRing;
289  omBin lmBin;
290  omBin tailBin;
291#ifndef NDEBUG
292  int nr;
293#endif
294  int cp,c3;
295  int cv; // in shift bases: counting V criterion
296  int sl,mu;
297  int tl,tmax;
298  int Ll,Lmax;
299  int Bl,Bmax;
300  int ak,LazyDegree,LazyPass;
301  int syzComp;
302  int HCord;
303  int lastAxis;
304  int newIdeal;
305  int minim;
306  #ifdef HAVE_SHIFTBBA
307  int lV;
308  #endif
309  BOOLEAN interpt;
310  BOOLEAN homog;
311#ifdef HAVE_PLURAL
312  BOOLEAN z2homog; // Z_2 - homogeneous input allows product criterion in commutative and SCA cases!
313#endif
314  BOOLEAN kHEdgeFound;
315  BOOLEAN honey,sugarCrit;
316  BOOLEAN Gebauer,noTailReduction;
317  BOOLEAN fromT;
318  BOOLEAN noetherSet;
319  BOOLEAN update;
320  BOOLEAN posInLOldFlag;
321  BOOLEAN use_buckets;
322  BOOLEAN interred_flag;
323  // if set, pLDeg(p, l) == (pFDeg(pLast(p), pLength)
324  BOOLEAN LDegLast;
325  // if set, then L.length == L.pLength
326  BOOLEAN length_pLength;
327  // if set, then posInL does not depend on L.length
328  BOOLEAN posInLDependsOnLength;
329  /*FALSE, if posInL == posInL10*/
330#ifdef HAVE_PLURAL
331  // set this flag to 1 to stop the product criteria
332  // use ALLOW_PROD_CRIT(strat) to test
333  BOOLEAN no_prod_crit;
334#define ALLOW_PROD_CRIT(A) (!(A)->no_prod_crit)
335#else
336#define ALLOW_PROD_CRIT(A) (1)
337#endif
338  char    redTailChange;
339  char    news;
340  char    newt;/*used for messageSets*/
341  char    noClearS;
342  char    completeReduce_retry;
343  char    overflow;
344
345  skStrategy();
346  ~skStrategy();
347
348  // return TObject corresponding to S[i]: assume that it exists
349  // i.e. no error checking is done
350  KINLINE TObject* S_2_T(int i);
351  // like S_2_T, except that NULL is returned if it can not be found
352  KINLINE TObject* s_2_t(int i);
353};
354
355void deleteHC(poly *p, int *e, int *l, kStrategy strat);
356void deleteHC(LObject* L, kStrategy strat, BOOLEAN fromNext = FALSE);
357void deleteInS (int i,kStrategy strat);
358void cleanT (kStrategy strat);
359static inline LSet initL (int nr=setmaxL)
360{ return (LSet)omAlloc(nr*sizeof(LObject)); };
361void deleteInL(LSet set, int *length, int j,kStrategy strat);
362void enterL (LSet *set,int *length, int *LSetmax, LObject p,int at);
363void enterSBba (LObject p,int atS,kStrategy strat, int atR = -1);
364void initEcartPairBba (LObject* Lp,poly f,poly g,int ecartF,int ecartG);
365void initEcartPairMora (LObject* Lp,poly f,poly g,int ecartF,int ecartG);
366int posInS (const kStrategy strat, const int length, const poly p, 
367            const int ecart_p);
368int posInT0 (const TSet set,const int length,LObject &p);
369int posInT1 (const TSet set,const int length,LObject &p);
370int posInT2 (const TSet set,const int length,LObject &p);
371int posInT11 (const TSet set,const int length,LObject &p);
372int posInT110 (const TSet set,const int length,LObject &p);
373int posInT13 (const TSet set,const int length,LObject &p);
374int posInT15 (const TSet set,const int length,LObject &p);
375int posInT17 (const TSet set,const int length,LObject &p);
376int posInT19 (const TSet set,const int length,LObject &p);
377int posInT_EcartpLength(const TSet set,const int length,LObject &p);
378
379#ifdef HAVE_MORE_POS_IN_T
380int posInT_EcartFDegpLength(const TSet set,const int length,LObject &p);
381int posInT_FDegpLength(const TSet set,const int length,LObject &p);
382int posInT_pLength(const TSet set,const int length,LObject &p);
383#endif
384
385
386void reorderS (int* suc,kStrategy strat);
387int posInL0 (const LSet set, const int length,
388             LObject* L,const kStrategy strat);
389int posInL11 (const LSet set, const int length,
390             LObject* L,const kStrategy strat);
391int posInL13 (const LSet set, const int length,
392             LObject* L,const kStrategy strat);
393int posInL15 (const LSet set, const int length,
394             LObject* L,const kStrategy strat);
395int posInL17 (const LSet set, const int length,
396             LObject* L,const kStrategy strat);
397int posInL10 (const LSet set, const int length,
398             LObject* L,const kStrategy strat);
399KINLINE poly redtailBba (poly p,int pos,kStrategy strat,BOOLEAN normalize=FALSE);
400#ifdef HAVE_RINGS
401KINLINE poly redtailBba_Z (poly p,int pos,kStrategy strat);
402poly redtailBba_Z (LObject* L, int pos, kStrategy strat );
403#endif
404poly redtailBba (LObject *L, int pos,kStrategy strat,
405                 BOOLEAN withT = FALSE,BOOLEAN normalize=FALSE);
406poly redtailBba (TObject *T, int pos,kStrategy strat);
407poly redtail (poly p,int pos,kStrategy strat);
408poly redtail (LObject *L,int pos,kStrategy strat);
409poly redNF (poly h,int & max_ind,int nonorm,kStrategy strat);
410int redNF0 (LObject *P,kStrategy strat);
411poly redNFTail (poly h,const int sl,kStrategy strat);
412int redHoney (LObject* h, kStrategy strat);
413#ifdef HAVE_RINGS
414int redRing (LObject* h,kStrategy strat);
415void enterExtendedSpoly(poly h,kStrategy strat);
416void superenterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR = -1);
417poly kCreateZeroPoly(long exp[], long cabsind, poly* t_p, ring leadRing, ring tailRing);
418long ind2(long arg);
419
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 void 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
637/// Output some debug info about a given strategy
638void kDebugPrint(kStrategy strat);
639
640
641KINLINE void clearS (poly p, unsigned long p_sev, int* at, int* k,
642  kStrategy strat);
643#include <kernel/kInline.cc>
644
645/* shiftgb stuff */
646#include <kernel/shiftgb.h>
647
648poly pMove2CurrTail(poly p, kStrategy strat);
649
650poly pMoveCurrTail2poly(poly p, kStrategy strat);
651
652poly pCopyL2p(LObject h, kStrategy strat);
653
654void enterTShift(LObject p, kStrategy strat, int atT, int uptodeg, int lV);
655
656void initBuchMoraShift (ideal F,ideal Q,kStrategy strat);
657
658void enterOnePairManyShifts (int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV); // ok
659
660void enterOnePairSelfShifts (poly qq, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV);
661
662void 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
663
664void enterpairsShift (poly h,int k,int ecart,int pos,kStrategy strat, int atR,int uptodeg, int lV);
665
666void initenterpairsShift (poly h,int k,int ecart,int isFromQ,kStrategy strat, int atR,int uptodeg, int lV); 
667
668void updateSShift(kStrategy strat,int uptodeg,int lV);
669
670void initBbaShift(ideal F,kStrategy strat);
671
672poly redtailBbaShift (LObject* L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize);
673
674int redFirstShift (LObject* h,kStrategy strat); // ok
675
676ideal freegb(ideal I, int uptodeg, int lVblock);
677
678ideal bbaShift(ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat, int uptodeg, int lV);
679// test syz strategy: // will be removed soon
680extern  int (*test_PosInT)(const TSet T,const int tl,LObject &h);
681extern  int (*test_PosInL)(const LSet set, const int length,
682                LObject* L,const kStrategy strat);
683#endif
Note: See TracBrowser for help on using the repository browser.