source: git/kernel/kutil.h @ 57fad3a

spielwiese
Last change on this file since 57fad3a was 57fad3a, checked in by Hans Schönemann <hannes@…>, 15 years ago
*hannes: test syz git-svn-id: file:///usr/local/Singular/svn/trunk@11899 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: kutil.h,v 1.46 2009-06-13 14:37:58 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);
403#ifdef HAVE_RINGS
404KINLINE poly redtailBba_Z (poly p,int pos,kStrategy strat);
405poly redtailBba_Z (LObject* L, int pos, kStrategy strat );
406#endif
407poly redtailBba (LObject *L, int pos,kStrategy strat,
408                 BOOLEAN withT = FALSE,BOOLEAN normalize=FALSE);
409poly redtailBba (TObject *T, int pos,kStrategy strat);
410poly redtail (poly p,int pos,kStrategy strat);
411poly redtail (LObject *L,int pos,kStrategy strat);
412poly redNF (poly h,int & max_ind,int nonorm,kStrategy strat);
413int redNF0 (LObject *P,kStrategy strat);
414poly redNFTail (poly h,const int sl,kStrategy strat);
415int redHoney (LObject* h, kStrategy strat);
416#ifdef HAVE_RINGS
417int redRing (LObject* h,kStrategy strat);
418void enterExtendedSpoly(poly h,kStrategy strat);
419void superenterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR = -1);
420poly kCreateZeroPoly(long exp[], long cabsind, poly* t_p, ring leadRing, ring tailRing);
421long ind2(long arg);
422
423long ind_fact_2(long arg);
424long twoPow(long arg);
425ideal createG0();
426#endif
427int redLazy (LObject* h,kStrategy strat);
428int redHomog (LObject* h,kStrategy strat);
429void enterpairs (poly h, int k, int ec, int pos,kStrategy strat, int atR = -1);
430void entersets (LObject h);
431void pairs ();
432void message (int i,int* reduc,int* olddeg,kStrategy strat,int red_result);
433void messageStat (int srmax,int lrmax,int hilbcount,kStrategy strat);
434#ifdef KDEBUG
435void messageSets (kStrategy strat);
436#else
437#define messageSets(s)  ((void) 0)
438#endif
439
440void initEcartNormal (LObject* h);
441void initEcartBBA (LObject* h);
442void initS (ideal F, ideal Q,kStrategy strat);
443void initSL (ideal F, ideal Q,kStrategy strat);
444void updateS(BOOLEAN toT,kStrategy strat);
445void enterT (LObject p,kStrategy strat, int atT = -1);
446void cancelunit (LObject* p,BOOLEAN inNF=FALSE);
447void HEckeTest (poly pp,kStrategy strat);
448void initBuchMoraCrit(kStrategy strat);
449void initHilbCrit(ideal F, ideal Q, intvec **hilb,kStrategy strat);
450void initBuchMoraPos(kStrategy strat);
451void initBuchMora (ideal F, ideal Q,kStrategy strat);
452void exitBuchMora (kStrategy strat);
453void updateResult(ideal r,ideal Q,kStrategy strat);
454void completeReduce (kStrategy strat, BOOLEAN withT=FALSE);
455void kFreeStrat(kStrategy strat);
456void enterOnePairNormal (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR);
457void chainCritNormal (poly p,int ecart,kStrategy strat);
458BOOLEAN homogTest(polyset F, int Fmax);
459BOOLEAN newHEdge(polyset S, kStrategy strat);
460// returns index of p in TSet, or -1 if not found
461int kFindInT(poly p, TSet T, int tlength);
462
463// return -1 if no divisor is found
464//        number of first divisor, otherwise
465int kFindDivisibleByInT(const TSet &T, const unsigned long* sevT,
466                        const int tl, const LObject* L, const int start=0);
467// same with S
468int kFindDivisibleByInS(const kStrategy strat, int *max_ind, LObject* L);
469
470int kFindNextDivisibleByInS(const kStrategy strat, int start,int max_ind, LObject* L);
471TObject*
472kFindDivisibleByInS(kStrategy strat, int pos, LObject* L, TObject *T,
473                    long ecart = LONG_MAX);
474
475/***************************************************************
476 *
477 * stuff to be inlined
478 *
479 ***************************************************************/
480
481KINLINE TSet initT ();
482KINLINE TObject** initR();
483KINLINE unsigned long* initsevT();
484KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin bin);
485KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing, omBin bin);
486KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing, omBin bin);
487KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing,  omBin bin);
488
489KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing);
490KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing);
491KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing);
492KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing);
493
494// if exp bound is not violated, return TRUE and
495//                               get m1 = LCM(LM(p1), LM(p2))/LM(p1)
496//                                   m2 = LCM(LM(p1), LM(p2))/LM(p2)
497// return FALSE and m1 == NULL, m2 == NULL     , otherwise
498KINLINE BOOLEAN k_GetLeadTerms(const poly p1, const poly p2, const ring p_r,
499                               poly &m1, poly &m2, const ring m_r);
500#ifdef HAVE_RINGS
501KINLINE void k_GetStrongLeadTerms(const poly p1, const poly p2, const ring leadRing,
502                               poly &m1, poly &m2, poly &lcm, const ring taiRing);
503#endif
504#ifdef KDEBUG
505// test strat
506BOOLEAN kTest(kStrategy strat);
507// test strat, and test that S is contained in T
508BOOLEAN kTest_TS(kStrategy strat);
509// test LObject
510BOOLEAN kTest_L(LObject* L, ring tailRing = NULL,
511                 BOOLEAN testp = FALSE, int lpos = -1,
512                 TSet T = NULL, int tlength = -1);
513// test TObject
514BOOLEAN kTest_T(TObject* T, ring tailRing = NULL, int tpos = -1, char TN = '?');
515// test set strat->SevS
516BOOLEAN kTest_S(kStrategy strat);
517#else
518#define kTest(A)        ((void)0)
519#define kTest_TS(A)     ((void)0)
520#define kTest_T(T)      ((void)0)
521#define kTest_S(T)      ((void)0)
522#define kTest_L(T)      ((void)0)
523#endif
524
525
526/***************************************************************
527 *
528 * From kstd2.cc
529 *
530 ***************************************************************/
531poly kFindZeroPoly(poly input_p, ring leadRing, ring tailRing);
532ideal bba (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat);
533poly kNF2 (ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce);
534ideal kNF2 (ideal F,ideal Q,ideal q, kStrategy strat, int lazyReduce);
535void initBba(ideal F,kStrategy strat);
536
537/***************************************************************
538 *
539 * From kSpolys.cc
540 *
541 ***************************************************************/
542// Reduces PR with PW
543// Assumes PR != NULL, PW != NULL, Lm(PW) divides Lm(PR)
544// Changes: PR
545// Const:   PW
546// If coef != NULL, then *coef is a/gcd(a,b), where a = LC(PR), b = LC(PW)
547// If strat != NULL, tailRing is changed if reduction would violate exp bound
548// of tailRing
549// Returns: 0 everything ok, no tailRing change
550//          1 tailRing has successfully changed (strat != NULL)
551//          2 no reduction performed, tailRing needs to be changed first
552//            (strat == NULL)
553//         -1 tailRing change could not be performed due to exceeding exp
554//            bound of currRing
555int ksReducePoly(LObject* PR,
556                 TObject* PW,
557                 poly spNoether = NULL,
558                 number *coef = NULL,
559                 kStrategy strat = NULL);
560
561// Reduces PR at Current->next with PW
562// Assumes PR != NULL, Current contained in PR
563//         Current->next != NULL, LM(PW) devides LM(Current->next)
564// Changes: PR
565// Const:   PW
566// Return: see ksReducePoly
567int ksReducePolyTail(LObject* PR,
568                     TObject* PW,
569                     poly Current,
570                     poly spNoether = NULL);
571
572KINLINE int ksReducePolyTail(LObject* PR, TObject* PW, LObject* Red);
573
574// Creates S-Poly of Pair
575// Const:   Pair->p1, Pair->p2
576// Changes: Pair->p == S-Poly of p1, p2
577// Assume:  Pair->p1 != NULL && Pair->p2
578void ksCreateSpoly(LObject* Pair, poly spNoether = NULL,
579                   int use_buckets=0, ring tailRing=currRing,
580                   poly m1 = NULL, poly m2 = NULL, TObject** R = NULL);
581
582/*2
583* creates the leading term of the S-polynomial of p1 and p2
584* do not destroy p1 and p2
585* remarks:
586*   1. the coefficient is 0 (nNew)
587*   2. pNext is undefined
588*/
589poly ksCreateShortSpoly(poly p1, poly p2, ring tailRing);
590
591
592/*
593* input - output: a, b
594* returns:
595*   a := a/gcd(a,b), b := b/gcd(a,b)
596*   and return value
597*       0  ->  a != 1,  b != 1
598*       1  ->  a == 1,  b != 1
599*       2  ->  a != 1,  b == 1
600*       3  ->  a == 1,  b == 1
601*   this value is used to control the spolys
602*/
603int ksCheckCoeff(number *a, number *b);
604
605// old stuff
606KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether = NULL);
607KINLINE poly ksOldSpolyRedNew(poly p1, poly p2, poly spNoether = NULL);
608KINLINE poly ksOldCreateSpoly(poly p1, poly p2, poly spNoether = NULL, ring r = currRing);
609KINLINE void ksOldSpolyTail(poly p1, poly q, poly q2, poly spNoether, ring r = currRing);
610
611/***************************************************************
612 *
613 * Routines related for ring changes during std computations
614 *
615 ***************************************************************/
616// return TRUE and set m1, m2 to k_GetLcmTerms,
617//             if spoly creation of strat->P does not violate
618//             exponent bound of strat->tailRing
619//      FALSE, otherwise
620BOOLEAN kCheckSpolyCreation(LObject* L, kStrategy strat, poly &m1, poly &m2);
621#ifdef HAVE_RINGS
622// return TRUE if gcdpoly creation of R[atR] and S[atS] does not violate
623//             exponent bound of strat->tailRing
624//      FALSE, otherwise
625BOOLEAN kCheckStrongCreation(int atR, poly m1, int atS, poly m2, kStrategy strat);
626#endif
627// change strat->tailRing and adjust all data in strat, L, and T:
628// new tailRing has larger exponent bound
629// do nothing and return FALSE if exponent bound increase would result in
630// larger exponent bound that that of currRing
631BOOLEAN kStratChangeTailRing(kStrategy strat,
632                             LObject* L = NULL, TObject* T = NULL,
633                             // take this as new_expbound: if 0
634                             // new expbound is 2*expbound of tailRing
635                             unsigned long new_expbound = 0);
636// initiate a change of the tailRing of strat -- should be called
637// right before main loop in bba
638void kStratInitChangeTailRing(kStrategy strat);
639
640KINLINE void clearS (poly p, unsigned long p_sev, int* at, int* k,
641  kStrategy strat);
642#include "kInline.cc"
643
644/* shiftgb stuff */
645#include "shiftgb.h"
646
647poly pMove2CurrTail(poly p, kStrategy strat);
648
649poly pMoveCurrTail2poly(poly p, kStrategy strat);
650
651poly pCopyL2p(LObject h, kStrategy strat);
652
653void enterTShift(LObject p, kStrategy strat, int atT, int uptodeg, int lV);
654
655void initBuchMoraShift (ideal F,ideal Q,kStrategy strat);
656
657void enterOnePairManyShifts (int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV); // ok
658
659void enterOnePairSelfShifts (poly qq, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV);
660
661void 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
662
663void enterpairsShift (poly h,int k,int ecart,int pos,kStrategy strat, int atR,int uptodeg, int lV);
664
665void initenterpairsShift (poly h,int k,int ecart,int isFromQ,kStrategy strat, int atR,int uptodeg, int lV); 
666
667void updateSShift(kStrategy strat,int uptodeg,int lV);
668
669void initBbaShift(ideal F,kStrategy strat);
670
671poly redtailBbaShift (LObject* L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize);
672
673int redFirstShift (LObject* h,kStrategy strat); // ok
674
675ideal freegb(ideal I, int uptodeg, int lVblock);
676
677ideal bbaShift(ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat, int uptodeg, int lV);
678// test syz strategy: // will be removed soon
679extern  int (*test_PosInT)(const TSet T,const int tl,LObject &h);
680extern  int (*test_PosInL)(const LSet set, const int length,
681                LObject* L,const kStrategy strat);
682#endif
Note: See TracBrowser for help on using the repository browser.