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

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