source: git/kernel/GBEngine/kutil.h @ a5db0e

spielwiese
Last change on this file since a5db0e was a5db0e, checked in by Hans Schoenemann <hannes@…>, 7 years ago
chg: unsigned for buckets and consequences
  • Property mode set to 100644
File size: 30.9 KB
Line 
1#ifndef KUTIL_H
2#define KUTIL_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/*
7* ABSTRACT: kernel: utils for kStd
8*/
9
10
11#include <string.h>
12
13#include <omalloc/omalloc.h>
14#include <omalloc/omallocClass.h>
15#include <misc/mylimits.h>
16
17
18#include <kernel/polys.h>
19#include <polys/operations/pShallowCopyDelete.h>
20
21#include <kernel/structs.h>
22#include <kernel/GBEngine/kstd1.h>   /* for s_poly_proc_t */
23
24// define if tailrings should be used
25#define HAVE_TAIL_RING
26
27#if 1
28#define setmax 16
29#define setmaxL ((4096-12)/sizeof(LObject))
30#define setmaxLinc ((4096)/sizeof(LObject))
31
32#define setmaxT 64
33#define setmaxTinc 32
34#else
35#define setmax 16
36#define setmaxL 16
37#define setmaxLinc 16
38#define setmaxT 16
39#define setmaxTinc 16
40#endif
41
42// if you want std computations as in Singular version < 2:
43// This disables RedThrough, tailReductions against T (bba),
44// sets posInT = posInT15 (bba, strat->honey), and enables redFirst with LDeg
45// NOTE: can be achieved with option(oldStd)
46
47#undef NO_KINLINE
48#if !defined(KDEBUG) && !defined(NO_INLINE)
49#define KINLINE inline
50#else
51#define KINLINE
52#define NO_KINLINE 1
53#endif
54
55typedef int* intset;
56typedef int64  wlen_type;
57typedef wlen_type* wlen_set;
58
59typedef class sTObject TObject;
60typedef class sLObject LObject;
61typedef TObject * TSet;
62typedef LObject * LSet;
63
64typedef struct denominator_list_s denominator_list_s;
65typedef denominator_list_s *denominator_list;
66
67struct denominator_list_s{number n; denominator_list next;};
68extern denominator_list DENOMINATOR_LIST;
69
70class sTObject
71{
72public:
73  unsigned long sevSig;
74  poly sig;   // the signature of the element
75  poly p;       // Lm(p) \in currRing Tail(p) \in tailRing
76  poly t_p;     // t_p \in tailRing: as monomials Lm(t_p) == Lm(p)
77  poly max_exp;     // p_GetMaxExpP(pNext(p))
78  ring tailRing;
79  long FDeg;    // pFDeg(p)
80  int ecart,
81    length;     // as of pLDeg
82  unsigned  pLength;    // either == 0, or == pLength(p)
83  int  i_r;        // index of TObject in R set, or -1 if not in T
84  BOOLEAN is_normalized; // true, if pNorm was called on p, false otherwise
85  // used in incremental sba() with F5C:
86  // we know some of the redundant elements in
87  // strat->T beforehand, so we can just discard
88  // them and do not need to consider them in the
89  // interreduction process
90  BOOLEAN is_redundant;
91  // used in sba's sig-safe reduction:
92  // sometimes we already know that a reducer
93  // is sig-safe, so no need for a real
94  // sig-safeness check
95  BOOLEAN is_sigsafe;
96
97
98#ifdef HAVE_PLURAL
99  BOOLEAN is_special; // true, it is a new special S-poly (e.g. for SCA)
100#endif
101
102  // initialization
103  KINLINE void Init(ring r = currRing);
104  KINLINE sTObject(ring tailRing = currRing);
105  KINLINE sTObject(poly p, ring tailRing = currRing);
106  KINLINE sTObject(poly p, ring c_r, ring tailRing);
107  KINLINE sTObject(sTObject* T, int copy);
108
109  KINLINE void Set(ring r=currRing);
110  KINLINE void Set(poly p_in, ring r=currRing);
111  KINLINE void Set(poly p_in, ring c_r, ring t_r);
112
113  // Frees the polys of T
114  KINLINE void Delete();
115  // Sets polys to NULL
116  KINLINE void Clear();
117  // makes a copy of the poly of T
118  KINLINE void Copy();
119
120  // ring-dependent Lm access: these might result in allocation of monomials
121  KINLINE poly GetLmCurrRing();
122  KINLINE poly GetLmTailRing();
123  KINLINE poly GetLm(ring r);
124  // this returns Lm and ring r (preferably from tailRing), but does not
125  // allocate a new poly
126  KINLINE void GetLm(poly &p, ring &r) const;
127
128#ifdef OLIVER_PRIVAT_LT
129  // routines for calc. with rings
130  KINLINE poly GetLtCurrRing();
131  KINLINE poly GetLtTailRing();
132  KINLINE poly GetLt(ring r);
133  KINLINE void GetLt(poly &p, ring &r) const;
134#endif
135
136  KINLINE BOOLEAN IsNull() const;
137
138  KINLINE int GetpLength();
139
140  // makes sure that T.p exists
141  KINLINE void SetLmCurrRing();
142
143  // Iterations
144  // simply get the next monomial
145  KINLINE poly Next();
146  KINLINE void LmDeleteAndIter();
147
148  // deg stuff
149  // compute pTotalDegree
150  KINLINE long pTotalDeg() const;
151  // computes pFDeg
152  KINLINE long pFDeg() const;
153  // computes and sets FDeg
154  KINLINE long SetpFDeg();
155  // gets stored FDeg
156  KINLINE long GetpFDeg() const;
157
158  // computes pLDeg
159  KINLINE long pLDeg();
160  // sets length, FDeg, returns LDeg
161  KINLINE long SetDegStuffReturnLDeg();
162
163  // arithmetic
164  KINLINE void Mult_nn(number n);
165  KINLINE void ShallowCopyDelete(ring new_tailRing, omBin new_tailBin,
166                                 pShallowCopyDeleteProc p_shallow_copy_delete,
167                                 BOOLEAN set_max = TRUE);
168  // manipulations
169  KINLINE void pNorm();
170  KINLINE void pCleardenom();
171
172#ifdef KDEBUG
173  void wrp();
174#endif
175};
176
177extern int strat_nr;
178
179class sLObject : public sTObject
180{
181
182public:
183  unsigned long sev;
184  poly  p1,p2; /*- the pair p comes from,
185                 lm(pi) in currRing, tail(pi) in tailring -*/
186
187  poly  lcm;   /*- the lcm of p1,p2 -*/
188  kBucket_pt bucket;
189  int   i_r1, i_r2;
190  unsigned checked; // this is the index of S up to which
191                      // the corresponding LObject was already checked in
192                      // critical pair creation => when entering the
193                      // reduction process it is enough to start a second
194                      // rewritten criterion check from checked+1 onwards
195  BOOLEAN prod_crit;
196                      // NOTE: If prod_crit = TRUE then the corresponding pair is
197                      // detected by Buchberger's Product Criterion and can be
198                      // deleted
199
200  // initialization
201  KINLINE void Init(ring tailRing = currRing);
202  KINLINE sLObject(ring tailRing = currRing);
203  KINLINE sLObject(poly p, ring tailRing = currRing);
204  KINLINE sLObject(poly p, ring c_r, ring tailRing);
205
206  // Frees the polys of L
207  KINLINE void Delete();
208  KINLINE void Clear();
209
210  // Iterations
211  KINLINE void LmDeleteAndIter();
212  KINLINE poly LmExtractAndIter();
213
214  // spoly related things
215  // preparation for reduction if not spoly
216  KINLINE void PrepareRed(BOOLEAN use_bucket);
217  KINLINE void SetLmTail(poly lm, poly new_p, int length,
218                         int use_bucket, ring r);
219  KINLINE void Tail_Minus_mm_Mult_qq(poly m, poly qq, unsigned lq, poly spNoether);
220  KINLINE void Tail_Mult_nn(number n);
221  // deletes bucket, makes sure that p and t_p exists
222  KINLINE poly GetP(omBin lmBin = NULL);
223  // similar, except that only t_p exists
224  KINLINE poly GetTP();
225
226  // does not delete bucket, just canonicalizes it
227  // returned poly is such that Lm(p) \in currRing, Tail(p) \in tailRing
228  KINLINE poly CanonicalizeP();
229
230  // makes a copy of the poly of L
231  KINLINE void Copy();
232
233  KINLINE int GetpLength();
234  KINLINE long pLDeg(BOOLEAN use_last);
235  KINLINE long pLDeg();
236  KINLINE int SetLength(BOOLEAN lengt_pLength = FALSE);
237  KINLINE long SetDegStuffReturnLDeg();
238  KINLINE long SetDegStuffReturnLDeg(BOOLEAN use_last);
239
240  // returns minimal component of p
241  KINLINE long MinComp();
242  // returns component of p
243  KINLINE long Comp();
244
245  KINLINE void ShallowCopyDelete(ring new_tailRing,
246                                 pShallowCopyDeleteProc p_shallow_copy_delete);
247
248  // sets sev
249  KINLINE void SetShortExpVector();
250
251  // enable assignment from TObject
252  KINLINE sLObject& operator=(const sTObject&);
253
254  // get T's corresponding to p1, p2: they might return NULL
255  KINLINE TObject* T_1(const skStrategy* strat);
256  KINLINE TObject* T_2(const skStrategy* strat);
257  KINLINE void     T_1_2(const skStrategy* strat,
258                         TObject* &T_1, TObject* &T_2);
259
260  // simplify coefficients
261  KINLINE void Normalize();
262  KINLINE void HeadNormalize();
263};
264
265
266extern int HCord;
267
268class skStrategy : public omallocClass
269{
270public:
271  kStrategy next;
272  int (*red)(LObject * L,kStrategy strat);
273  int (*red2)(LObject * L,kStrategy strat);
274  void (*initEcart)(TObject * L);
275  int (*posInT)(const TSet T,const int tl,LObject &h);
276  int (*posInLSba)(const LSet set, const int length,
277                LObject* L,const kStrategy strat);
278  int (*posInL)(const LSet set, const int length,
279                LObject* L,const kStrategy strat);
280  void (*enterS)(LObject &h, int pos,kStrategy strat, int atR/* =-1*/ );
281  void (*initEcartPair)(LObject * h, poly f, poly g, int ecartF, int ecartG);
282  int (*posInLOld)(const LSet Ls,const int Ll,
283                   LObject* Lo,const kStrategy strat);
284  void (*enterOnePair) (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR /*= -1*/);
285  void (*chainCrit) (poly p,int ecart,kStrategy strat);
286  BOOLEAN (*syzCrit) (poly sig, unsigned long not_sevSig, kStrategy strat);
287  BOOLEAN (*rewCrit1) (poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start /*= 0*/);
288  BOOLEAN (*rewCrit2) (poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start /*= 0*/);
289  BOOLEAN (*rewCrit3) (poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start /*= 0*/);
290  pFDegProc pOrigFDeg;
291  pLDegProc pOrigLDeg;
292  pFDegProc pOrigFDeg_TailRing;
293  pLDegProc pOrigLDeg_TailRing;
294  s_poly_proc_t s_poly;
295
296  LObject P;
297  ideal Shdl;
298  ideal D; /*V(S) is in D(D)*/
299  ideal M; /*set of minimal generators*/
300  polyset S;
301  polyset syz;
302  polyset sig;
303  intset ecartS;
304  intset fromS; // from which S[i] S[j] comes from
305                // this is important for signature-based
306                // algorithms
307  intset syzIdx;// index in the syz array at which the first
308                // syzygy of component i comes up
309                // important for signature-based algorithms
310  unsigned sbaOrder;
311  int currIdx;
312  int max_lower_index;
313  intset lenS;
314  wlen_set lenSw; /* for tgb.ccc */
315  intset fromQ;
316  unsigned long* sevS;
317  unsigned long* sevSyz;
318  unsigned long* sevSig;
319  unsigned long* sevT;
320  TSet T;
321  LSet L;
322  LSet    B;
323  poly    kHEdge;
324  poly    kNoether;
325  poly    t_kHEdge; // same polys in tailring
326  KINLINE poly    kNoetherTail();
327  poly    t_kNoether;
328  BOOLEAN * NotUsedAxis;
329  BOOLEAN * pairtest;/*used for enterOnePair*/
330  poly tail;
331  intvec * kModW;
332  intvec * kHomW;
333  // procedure for ShalloCopy from tailRing  to currRing
334  pShallowCopyDeleteProc p_shallow_copy_delete;
335  // pointers to Tobjects R[i] is ith Tobject which is generated
336  TObject**  R;
337  // S_2_R[i] yields Tobject which corresponds to S[i]
338  int*      S_2_R;
339  ring tailRing;
340  omBin lmBin;
341  omBin tailBin;
342  int nr;
343  int cp,c3;
344  int sl,mu;
345  int syzl,syzmax,syzidxmax;
346  int tl,tmax;
347  int Ll,Lmax;
348  int Bl,Bmax;
349  int ak,LazyDegree,LazyPass;
350  int syzComp;
351  int HCord;
352  int lastAxis;
353  int newIdeal;
354  int minim;
355  #ifdef HAVE_RINGS
356  bool sigdrop; //This is used to check sigdrop in sba over Z
357  int nrsyzcrit; // counts how many pairs are deleted by SyzCrit
358  int nrrewcrit; // counts how many pairs are deleted by FaugereRewCrit
359  int sbaEnterS; // sba over Z strategy: if sigdrop element has _*gen(sbaEnterS+1), then
360                 // add directly sbaEnterS elements into S
361  int blockred;  // counter for blocked reductions in redSig
362  int blockredmax;
363  #endif
364  #ifdef HAVE_SHIFTBBA
365  int lV;
366  int cv; // in shift bases: counting V criterion
367  #endif
368  BOOLEAN interpt;
369  BOOLEAN homog;
370#ifdef HAVE_PLURAL
371  BOOLEAN z2homog; // Z_2 - homogeneous input allows product criterion in commutative and SCA cases!
372#endif
373  BOOLEAN kHEdgeFound;
374  BOOLEAN honey,sugarCrit;
375  BOOLEAN Gebauer,noTailReduction;
376  BOOLEAN fromT;
377  BOOLEAN noetherSet;
378  BOOLEAN update;
379  BOOLEAN posInLOldFlag;
380  BOOLEAN use_buckets;
381  // if set, pLDeg(p, l) == (pFDeg(pLast(p), pLength)
382  BOOLEAN LDegLast;
383  // if set, then L.length == L.pLength
384  BOOLEAN length_pLength;
385  // if set, then posInL does not depend on L.length
386  BOOLEAN posInLDependsOnLength;
387  /*FALSE, if posInL == posInL10*/
388#ifdef HAVE_PLURAL
389  // set this flag to 1 to stop the product criteria
390  // use ALLOW_PROD_CRIT(strat) to test
391  BOOLEAN no_prod_crit;
392#define ALLOW_PROD_CRIT(A) (!(A)->no_prod_crit)
393#else
394#define ALLOW_PROD_CRIT(A) (1)
395#endif
396  char    redTailChange;
397  char    news;
398  char    newt;/*used for messageSets*/
399  char    noClearS;
400  char    completeReduce_retry;
401  char    overflow;
402
403  skStrategy();
404  ~skStrategy();
405
406  // return TObject corresponding to S[i]: assume that it exists
407  // i.e. no error checking is done
408  KINLINE TObject* S_2_T(int i);
409  // like S_2_T, except that NULL is returned if it can not be found
410  KINLINE TObject* s_2_t(int i);
411};
412
413void deleteHC(poly *p, int *e, int *l, kStrategy strat);
414void deleteHC(LObject* L, kStrategy strat, BOOLEAN fromNext = FALSE);
415void deleteInS (int i,kStrategy strat);
416void deleteInSSba (int i,kStrategy strat);
417void cleanT (kStrategy strat);
418static inline LSet initL (int nr=setmaxL)
419{ return (LSet)omAlloc(nr*sizeof(LObject)); }
420void deleteInL(LSet set, int *length, int j,kStrategy strat);
421void enterL (LSet *set,int *length, int *LSetmax, LObject p,int at);
422void enterSBba (LObject &p,int atS,kStrategy strat, int atR = -1);
423void enterSSba (LObject &p,int atS,kStrategy strat, int atR = -1);
424void initEcartPairBba (LObject* Lp,poly f,poly g,int ecartF,int ecartG);
425void initEcartPairMora (LObject* Lp,poly f,poly g,int ecartF,int ecartG);
426int posInS (const kStrategy strat, const int length, const poly p,
427            const int ecart_p);
428int posInSMonFirst (const kStrategy strat, const int length, const poly p);
429int posInIdealMonFirst (const ideal F, const poly p,int start = 0,int end = -1);
430int posInT0 (const TSet set,const int length,LObject &p);
431int posInT1 (const TSet set,const int length,LObject &p);
432int posInT2 (const TSet set,const int length,LObject &p);
433int posInT11 (const TSet set,const int length,LObject &p);
434int posInTSig (const TSet set,const int length,LObject &p);
435int posInT110 (const TSet set,const int length,LObject &p);
436int posInT13 (const TSet set,const int length,LObject &p);
437int posInT15 (const TSet set,const int length,LObject &p);
438int posInT17 (const TSet set,const int length,LObject &p);
439int posInT17_c (const TSet set,const int length,LObject &p);
440int posInT19 (const TSet set,const int length,LObject &p);
441int posInT_EcartpLength(const TSet set,const int length,LObject &p);
442int posInT_EcartFDegpLength(const TSet set,const int length,LObject &p);
443int posInT_FDegpLength(const TSet set,const int length,LObject &p);
444int posInT_pLength(const TSet set,const int length,LObject &p);
445
446#ifdef HAVE_MORE_POS_IN_T
447int posInT_EcartFDegpLength(const TSet set,const int length,LObject &p);
448int posInT_FDegpLength(const TSet set,const int length,LObject &p);
449int posInT_pLength(const TSet set,const int length,LObject &p);
450#endif
451
452
453void reorderS (int* suc,kStrategy strat);
454int posInLF5C (const LSet set, const int length,
455               LObject* L,const kStrategy strat);
456int posInLSig (const LSet set, const int length,
457               LObject* L,const kStrategy strat);
458int posInLSigRing (const LSet set, const int length,
459               LObject* L,const kStrategy strat);
460int posInLRing (const LSet set, const int length,
461               LObject* L,const kStrategy strat);
462int posInSyz (const kStrategy strat, const poly sig);
463int posInL0 (const LSet set, const int length,
464             LObject* L,const kStrategy strat);
465int posInL11 (const LSet set, const int length,
466             LObject* L,const kStrategy strat);
467int posInL11Ring (const LSet set, const int length,
468             LObject* L,const kStrategy strat);
469int posInLF5CRing (const LSet set, int start , const int length,
470             LObject* L,const kStrategy strat);
471int posInL11Ringls (const LSet set, const int length,
472             LObject* L,const kStrategy strat);
473int posInL13 (const LSet set, const int length,
474             LObject* L,const kStrategy strat);
475int posInL15 (const LSet set, const int length,
476             LObject* L,const kStrategy strat);
477int posInL15Ring (const LSet set, const int length,
478             LObject* L,const kStrategy strat);
479int posInL17 (const LSet set, const int length,
480             LObject* L,const kStrategy strat);
481int posInL10 (const LSet set, const int length,
482             LObject* L,const kStrategy strat);
483int posInL10Ring (const LSet set, const int length,
484             LObject* L,const kStrategy strat);
485int posInL110 (const LSet set, const int length,
486             LObject* L,const kStrategy strat);
487KINLINE poly redtailBba (poly p,int pos,kStrategy strat,BOOLEAN normalize=FALSE);
488KINLINE poly redtailBbaBound (poly p,int pos,kStrategy strat,int bound,BOOLEAN normalize=FALSE);
489#ifdef HAVE_RINGS
490KINLINE poly redtailBba_Z (poly p,int pos,kStrategy strat);
491poly redtailBba_Z (LObject* L, int pos, kStrategy strat );
492#endif
493poly redtailBba (LObject *L, int pos,kStrategy strat,
494                 BOOLEAN withT = FALSE,BOOLEAN normalize=FALSE);
495poly redtailBbaBound (LObject *L, int pos,kStrategy strat,int bound,
496                 BOOLEAN withT = FALSE,BOOLEAN normalize=FALSE);
497poly redtailSba (LObject *L, int pos,kStrategy strat,
498                 BOOLEAN withT = FALSE,BOOLEAN normalize=FALSE);
499poly redtailBba (TObject *T, int pos,kStrategy strat);
500poly redtail (poly p,int pos,kStrategy strat);
501poly redtail (LObject *L,int pos,kStrategy strat);
502poly redNF (poly h,int & max_ind,int nonorm,kStrategy strat);
503int redNF0 (LObject *P,kStrategy strat);
504poly redNFTail (poly h,const int sl,kStrategy strat);
505int redHoney (LObject* h, kStrategy strat);
506#ifdef HAVE_RINGS
507int redRing (LObject* h,kStrategy strat);
508int redRiloc (LObject* h,kStrategy strat);
509void enterExtendedSpoly(poly h,kStrategy strat);
510void enterExtendedSpolySig(poly h,poly hSig,kStrategy strat);
511void superenterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR = -1);
512void superenterpairsSig (poly h,poly hSig,int hFrom,int k,int ecart,int pos,kStrategy strat, int atR = -1);
513poly kCreateZeroPoly(long exp[], long cabsind, poly* t_p, ring leadRing, ring tailRing);
514long ind2(long arg);
515
516long ind_fact_2(long arg);
517long twoPow(long arg);
518ideal createG0();
519#endif
520int redLazy (LObject* h,kStrategy strat);
521int redHomog (LObject* h,kStrategy strat);
522int redSig (LObject* h,kStrategy strat);
523int redSigRing (LObject* h,kStrategy strat);
524//adds hSig to be able to check with F5's criteria when entering pairs!
525void enterpairsSig (poly h, poly hSig, int from, int k, int ec, int pos,kStrategy strat, int atR = -1);
526void enterpairs (poly h, int k, int ec, int pos,kStrategy strat, int atR = -1);
527void entersets (LObject h);
528void pairs ();
529BOOLEAN sbaCheckGcdPair (LObject* h,kStrategy strat);
530void message (int i,int* reduc,int* olddeg,kStrategy strat,int red_result);
531void messageStat (int hilbcount,kStrategy strat);
532void messageStatSBA (int hilbcount,kStrategy strat);
533#ifdef KDEBUG
534void messageSets (kStrategy strat);
535#else
536#define messageSets(s)  do {} while (0)
537#endif
538
539void initEcartNormal (TObject* h);
540void initEcartBBA (TObject* h);
541void initS (ideal F, ideal Q,kStrategy strat);
542void initSL (ideal F, ideal Q,kStrategy strat);
543void initSLSba (ideal F, ideal Q,kStrategy strat);
544/*************************************************
545 * when initializing a new bunch of principal
546 * syzygies at the beginning of a new iteration
547 * step in a signature-based algorithm we
548 * compute ONLY the leading elements of those
549 * syzygies, NOT the whole syzygy
550 * NOTE: this needs to be adjusted for a more
551 * general approach on signature-based algorithms
552 ***********************************************/
553void initSyzRules (kStrategy strat);
554void updateS(BOOLEAN toT,kStrategy strat);
555void enterSyz (LObject &p,kStrategy strat, int atT);
556void enterT (LObject &p,kStrategy strat, int atT = -1);
557#ifdef HAVE_RINGS
558void enterT_strong (LObject &p,kStrategy strat, int atT = -1);
559#endif
560void cancelunit (LObject* p,BOOLEAN inNF=FALSE);
561void HEckeTest (poly pp,kStrategy strat);
562void initBuchMoraCrit(kStrategy strat);
563void initSbaCrit(kStrategy strat);
564void initHilbCrit(ideal F, ideal Q, intvec **hilb,kStrategy strat);
565void initBuchMoraPos(kStrategy strat);
566void initBuchMoraPosRing(kStrategy strat);
567void initSbaPos(kStrategy strat);
568void initBuchMora (ideal F, ideal Q,kStrategy strat);
569void initSbaBuchMora (ideal F, ideal Q,kStrategy strat);
570void exitBuchMora (kStrategy strat);
571void exitSba (kStrategy strat);
572void updateResult(ideal r,ideal Q,kStrategy strat);
573void completeReduce (kStrategy strat, BOOLEAN withT=FALSE);
574void kFreeStrat(kStrategy strat);
575void enterOnePairNormal (int i,poly p,int ecart, int isFromQ,kStrategy strat, int atR);
576void chainCritNormal (poly p,int ecart,kStrategy strat);
577void chainCritOpt_1 (poly,int,kStrategy strat);
578void chainCritSig (poly p,int ecart,kStrategy strat);
579BOOLEAN homogTest(polyset F, int Fmax);
580BOOLEAN newHEdge(kStrategy strat);
581BOOLEAN syzCriterion(poly sig, unsigned long not_sevSig, kStrategy strat);
582BOOLEAN syzCriterionInc(poly sig, unsigned long not_sevSig, kStrategy strat);
583KINLINE BOOLEAN arriRewDummy(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start);
584BOOLEAN arriRewCriterion(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start);
585BOOLEAN arriRewCriterionPre(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start);
586BOOLEAN faugereRewCriterion(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start);
587BOOLEAN findMinLMPair(poly sig, unsigned long not_sevSig, kStrategy strat, int start);
588
589/// returns index of p in TSet, or -1 if not found
590int kFindInT(poly p, TSet T, int tlength);
591
592/// return -1 if no divisor is found
593///        number of first divisor in T, otherwise
594int kFindDivisibleByInT(const kStrategy strat, const LObject* L, const int start=0);
595
596/// return -1 if no divisor is found
597///        number of first divisor in S, otherwise
598int kFindDivisibleByInS(const kStrategy strat, int *max_ind, LObject* L);
599
600int kFindNextDivisibleByInS(const kStrategy strat, int start,int max_ind, LObject* L);
601TObject*
602kFindDivisibleByInS(kStrategy strat, int pos, LObject* L, TObject *T,
603                    long ecart = LONG_MAX);
604
605/***************************************************************
606 *
607 * stuff to be inlined
608 *
609 ***************************************************************/
610
611KINLINE TSet initT ();
612KINLINE TObject** initR();
613KINLINE unsigned long* initsevT();
614KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin bin);
615KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing, omBin bin);
616KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing, omBin bin);
617KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing,  omBin bin);
618
619KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing);
620KINLINE poly k_LmInit_tailRing_2_currRing(poly p, ring tailRing);
621KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing(poly p, ring tailRing);
622KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing(poly p, ring tailRing);
623
624// if exp bound is not violated, return TRUE and
625//                               get m1 = LCM(LM(p1), LM(p2))/LM(p1)
626//                                   m2 = LCM(LM(p1), LM(p2))/LM(p2)
627// return FALSE and m1 == NULL, m2 == NULL     , otherwise
628KINLINE BOOLEAN k_GetLeadTerms(const poly p1, const poly p2, const ring p_r,
629                               poly &m1, poly &m2, const ring m_r);
630#ifdef HAVE_RINGS
631KINLINE void k_GetStrongLeadTerms(const poly p1, const poly p2, const ring leadRing,
632                               poly &m1, poly &m2, poly &lcm, const ring taiRing);
633#endif
634#ifdef KDEBUG
635// test strat
636BOOLEAN kTest(kStrategy strat);
637// test strat, and test that S is contained in T
638BOOLEAN kTest_TS(kStrategy strat);
639// test LObject
640BOOLEAN kTest_L(LObject* L, ring tailRing = NULL,
641                 BOOLEAN testp = FALSE, int lpos = -1,
642                 TSet T = NULL, int tlength = -1);
643// test TObject
644BOOLEAN kTest_T(TObject* T, ring tailRing = NULL, int tpos = -1, char TN = '?');
645// test set strat->SevS
646BOOLEAN kTest_S(kStrategy strat);
647#else
648#define kTest(A)        (TRUE)
649#define kTest_TS(A)     (TRUE)
650#define kTest_T(T)      (TRUE)
651#define kTest_S(T)      (TRUE)
652#define kTest_L(T)      (TRUE)
653#endif
654
655
656/***************************************************************
657 *
658 * From kstd2.cc
659 *
660 ***************************************************************/
661poly kFindZeroPoly(poly input_p, ring leadRing, ring tailRing);
662ideal bba (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat);
663ideal sba (ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat);
664poly kNF2 (ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce);
665ideal kNF2 (ideal F,ideal Q,ideal q, kStrategy strat, int lazyReduce);
666poly kNF2Bound (ideal F, ideal Q, poly q,int bound, kStrategy strat, int lazyReduce);
667ideal kNF2Bound (ideal F,ideal Q,ideal q,int bound, kStrategy strat, int lazyReduce);
668void initBba(kStrategy strat);
669void initSba(ideal F,kStrategy strat);
670void f5c (kStrategy strat, int& olddeg, int& minimcnt, int& hilbeledeg,
671          int& hilbcount, int& srmax, int& lrmax, int& reduc, ideal Q,
672          intvec *w,intvec *hilb );
673
674/***************************************************************
675 *
676 * From kspoly.cc
677 *
678 ***************************************************************/
679// Reduces PR with PW
680// Assumes PR != NULL, PW != NULL, Lm(PW) divides Lm(PR)
681// Changes: PR
682// Const:   PW
683// If coef != NULL, then *coef is a/gcd(a,b), where a = LC(PR), b = LC(PW)
684// If strat != NULL, tailRing is changed if reduction would violate exp bound
685// of tailRing
686// Returns: 0 everything ok, no tailRing change
687//          1 tailRing has successfully changed (strat != NULL)
688//          2 no reduction performed, tailRing needs to be changed first
689//            (strat == NULL)
690//         -1 tailRing change could not be performed due to exceeding exp
691//            bound of currRing
692int ksReducePoly(LObject* PR,
693                 TObject* PW,
694                 poly spNoether = NULL,
695                 number *coef = NULL,
696                 kStrategy strat = NULL);
697
698int ksReducePolyBound(LObject* PR,
699                 TObject* PW,
700                 int bound,
701                 poly spNoether = NULL,
702                 number *coef = NULL,
703                 kStrategy strat = NULL);
704
705// Reduces PR with PW
706// Assumes PR != NULL, PW != NULL, Lm(PW) divides Lm(PR)
707// Changes: PR
708// Const:   PW
709// If coef != NULL, then *coef is a/gcd(a,b), where a = LC(PR), b = LC(PW)
710// If strat != NULL, tailRing is changed if reduction would violate exp bound
711// of tailRing
712// Returns: 0 everything ok, no tailRing change
713//          1 tailRing has successfully changed (strat != NULL)
714//          2 no reduction performed, tailRing needs to be changed first
715//            (strat == NULL)
716//          3 no reduction performed, not sig-safe!!!
717//         -1 tailRing change could not be performed due to exceeding exp
718//            bound of currRing
719int ksReducePolySig(LObject* PR,
720                 TObject* PW,
721                 long idx,
722                 poly spNoether = NULL,
723                 number *coef = NULL,
724                 kStrategy strat = NULL);
725
726int ksReducePolySigRing(LObject* PR,
727                 TObject* PW,
728                 long idx,
729                 poly spNoether = NULL,
730                 number *coef = NULL,
731                 kStrategy strat = NULL);
732
733// Reduces PR at Current->next with PW
734// Assumes PR != NULL, Current contained in PR
735//         Current->next != NULL, LM(PW) devides LM(Current->next)
736// Changes: PR
737// Const:   PW
738// Return: see ksReducePoly
739int ksReducePolyTail(LObject* PR,
740                     TObject* PW,
741                     poly Current,
742                     poly spNoether = NULL);
743
744KINLINE int ksReducePolyTail(LObject* PR, TObject* PW, LObject* Red);
745
746// Creates S-Poly of Pair
747// Const:   Pair->p1, Pair->p2
748// Changes: Pair->p == S-Poly of p1, p2
749// Assume:  Pair->p1 != NULL && Pair->p2
750void ksCreateSpoly(LObject* Pair, poly spNoether = NULL,
751                   int use_buckets=0, ring tailRing=currRing,
752                   poly m1 = NULL, poly m2 = NULL, TObject** R = NULL);
753
754/*2
755* creates the leading term of the S-polynomial of p1 and p2
756* do not destroy p1 and p2
757* remarks:
758*   1. the coefficient is 0 (nNew)
759*   2. pNext is undefined
760*/
761poly ksCreateShortSpoly(poly p1, poly p2, ring tailRing);
762
763
764// old stuff
765KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether = NULL);
766KINLINE poly ksOldSpolyRedNew(poly p1, poly p2, poly spNoether = NULL);
767KINLINE poly ksOldCreateSpoly(poly p1, poly p2, poly spNoether = NULL, ring r = currRing);
768KINLINE void ksOldSpolyTail(poly p1, poly q, poly q2, poly spNoether, ring r = currRing);
769
770/***************************************************************
771 *
772 * Routines related for ring changes during std computations
773 *
774 ***************************************************************/
775// return TRUE and set m1, m2 to k_GetLcmTerms,
776//             if spoly creation of strat->P does not violate
777//             exponent bound of strat->tailRing
778//      FALSE, otherwise
779BOOLEAN kCheckSpolyCreation(LObject* L, kStrategy strat, poly &m1, poly &m2);
780#ifdef HAVE_RINGS
781// return TRUE if gcdpoly creation of R[atR] and S[atS] does not violate
782//             exponent bound of strat->tailRing
783//      FALSE, otherwise
784BOOLEAN kCheckStrongCreation(int atR, poly m1, int atS, poly m2, kStrategy strat);
785poly preIntegerCheck(ideal F, ideal Q);
786void postReduceByMon(LObject* h, kStrategy strat);
787void postReduceByMonSig(LObject* h, kStrategy strat);
788void finalReduceByMon(kStrategy strat);
789#endif
790// change strat->tailRing and adjust all data in strat, L, and T:
791// new tailRing has larger exponent bound
792// do nothing and return FALSE if exponent bound increase would result in
793// larger exponent bound that that of currRing
794BOOLEAN kStratChangeTailRing(kStrategy strat,
795                             LObject* L = NULL, TObject* T = NULL,
796                             // take this as new_expbound: if 0
797                             // new expbound is 2*expbound of tailRing
798                             unsigned long new_expbound = 0);
799// initiate a change of the tailRing of strat -- should be called
800// right before main loop in bba
801void kStratInitChangeTailRing(kStrategy strat);
802
803/// Output some debug info about a given strategy
804void kDebugPrint(kStrategy strat);
805
806// getting sb order for sba computations
807ring sbaRing(kStrategy strat, const ring r=currRing, BOOLEAN complete=TRUE, int sgn=1);
808
809KINLINE void clearS (poly p, unsigned long p_sev, int* at, int* k,
810  kStrategy strat);
811
812#include <kernel/GBEngine/kInline.h>
813
814/* shiftgb stuff */
815#include <kernel/GBEngine/shiftgb.h>
816
817poly pMove2CurrTail(poly p, kStrategy strat);
818
819poly pMoveCurrTail2poly(poly p, kStrategy strat);
820
821poly pCopyL2p(LObject h, kStrategy strat);
822
823void enterTShift(LObject p, kStrategy strat, int atT, int uptodeg, int lV);
824
825void initBuchMoraShift (ideal F,ideal Q,kStrategy strat);
826
827void enterOnePairSelfShifts (poly qq, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int uptodeg, int lV);
828
829void 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
830
831void enterpairsShift (poly h,int k,int ecart,int pos,kStrategy strat, int atR,int uptodeg, int lV);
832
833void updateSShift(kStrategy strat,int uptodeg,int lV);
834
835void initBbaShift(kStrategy strat);
836
837poly redtailBbaShift (LObject* L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize);
838
839int redFirstShift (LObject* h,kStrategy strat); // ok
840
841ideal freegb(ideal I, int uptodeg, int lVblock);
842
843ideal bbaShift(ideal F, ideal Q,intvec *w,intvec *hilb,kStrategy strat, int uptodeg, int lV);
844// test syz strategy: // will be removed soon
845extern  int (*test_PosInT)(const TSet T,const int tl,LObject &h);
846extern  int (*test_PosInL)(const LSet set, const int length,
847                LObject* L,const kStrategy strat);
848#endif
Note: See TracBrowser for help on using the repository browser.