source: git/kernel/kutil.h @ efb860

spielwiese
Last change on this file since efb860 was efb860, checked in by Hans Schönemann <hannes@…>, 17 years ago
*hannes: kFindDivisibleByInS improved git-svn-id: file:///usr/local/Singular/svn/trunk@9444 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 20.3 KB
Line 
1#ifndef KUTIL_H
2#define KUTIL_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id: kutil.h,v 1.19 2006-10-05 18:26:10 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
166  poly  lcm;   /*- the lcm of p1,p2 -*/
167  poly last;   // pLast(p) during reductions
168  kBucket_pt bucket;
169  int   i_r1, i_r2;
170
171  // initialization
172  KINLINE void Init(ring tailRing = currRing);
173  KINLINE sLObject(ring tailRing = currRing);
174  KINLINE sLObject(poly p, ring tailRing = currRing);
175  KINLINE sLObject(poly p, ring c_r, ring tailRing);
176
177  // Frees the polys of L
178  KINLINE void Delete();
179  KINLINE void Clear();
180
181  // Iterations
182  KINLINE void LmDeleteAndIter();
183  KINLINE poly LmExtractAndIter();
184
185  // spoly related things
186  // preparation for reduction if not spoly
187  KINLINE void PrepareRed(BOOLEAN use_bucket);
188  KINLINE void SetLmTail(poly lm, poly new_p, int length,
189                         int use_bucket, ring r, poly last);
190  KINLINE void Tail_Minus_mm_Mult_qq(poly m, poly qq, int lq, poly spNoether);
191  KINLINE void Tail_Mult_nn(number n);
192  // deletes bucket, makes sure that p and t_p exists
193  KINLINE poly GetP(omBin lmBin = NULL);
194  // similar, except that only t_p exists
195  KINLINE poly GetTP();
196
197  // does not delete bucket, just canonicalizes it
198  // returned poly is such that Lm(p) \in currRing, Tail(p) \in tailRing
199  KINLINE poly CanonicalizeP();
200
201  // makes a copy of the poly of L
202  KINLINE void Copy();
203  // gets the poly and makes a copy of it
204  KINLINE poly CopyGetP();
205
206  KINLINE int GetpLength();
207  KINLINE long pLDeg(BOOLEAN use_last);
208  KINLINE long pLDeg();
209  KINLINE int SetLength(BOOLEAN lengt_pLength = FALSE);
210  KINLINE long SetDegStuffReturnLDeg();
211  KINLINE long SetDegStuffReturnLDeg(BOOLEAN use_last);
212
213  // returns minimal component of p
214  KINLINE long MinComp();
215  // returns component of p
216  KINLINE long Comp();
217
218  KINLINE void ShallowCopyDelete(ring new_tailRing,
219                                 pShallowCopyDeleteProc p_shallow_copy_delete);
220
221  // sets sev
222  KINLINE void SetShortExpVector();
223
224  // enable assignment from TObject
225  KINLINE sLObject& operator=(const sTObject&);
226
227  // get T's corresponding to p1, p2: they might return NULL
228  KINLINE TObject* T_1(const skStrategy* strat);
229  KINLINE TObject* T_2(const skStrategy* strat);
230  KINLINE void     T_1_2(const skStrategy* strat,
231                         TObject* &T_1, TObject* &T_2);
232
233  // simplify coefficients
234  KINLINE void Normalize();
235  KINLINE void HeadNormalize();
236};
237
238
239extern int HCord;
240
241class skStrategy;
242typedef skStrategy * kStrategy;
243class skStrategy
244{
245public:
246  kStrategy next;
247  int (*red)(LObject * L,kStrategy strat);
248  void (*initEcart)(LObject * L);
249  int (*posInT)(const TSet T,const int tl,LObject &h);
250  int (*posInL)(const LSet set, const int length,
251                LObject* L,const kStrategy strat);
252  void (*enterS)(LObject h, int pos,kStrategy strat, int atR/* =-1*/ );
253  void (*initEcartPair)(LObject * h, poly f, poly g, int ecartF, int ecartG);
254  int (*posInLOld)(const LSet Ls,const int Ll,
255                   LObject* Lo,const kStrategy strat);
256  pFDegProc pOrigFDeg;
257  pLDegProc pOrigLDeg;
258  pFDegProc pOrigFDeg_TailRing;
259  pLDegProc pOrigLDeg_TailRing;
260
261  LObject P;
262  ideal Shdl;
263  ideal D; /*V(S) is in D(D)*/
264  ideal M; /*set of minimal generators*/
265  polyset S;
266  intset ecartS;
267  intset lenS;
268  wlen_set lenSw; /* for tgb.ccc */
269  intset fromQ;
270  unsigned long* sevS;
271  unsigned long* sevT;
272  TSet T;
273  LSet L;
274  LSet    B;
275  poly    kHEdge;
276  poly    kNoether;
277  poly    t_kHEdge; // same polys in tailring
278  KINLINE poly    kNoetherTail();
279  poly    t_kNoether;
280  BOOLEAN * NotUsedAxis;
281  BOOLEAN * pairtest;/*used for enterOnePair*/
282#ifdef HAVE_RING2TOM
283//  unsigned int * lmcomp;/*used for enterOnePairRing and chainCritRing*/
284#endif
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 sl,mu;
303  int tl,tmax;
304  int Ll,Lmax;
305  int Bl,Bmax;
306  int ak,LazyDegree,LazyPass;
307  int syzComp;
308  int HCord;
309  int lastAxis;
310  int newIdeal;
311  int minim;
312  BOOLEAN interpt;
313  BOOLEAN homog;
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  char    redTailChange;
331  char    news;
332  char    newt;/*used for messageSets*/
333  char    noClearS;
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 (kStrategy strat,int length,poly p, int ecart_p);
357int posInT0 (const TSet set,const int length,LObject &p);
358int posInT1 (const TSet set,const int length,LObject &p);
359int posInT2 (const TSet set,const int length,LObject &p);
360int posInT11 (const TSet set,const int length,LObject &p);
361int posInT110 (const TSet set,const int length,LObject &p);
362int posInT13 (const TSet set,const int length,LObject &p);
363int posInT15 (const TSet set,const int length,LObject &p);
364int posInT17 (const TSet set,const int length,LObject &p);
365int posInT19 (const TSet set,const int length,LObject &p);
366int posInT_EcartpLength(const TSet set,const int length,LObject &p);
367
368#ifdef HAVE_MORE_POS_IN_T
369int posInT_EcartFDegpLength(const TSet set,const int length,LObject &p);
370int posInT_FDegpLength(const TSet set,const int length,LObject &p);
371int posInT_pLength(const TSet set,const int length,LObject &p);
372#endif
373
374
375void reorderS (int* suc,kStrategy strat);
376int posInL0 (const LSet set, const int length,
377             LObject* L,const kStrategy strat);
378int posInL11 (const LSet set, const int length,
379             LObject* L,const kStrategy strat);
380int posInL13 (const LSet set, const int length,
381             LObject* L,const kStrategy strat);
382int posInL15 (const LSet set, const int length,
383             LObject* L,const kStrategy strat);
384int posInL17 (const LSet set, const int length,
385             LObject* L,const kStrategy strat);
386int posInL10 (const LSet set, const int length,
387             LObject* L,const kStrategy strat);
388KINLINE poly redtailBba (poly p,int pos,kStrategy strat);
389poly redtailBba (LObject *L, int pos,kStrategy strat, BOOLEAN withT = FALSE);
390poly redtailBba (TObject *T, int pos,kStrategy strat, BOOLEAN withT = FALSE);
391poly redtail (poly p,int pos,kStrategy strat);
392poly redtail (LObject *L,int pos,kStrategy strat);
393poly redNF (poly h,kStrategy strat);
394int redNF0 (LObject *P,kStrategy strat);
395poly redNFTail (poly h,const int sl,kStrategy strat);
396int redHoney (LObject* h, kStrategy strat);
397#ifdef HAVE_RING2TOM
398int redRing2toM (LObject* h,kStrategy strat);
399long ind2(long arg);
400long ind_fact_2(long arg);
401long twoPow(long arg);
402void enterExtendedSpoly(poly h,kStrategy strat);
403void superenterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR = -1);
404poly kCreateZeroPoly(long exp[], long cabsind, poly* t_p, ring leadRing, ring tailRing);
405ideal createG0();
406#endif
407int redLazy (LObject* h,kStrategy strat);
408int redHomog (LObject* h,kStrategy strat);
409void enterpairs (poly h, int k, int ec, int pos,kStrategy strat, int atR = -1);
410void entersets (LObject h);
411void pairs ();
412void message (int i,int* reduc,int* olddeg,kStrategy strat,int red_result);
413void messageStat (int srmax,int lrmax,int hilbcount,kStrategy strat);
414#ifdef KDEBUG
415void messageSets (kStrategy strat);
416#else
417#define messageSets(s)  ((void) 0)
418#endif
419
420void initEcartNormal (LObject* h);
421void initEcartBBA (LObject* h);
422void initS (ideal F, ideal Q,kStrategy strat);
423void initSL (ideal F, ideal Q,kStrategy strat);
424void updateS(BOOLEAN toT,kStrategy strat);
425void enterT (LObject p,kStrategy strat, int atT = -1);
426void cancelunit (LObject* p);
427void HEckeTest (poly pp,kStrategy strat);
428void initBuchMoraCrit(kStrategy strat);
429void initHilbCrit(ideal F, ideal Q, intvec **hilb,kStrategy strat);
430void initBuchMoraPos(kStrategy strat);
431void initBuchMora (ideal F, ideal Q,kStrategy strat);
432void exitBuchMora (kStrategy strat);
433void updateResult(ideal r,ideal Q,kStrategy strat);
434void completeReduce (kStrategy strat);
435void kFreeStrat(kStrategy strat);
436BOOLEAN homogTest(polyset F, int Fmax);
437BOOLEAN newHEdge(polyset S, kStrategy strat);
438// returns index of p in TSet, or -1 if not found
439int kFindInT(poly p, TSet T, int tlength);
440
441// return -1 if no divisor is found
442//        number of first divisor, otherwise
443int kFindDivisibleByInT(const TSet &T, const unsigned long* sevT,
444                        const int tl, const LObject* L, const int start=0);
445// same with S
446int kFindDivisibleByInS(const kStrategy strat, LObject* L);
447
448TObject*
449kFindDivisibleByInS(kStrategy strat, int pos, LObject* L, TObject *T,
450                    long ecart = LONG_MAX);
451
452/*Obsolete since changes to pLmDiv
453#ifdef HAVE_RING2TOM
454// same for rings
455int kRingFindDivisibleByInT(const TSet &T, const unsigned long* sevT,
456                        const int tl, const LObject* L, const int start=0);
457int kRingFindDivisibleByInS(const polyset &S, const unsigned long* sev,
458                        const int sl, LObject* L);
459
460
461TObject*
462kRingFindDivisibleByInS(kStrategy strat, int pos, LObject* L, TObject *T,
463                    long ecart = LONG_MAX);
464#endif
465*/
466/***************************************************************
467 *
468 * stuff to be inlined
469 *
470 ***************************************************************/
471
472KINLINE TSet initT ();
473KINLINE TObject** initR();
474KINLINE unsigned long* initsevT();
475KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin bin);
476KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing, omBin bin);
477KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing, omBin bin);
478KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing,  omBin bin);
479
480KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing);
481KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing);
482KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing);
483KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing);
484
485// if exp bound is not violated, return TRUE and
486//                               get m1 = LCM(LM(p1), LM(p2))/LM(p1)
487//                                   m2 = LCM(LM(p1), LM(p2))/LM(p2)
488// return FALSE and m1 == NULL, m2 == NULL     , otherwise
489KINLINE BOOLEAN k_GetLeadTerms(const poly p1, const poly p2, const ring p_r,
490                               poly &m1, poly &m2, const ring m_r);
491#ifdef KDEBUG
492// test strat
493BOOLEAN kTest(kStrategy strat);
494// test strat, and test that S is contained in T
495BOOLEAN kTest_TS(kStrategy strat);
496// test LObject
497BOOLEAN kTest_L(LObject* L, ring tailRing = NULL,
498                 BOOLEAN testp = FALSE, int lpos = -1,
499                 TSet T = NULL, int tlength = -1);
500// test TObject
501BOOLEAN kTest_T(TObject* T, ring tailRing = NULL, int tpos = -1, char TN = '?');
502// test set strat->SevS
503BOOLEAN kTest_S(kStrategy strat);
504#else
505#define kTest(A)        ((void)0)
506#define kTest_TS(A)     ((void)0)
507#define kTest_T(T)      ((void)0)
508#define kTest_S(T)      ((void)0)
509#define kTest_L(T)      ((void)0)
510#endif
511
512
513/***************************************************************
514 *
515 * From kstd2.cc
516 *
517 ***************************************************************/
518poly kFindZeroPoly(poly input_p, ring leadRing, ring tailRing);
519ideal bba (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat);
520poly kNF2 (ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce);
521ideal kNF2 (ideal F,ideal Q,ideal q, kStrategy strat, int lazyReduce);
522void initBba(ideal F,kStrategy strat);
523
524/***************************************************************
525 *
526 * From kSpolys.cc
527 *
528 ***************************************************************/
529// Reduces PR with PW
530// Assumes PR != NULL, PW != NULL, Lm(PW) divides Lm(PR)
531// Changes: PR
532// Const:   PW
533// If coef != NULL, then *coef is a/gcd(a,b), where a = LC(PR), b = LC(PW)
534// If strat != NULL, tailRing is changed if reduction would violate exp bound
535// of tailRing
536// Returns: 0 everything ok, no tailRing change
537//          1 tailRing has successfully changed (strat != NULL)
538//          2 no reduction performed, tailRing needs to be changed first
539//            (strat == NULL)
540//         -1 tailRing change could not be performed due to exceeding exp
541//            bound of currRing
542int ksReducePoly(LObject* PR,
543                 TObject* PW,
544                 poly spNoether = NULL,
545                 number *coef = NULL,
546                 kStrategy strat = NULL);
547
548#ifdef HAVE_RING2TOM
549// same for rings
550int ksRingReducePoly(LObject* PR,
551                 TObject* PW,
552                 poly spNoether = NULL,
553                 number *coef = NULL,
554                 kStrategy strat = NULL);
555#endif
556
557// Reduces PR at Current->next with PW
558// Assumes PR != NULL, Current contained in PR
559//         Current->next != NULL, LM(PW) devides LM(Current->next)
560// Changes: PR
561// Const:   PW
562// Return: see ksReducePoly
563int ksReducePolyTail(LObject* PR,
564                     TObject* PW,
565                     poly Current,
566                     poly spNoether = NULL);
567
568KINLINE int ksReducePolyTail(LObject* PR, TObject* PW, LObject* Red);
569
570// Creates S-Poly of Pair
571// Const:   Pair->p1, Pair->p2
572// Changes: Pair->p == S-Poly of p1, p2
573// Assume:  Pair->p1 != NULL && Pair->p2
574void ksCreateSpoly(LObject* Pair, poly spNoether = NULL,
575                   int use_buckets=0, ring tailRing=currRing,
576                   poly m1 = NULL, poly m2 = NULL, TObject** R = NULL);
577
578/*2
579* creates the leading term of the S-polynomial of p1 and p2
580* do not destroy p1 and p2
581* remarks:
582*   1. the coefficient is 0 (nNew)
583*   2. pNext is undefined
584*/
585poly ksCreateShortSpoly(poly p1, poly p2, ring tailRing);
586
587
588/*
589* input - output: a, b
590* returns:
591*   a := a/gcd(a,b), b := b/gcd(a,b)
592*   and return value
593*       0  ->  a != 1,  b != 1
594*       1  ->  a == 1,  b != 1
595*       2  ->  a != 1,  b == 1
596*       3  ->  a == 1,  b == 1
597*   this value is used to control the spolys
598*/
599int ksCheckCoeff(number *a, number *b);
600
601// old stuff
602KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether = NULL);
603KINLINE poly ksOldSpolyRedNew(poly p1, poly p2, poly spNoether = NULL);
604KINLINE poly ksOldCreateSpoly(poly p1, poly p2, poly spNoether = NULL, ring r = currRing);
605KINLINE void ksOldSpolyTail(poly p1, poly q, poly q2, poly spNoether, ring r = currRing);
606
607/***************************************************************
608 *
609 * Routines related for ring changes during std computations
610 *
611 ***************************************************************/
612// return TRUE and set m1, m2 to k_GetLcmTerms,
613//             if spoly creation of strat->P does not violate
614//             exponent bound of strat->tailRing
615//      FALSE, otherwise
616BOOLEAN kCheckSpolyCreation(LObject* L, kStrategy strat, poly &m1, poly &m2);
617// change strat->tailRing and adjust all data in strat, L, and T:
618// new tailRing has larger exponent bound
619// do nothing and return FALSE if exponent bound increase would result in
620// larger exponent bound that that of currRing
621BOOLEAN kStratChangeTailRing(kStrategy strat,
622                             LObject* L = NULL, TObject* T = NULL,
623                             // take this as new_expbound: if 0
624                             // new expbound is 2*expbound of tailRing
625                             unsigned long new_expbound = 0);
626// initiate a change of the tailRing of strat -- should be called
627// right before main loop in bba
628void kStratInitChangeTailRing(kStrategy strat);
629
630#include "kInline.cc"
631
632
633#endif
Note: See TracBrowser for help on using the repository browser.