source: git/kernel/kutil.h @ d0f98e

spielwiese
Last change on this file since d0f98e was 4d43ff, checked in by Viktor Levandovskyy <levandov@…>, 16 years ago
*levandov: enhancements of shift free gb git-svn-id: file:///usr/local/Singular/svn/trunk@10607 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 21.5 KB
Line 
1#ifndef KUTIL_H
2#define KUTIL_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id: kutil.h,v 1.35 2008-02-26 23:35:31 levandov 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  pFDegProc pOrigFDeg;
258  pLDegProc pOrigLDeg;
259  pFDegProc pOrigFDeg_TailRing;
260  pLDegProc pOrigLDeg_TailRing;
261
262  LObject P;
263  ideal Shdl;
264  ideal D; /*V(S) is in D(D)*/
265  ideal M; /*set of minimal generators*/
266  polyset S;
267  intset ecartS;
268  intset lenS;
269  wlen_set lenSw; /* for tgb.ccc */
270  intset fromQ;
271  unsigned long* sevS;
272  unsigned long* sevT;
273  TSet T;
274  LSet L;
275  LSet    B;
276  poly    kHEdge;
277  poly    kNoether;
278  poly    t_kHEdge; // same polys in tailring
279  KINLINE poly    kNoetherTail();
280  poly    t_kNoether;
281  BOOLEAN * NotUsedAxis;
282  BOOLEAN * pairtest;/*used for enterOnePair*/
283  poly tail;
284  leftv kIdeal;
285  intvec * kModW;
286  intvec * kHomW;
287  // procedure for ShalloCopy from tailRing  to currRing
288  pShallowCopyDeleteProc p_shallow_copy_delete;
289  // pointers to Tobjects R[i] is ith Tobject which is generated
290  TObject**  R;
291  // S_2_R[i] yields Tobject which corresponds to S[i]
292  int*      S_2_R;
293  ring tailRing;
294  omBin lmBin;
295  omBin tailBin;
296#ifndef NDEBUG
297  int nr;
298#endif
299  int cp,c3;
300  int cv; // in shift bases: counting V criterion
301  int sl,mu;
302  int tl,tmax;
303  int Ll,Lmax;
304  int Bl,Bmax;
305  int ak,LazyDegree,LazyPass;
306  int syzComp;
307  int HCord;
308  int lastAxis;
309  int newIdeal;
310  int minim;
311  BOOLEAN interpt;
312  BOOLEAN homog;
313  BOOLEAN kHEdgeFound;
314  BOOLEAN honey,sugarCrit;
315  BOOLEAN Gebauer,noTailReduction;
316  BOOLEAN fromT;
317  BOOLEAN noetherSet;
318  BOOLEAN update;
319  BOOLEAN posInLOldFlag;
320  BOOLEAN use_buckets;
321  BOOLEAN interred_flag;
322  // if set, pLDeg(p, l) == (pFDeg(pLast(p), pLength)
323  BOOLEAN LDegLast;
324  // if set, then L.length == L.pLength
325  BOOLEAN length_pLength;
326  // if set, then posInL does not depend on L.length
327  BOOLEAN posInLDependsOnLength;
328  /*FALSE, if posInL == posInL10*/
329  char    redTailChange;
330  char    news;
331  char    newt;/*used for messageSets*/
332  char    noClearS;
333  char    completeReduce_retry;
334
335  skStrategy();
336  ~skStrategy();
337
338  // return TObject corresponding to S[i]: assume that it exists
339  // i.e. no error checking is done
340  KINLINE TObject* S_2_T(int i);
341  // like S_2_T, except that NULL is returned if it can not be found
342  KINLINE TObject* s_2_t(int i);
343};
344
345void deleteHC(poly *p, int *e, int *l, kStrategy strat);
346void deleteHC(LObject* L, kStrategy strat, BOOLEAN fromNext = FALSE);
347void deleteInS (int i,kStrategy strat);
348void cleanT (kStrategy strat);
349static inline LSet initL ()
350{ return (LSet)omAlloc(setmaxL*sizeof(LObject)); };
351void deleteInL(LSet set, int *length, int j,kStrategy strat);
352void enterL (LSet *set,int *length, int *LSetmax, LObject p,int at);
353void enterSBba (LObject p,int atS,kStrategy strat, int atR = -1);
354void initEcartPairBba (LObject* Lp,poly f,poly g,int ecartF,int ecartG);
355void initEcartPairMora (LObject* Lp,poly f,poly g,int ecartF,int ecartG);
356int posInS (const kStrategy strat, const int length, const poly p, 
357            const int ecart_p);
358int posInT0 (const TSet set,const int length,LObject &p);
359int posInT1 (const TSet set,const int length,LObject &p);
360int posInT2 (const TSet set,const int length,LObject &p);
361int posInT11 (const TSet set,const int length,LObject &p);
362int posInT110 (const TSet set,const int length,LObject &p);
363int posInT13 (const TSet set,const int length,LObject &p);
364int posInT15 (const TSet set,const int length,LObject &p);
365int posInT17 (const TSet set,const int length,LObject &p);
366int posInT19 (const TSet set,const int length,LObject &p);
367int posInT_EcartpLength(const TSet set,const int length,LObject &p);
368
369#ifdef HAVE_MORE_POS_IN_T
370int posInT_EcartFDegpLength(const TSet set,const int length,LObject &p);
371int posInT_FDegpLength(const TSet set,const int length,LObject &p);
372int posInT_pLength(const TSet set,const int length,LObject &p);
373#endif
374
375
376void reorderS (int* suc,kStrategy strat);
377int posInL0 (const LSet set, const int length,
378             LObject* L,const kStrategy strat);
379int posInL11 (const LSet set, const int length,
380             LObject* L,const kStrategy strat);
381int posInL13 (const LSet set, const int length,
382             LObject* L,const kStrategy strat);
383int posInL15 (const LSet set, const int length,
384             LObject* L,const kStrategy strat);
385int posInL17 (const LSet set, const int length,
386             LObject* L,const kStrategy strat);
387int posInL10 (const LSet set, const int length,
388             LObject* L,const kStrategy strat);
389KINLINE poly redtailBba (poly p,int pos,kStrategy strat,BOOLEAN normalize=FALSE);
390poly redtailBba (LObject *L, int pos,kStrategy strat,
391                 BOOLEAN withT = FALSE,BOOLEAN normalize=FALSE);
392poly redtailBba (TObject *T, int pos,kStrategy strat);
393poly redtail (poly p,int pos,kStrategy strat);
394poly redtail (LObject *L,int pos,kStrategy strat);
395poly redNF (poly h,int & max_ind,kStrategy strat);
396int redNF0 (LObject *P,kStrategy strat);
397poly redNFTail (poly h,const int sl,kStrategy strat);
398int redHoney (LObject* h, kStrategy strat);
399#ifdef HAVE_RINGS
400int redRing (LObject* h,kStrategy strat);
401void enterExtendedSpoly(poly h,kStrategy strat);
402void superenterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR = -1);
403poly kCreateZeroPoly(long exp[], long cabsind, poly* t_p, ring leadRing, ring tailRing);
404#endif
405#ifdef HAVE_RING2TOM
406long ind2(long arg);
407long ind_fact_2(long arg);
408long twoPow(long arg);
409ideal createG0();
410#endif
411int redLazy (LObject* h,kStrategy strat);
412int redHomog (LObject* h,kStrategy strat);
413void enterpairs (poly h, int k, int ec, int pos,kStrategy strat, int atR = -1);
414void entersets (LObject h);
415void pairs ();
416void message (int i,int* reduc,int* olddeg,kStrategy strat,int red_result);
417void messageStat (int srmax,int lrmax,int hilbcount,kStrategy strat);
418#ifdef KDEBUG
419void messageSets (kStrategy strat);
420#else
421#define messageSets(s)  ((void) 0)
422#endif
423
424void initEcartNormal (LObject* h);
425void initEcartBBA (LObject* h);
426void initS (ideal F, ideal Q,kStrategy strat);
427void initSL (ideal F, ideal Q,kStrategy strat);
428void updateS(BOOLEAN toT,kStrategy strat);
429void enterT (LObject p,kStrategy strat, int atT = -1);
430void cancelunit (LObject* p,BOOLEAN inNF=FALSE);
431void HEckeTest (poly pp,kStrategy strat);
432void initBuchMoraCrit(kStrategy strat);
433void initHilbCrit(ideal F, ideal Q, intvec **hilb,kStrategy strat);
434void initBuchMoraPos(kStrategy strat);
435void initBuchMora (ideal F, ideal Q,kStrategy strat);
436void exitBuchMora (kStrategy strat);
437void updateResult(ideal r,ideal Q,kStrategy strat);
438void completeReduce (kStrategy strat, BOOLEAN withT=FALSE);
439void kFreeStrat(kStrategy strat);
440BOOLEAN homogTest(polyset F, int Fmax);
441BOOLEAN newHEdge(polyset S, kStrategy strat);
442// returns index of p in TSet, or -1 if not found
443int kFindInT(poly p, TSet T, int tlength);
444
445// return -1 if no divisor is found
446//        number of first divisor, otherwise
447int kFindDivisibleByInT(const TSet &T, const unsigned long* sevT,
448                        const int tl, const LObject* L, const int start=0);
449// same with S
450int kFindDivisibleByInS(const kStrategy strat, int *max_ind, LObject* L);
451
452int kFindNextDivisibleByInS(const kStrategy strat, int start,int max_ind, LObject* L);
453TObject*
454kFindDivisibleByInS(kStrategy strat, int pos, LObject* L, TObject *T,
455                    long ecart = LONG_MAX);
456
457/***************************************************************
458 *
459 * stuff to be inlined
460 *
461 ***************************************************************/
462
463KINLINE TSet initT ();
464KINLINE TObject** initR();
465KINLINE unsigned long* initsevT();
466KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin bin);
467KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing, omBin bin);
468KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing, omBin bin);
469KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing,  omBin bin);
470
471KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing);
472KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing);
473KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing);
474KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing);
475
476// if exp bound is not violated, return TRUE and
477//                               get m1 = LCM(LM(p1), LM(p2))/LM(p1)
478//                                   m2 = LCM(LM(p1), LM(p2))/LM(p2)
479// return FALSE and m1 == NULL, m2 == NULL     , otherwise
480KINLINE BOOLEAN k_GetLeadTerms(const poly p1, const poly p2, const ring p_r,
481                               poly &m1, poly &m2, const ring m_r);
482#ifdef HAVE_RINGS
483KINLINE BOOLEAN k_GetStrongLeadTerms(const poly p1, const poly p2, const ring leadRing,
484                               poly &m1, poly &m2, poly &lcm, const ring taiRing);
485#endif
486#ifdef KDEBUG
487// test strat
488BOOLEAN kTest(kStrategy strat);
489// test strat, and test that S is contained in T
490BOOLEAN kTest_TS(kStrategy strat);
491// test LObject
492BOOLEAN kTest_L(LObject* L, ring tailRing = NULL,
493                 BOOLEAN testp = FALSE, int lpos = -1,
494                 TSet T = NULL, int tlength = -1);
495// test TObject
496BOOLEAN kTest_T(TObject* T, ring tailRing = NULL, int tpos = -1, char TN = '?');
497// test set strat->SevS
498BOOLEAN kTest_S(kStrategy strat);
499#else
500#define kTest(A)        ((void)0)
501#define kTest_TS(A)     ((void)0)
502#define kTest_T(T)      ((void)0)
503#define kTest_S(T)      ((void)0)
504#define kTest_L(T)      ((void)0)
505#endif
506
507
508/***************************************************************
509 *
510 * From kstd2.cc
511 *
512 ***************************************************************/
513poly kFindZeroPoly(poly input_p, ring leadRing, ring tailRing);
514ideal bba (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat);
515poly kNF2 (ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce);
516ideal kNF2 (ideal F,ideal Q,ideal q, kStrategy strat, int lazyReduce);
517void initBba(ideal F,kStrategy strat);
518
519/***************************************************************
520 *
521 * From kSpolys.cc
522 *
523 ***************************************************************/
524// Reduces PR with PW
525// Assumes PR != NULL, PW != NULL, Lm(PW) divides Lm(PR)
526// Changes: PR
527// Const:   PW
528// If coef != NULL, then *coef is a/gcd(a,b), where a = LC(PR), b = LC(PW)
529// If strat != NULL, tailRing is changed if reduction would violate exp bound
530// of tailRing
531// Returns: 0 everything ok, no tailRing change
532//          1 tailRing has successfully changed (strat != NULL)
533//          2 no reduction performed, tailRing needs to be changed first
534//            (strat == NULL)
535//         -1 tailRing change could not be performed due to exceeding exp
536//            bound of currRing
537int ksReducePoly(LObject* PR,
538                 TObject* PW,
539                 poly spNoether = NULL,
540                 number *coef = NULL,
541                 kStrategy strat = NULL);
542
543// Reduces PR at Current->next with PW
544// Assumes PR != NULL, Current contained in PR
545//         Current->next != NULL, LM(PW) devides LM(Current->next)
546// Changes: PR
547// Const:   PW
548// Return: see ksReducePoly
549int ksReducePolyTail(LObject* PR,
550                     TObject* PW,
551                     poly Current,
552                     poly spNoether = NULL);
553
554KINLINE int ksReducePolyTail(LObject* PR, TObject* PW, LObject* Red);
555
556// Creates S-Poly of Pair
557// Const:   Pair->p1, Pair->p2
558// Changes: Pair->p == S-Poly of p1, p2
559// Assume:  Pair->p1 != NULL && Pair->p2
560void ksCreateSpoly(LObject* Pair, poly spNoether = NULL,
561                   int use_buckets=0, ring tailRing=currRing,
562                   poly m1 = NULL, poly m2 = NULL, TObject** R = NULL);
563
564/*2
565* creates the leading term of the S-polynomial of p1 and p2
566* do not destroy p1 and p2
567* remarks:
568*   1. the coefficient is 0 (nNew)
569*   2. pNext is undefined
570*/
571poly ksCreateShortSpoly(poly p1, poly p2, ring tailRing);
572
573
574/*
575* input - output: a, b
576* returns:
577*   a := a/gcd(a,b), b := b/gcd(a,b)
578*   and return value
579*       0  ->  a != 1,  b != 1
580*       1  ->  a == 1,  b != 1
581*       2  ->  a != 1,  b == 1
582*       3  ->  a == 1,  b == 1
583*   this value is used to control the spolys
584*/
585int ksCheckCoeff(number *a, number *b);
586
587// old stuff
588KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether = NULL);
589KINLINE poly ksOldSpolyRedNew(poly p1, poly p2, poly spNoether = NULL);
590KINLINE poly ksOldCreateSpoly(poly p1, poly p2, poly spNoether = NULL, ring r = currRing);
591KINLINE void ksOldSpolyTail(poly p1, poly q, poly q2, poly spNoether, ring r = currRing);
592
593/***************************************************************
594 *
595 * Routines related for ring changes during std computations
596 *
597 ***************************************************************/
598// return TRUE and set m1, m2 to k_GetLcmTerms,
599//             if spoly creation of strat->P does not violate
600//             exponent bound of strat->tailRing
601//      FALSE, otherwise
602BOOLEAN kCheckSpolyCreation(LObject* L, kStrategy strat, poly &m1, poly &m2);
603// change strat->tailRing and adjust all data in strat, L, and T:
604// new tailRing has larger exponent bound
605// do nothing and return FALSE if exponent bound increase would result in
606// larger exponent bound that that of currRing
607BOOLEAN kStratChangeTailRing(kStrategy strat,
608                             LObject* L = NULL, TObject* T = NULL,
609                             // take this as new_expbound: if 0
610                             // new expbound is 2*expbound of tailRing
611                             unsigned long new_expbound = 0);
612// initiate a change of the tailRing of strat -- should be called
613// right before main loop in bba
614void kStratInitChangeTailRing(kStrategy strat);
615
616KINLINE void clearS (poly p, unsigned long p_sev, int* at, int* k,
617  kStrategy strat);
618#include "kInline.cc"
619
620/* shiftgb stuff */
621#include "shiftgb.h"
622
623poly pMove2CurrTail(poly p, kStrategy strat);
624
625poly pMoveCurrTail2poly(poly p, kStrategy strat);
626
627poly pCopyL2p(LObject h, kStrategy strat);
628
629void enterTShift(LObject p, kStrategy strat, int atT, int uptodeg, int lV);
630
631void initBuchMoraShift (ideal F,ideal Q,kStrategy strat);
632
633void enterOnePairManyShifts (int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV); // ok
634
635void enterOnePairSelfShifts (poly qq, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV);
636
637void 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
638
639void enterpairsShift (poly h,int k,int ecart,int pos,kStrategy strat, int atR,int uptodeg, int lV);
640
641void initenterpairsShift (poly h,int k,int ecart,int isFromQ,kStrategy strat, int atR,int uptodeg, int lV); 
642
643void updateSShift(kStrategy strat,int uptodeg,int lV);
644
645void initBbaShift(ideal F,kStrategy strat);
646
647poly redtailBbaShift (LObject* L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize);
648
649int redFirstShift (LObject* h,kStrategy strat); // ok
650
651ideal freegb(ideal I, int uptodeg, int lVblock);
652
653ideal bbaShift(ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat, int uptodeg, int lV);
654#endif
Note: See TracBrowser for help on using the repository browser.