My Project
ring.h
Go to the documentation of this file.
1 #ifndef RING_H
2 #define RING_H
3 /****************************************
4 * Computer Algebra System SINGULAR *
5 ****************************************/
6 /*
7 * ABSTRACT - the interpreter related ring operations
8 */
9 
10 /* includes */
11 #include "misc/auxiliary.h"
12 #include "coeffs/coeffs.h"
13 #include "misc/intvec.h"
14 #include "misc/int64vec.h"
15 #include "coeffs/coeffs.h" // ring,number
17 //#include "polys/monomials/polys-impl.h"
18 //
19 
20 /* forward declaration of types */
21 class idrec; typedef idrec * idhdl; // _only_ for idhdl ip_sring::idroot
22 struct p_Procs_s;
23 typedef struct p_Procs_s p_Procs_s;
24 class kBucket;
26 
27 struct sip_sideal;
28 typedef struct sip_sideal * ideal;
29 typedef struct sip_sideal const * const_ideal;
30 
31 struct sip_smap;
32 typedef struct sip_smap * map;
33 typedef struct sip_smap const * const_map;
34 
35 /* the function pointer types */
36 
37 typedef long (*pLDegProc)(poly p, int *length, ring r);
38 typedef long (*pFDegProc)(poly p, ring r);
39 typedef void (*p_SetmProc)(poly p, const ring r);
40 
41 
42 /// returns a poly from dest_r which is a ShallowCopy of s_p from source_r
43 /// assumes that source_r->N == dest_r->N and that orderings are the same
44 typedef poly (*pShallowCopyDeleteProc)(poly s_p, ring source_r, ring dest_r,
45  omBin dest_bin);
46 
47 // ro_typ describes what to store at the corresping "data" place in p->exp
48 // none of the directly corresponds to a ring ordering (ringorder_*)
49 // as each ringorder_* blocks corrsponds to 0..2 sro-blocks
50 typedef enum
51 {
52  ro_dp, // total degree with weights 1
53  ro_wp, // total weighted degree with weights>0 in wvhdl
54  ro_am, // weights for vars + weights for gen
55  ro_wp64, // weighted64 degree weights in wvhdl
56  ro_wp_neg, // total weighted degree with weights in Z in wvhdl
57  // (with possibly negative weights)
58  ro_cp, // ??ordering duplicates variables
59  ro_syzcomp, // ??ordering indicates "subset" of component number (ringorder_S)
60  ro_syz, // component number if <=syzcomp else 0 (ringorder_s)
61  ro_isTemp, ro_is, // ??Induced Syzygy (Schreyer) ordering (and prefix data placeholder dummy) (ringorder_IS)
62  ro_none
63 }
64 ro_typ;
65 
66 /// order stuff
67 typedef enum rRingOrder_t
68 {
71  ringorder_a64, ///< for int64 weights
75  ringorder_S, ///< S?
76  ringorder_s, ///< s?
90  // the following are only used internally
91  ringorder_aa, ///< for idElimination, like a, except pFDeg, pWeigths ignore it
92  ringorder_rs, ///< opposite of ls
93  ringorder_IS, ///< Induced (Schreyer) ordering
96 
97 typedef enum rOrderType_t
98 {
99  rOrderType_General = 0, ///< non-simple ordering as specified by currRing
100  rOrderType_CompExp, ///< simple ordering, component has priority
101  rOrderType_ExpComp, ///< simple ordering, exponent vector has priority
102  ///< component not compatible with exp-vector order
103  rOrderType_Exp, ///< simple ordering, exponent vector has priority
104  ///< component is compatible with exp-vector order
105  rOrderType_Syz, ///< syzygy ordering
106  rOrderType_Schreyer, ///< Schreyer ordering
107  rOrderType_Syz2dpc, ///< syzcomp2dpc
108  rOrderType_ExpNoComp ///< simple ordering, differences in component are
109  ///< not considered
111 
112 // ordering is a degree ordering
113 struct sro_dp
114 {
115  short place; // where degree is stored (in L):
116  short start; // bounds of ordering (in E):
117  short end;
118 };
119 typedef struct sro_dp sro_dp;
120 
121 // ordering is a weighted degree ordering
122 struct sro_wp
123 {
124  short place; // where weighted degree is stored (in L)
125  short start; // bounds of ordering (in E)
126  short end;
127  int *weights; // pointers into wvhdl field
128 };
129 typedef struct sro_wp sro_wp;
130 
131 // ordering is a weighted degree ordering
132 struct sro_am
133 {
134  short place; // where weighted degree is stored (in L)
135  short start; // bounds of ordering (in E)
136  short end;
137  short len_gen; // i>len_gen: weight(gen(i)):=0
138  int *weights; // pointers into wvhdl field of length (end-start+1) + len_gen + 1
139  // contents w_{start},... w_{end}, len, mod_w_1, .. mod_w_len, 0
140  int *weights_m; // pointers into wvhdl field of length len_gen + 1
141  // len_gen, mod_w_1, .. mod_w_len, 0
142 
143 };
144 typedef struct sro_am sro_am;
145 
146 // ordering is a weighted degree ordering
147 struct sro_wp64
148 {
149  short place; // where weighted degree is stored (in L)
150  short start; // bounds of ordering (in E)
151  short end;
152  int64 *weights64; // pointers into wvhdl field
153 };
154 typedef struct sro_wp64 sro_wp64;
155 
156 // ordering duplicates variables
157 struct sro_cp
158 {
159  short place; // where start is copied to (in E)
160  short start; // bounds of sources of copied variables (in E)
161  short end;
162 };
163 typedef struct sro_cp sro_cp;
164 
165 // ordering indicates "subset" of component number
167 {
168  short place; // where the index is stored (in L)
169  long *ShiftedComponents; // pointer into index field
171 #ifdef PDEBUG
172  long length;
173 #endif
174 };
175 typedef struct sro_syzcomp sro_syzcomp;
176 
177 // ordering with component number >syzcomp is lower
178 struct sro_syz
179 {
180  short place; // where the index is stored (in L)
181  int limit; // syzcomp
182  int* syz_index; // mapping Component -> SyzIndex for Comp <= limit
183  int curr_index; // SyzIndex for Component > limit
184 };
185 
186 typedef struct sro_syz sro_syz;
187 // Induced Syzygy (Schreyer) ordering is built inductively as follows:
188 // we look for changes made by ordering blocks which are between prefix/suffix markers:
189 // that is: which variables where placed by them and where (judging by v)
190 
191 // due to prefix/suffix nature we need some placeholder:
192 // prefix stores here initial state
193 // suffix cleares this up
195 {
196  short start; // 1st member SHOULD be short "place"
198  int* pVarOffset; // copy!
199 };
200 
201 // So this is the actuall thing!
202 // suffix uses last sro_ISTemp (cleares it up afterwards) and
203 // creates this block
204 struct sro_IS
205 {
206  short start, end; // which part of L we want to want to update...
207  int* pVarOffset; // same as prefix!
208 
209  int limit; // first referenced component
210 
211  // reference poly set?? // Should it be owned by ring?!!!
212  ideal F; // reference leading (module)-monomials set. owned by ring...
213 };
214 
215 typedef struct sro_IS sro_IS;
216 typedef struct sro_ISTemp sro_ISTemp;
217 
218 struct sro_ord
219 {
221  int order_index; // comes from r->order[order_index]
222  union
223  {
224  sro_dp dp;
225  sro_wp wp;
226  sro_am am;
227  sro_wp64 wp64;
228  sro_cp cp;
229  sro_syzcomp syzcomp;
230  sro_syz syz;
231  sro_IS is;
232  sro_ISTemp isTemp;
233  } data;
234 };
235 
236 #ifdef HAVE_PLURAL
237 struct nc_struct;
238 typedef struct nc_struct nc_struct;
239 #endif
240 class skStrategy;
242 
243 typedef poly (*NF_Proc)(ideal, ideal, poly, int, int, const ring _currRing);
244 typedef ideal (*BBA_Proc) (const ideal, const ideal, const intvec *, const intvec *, kStrategy strat, const ring);
245 
246 
247 struct ip_sring
248 {
249 // each entry must have a description and a procedure defining it,
250 // general ordering: pointer/structs, long, int, short, BOOLEAN/char/enum
251 // general defining procedures: rInit, rComplete, interpreter, ??
252  idhdl idroot; /* local objects , interpreter*/
253  rRingOrder_t* order; /* array of orderings, rInit/rSleftvOrdering2Ordering */
254  int* block0; /* starting pos., rInit/rSleftvOrdering2Ordering*/
255  int* block1; /* ending pos., rInit/rSleftvOrdering2Ordering*/
256 // char** parameter; /* names of parameters, rInit */
257  int** wvhdl; /* array of weight vectors, rInit/rSleftvOrdering2Ordering */
258  char ** names; /* array of variable names, rInit */
259 
260  // what follows below here should be set by rComplete, _only_
261  long *ordsgn; /* array of +/- 1 (or 0) for comparing monomials */
262  /* ExpL_Size entries*/
263 
264  // is NULL for lp or N == 1, otherwise non-NULL (with OrdSize > 0 entries) */
265  sro_ord* typ; /* array of orderings + sizes, OrdSize entries */
266  /* if NegWeightL_Size > 0, then NegWeightL_Offset[0..size_1] is index of longs
267  in ExpVector whose values need an offset due to negative weights */
268  /* array of NegWeigtL_Size indicies */
270 
271  int* VarOffset;
272 
273 // ideal minideal;
274 // number minpoly; /* replaced by minideal->m[0] */
275  ideal qideal; /**< extension to the ring structure: qring, rInit, OR
276  for Q_a/Zp_a, rInit (replaces minideal!);
277  for a start, we assume that there is either no
278  or exactly one generator in minideal, playing
279  the role of the former minpoly; minideal may
280  also be NULL which coincides with the
281  no-generator-case **/
282 
283  int* firstwv;
284 
285  omBin PolyBin; /* Bin from where monoms are allocated */
286  intvec * pModW; /* std: module weights */
287  poly ppNoether; /* variables, set by procedures from hecke/kstd1:
288  the highest monomial below pHEdge */
289  void * ext_ref; /* libsing GAP object */
290 // #ifdef HAVE_RINGS
291 // unsigned int cf->ringtype; /* cring = 0 => coefficient field, cring = 1 => coeffs from Z/2^m */
292 // mpz_ptr cf->modBase; /* Z/(ringflag^cf->modExponent)=Z/cf->modNumber*/
293 // unsigned long cf->modExponent;
294 // unsigned long cf->modNumber; /* Z/cf->modNumber */
295 // mpz_ptr cf->modNumber;
296 // #endif
297 
298  unsigned long options; /* ring dependent options */
299 
300 // int ch; /* characteristic, rInit */
301  int ref; /* reference counter to the ring, interpreter */
302 
303  short N; /* number of vars, rInit */
304 
305  short OrdSgn; /* 1 for polynomial rings, -1 otherwise, rInit */
306 
308 #ifdef HAVE_PLURAL
310 #endif
311 
312 #ifdef HAVE_SHIFTBBA
313  short isLPring; /* 0 for non-letterplace rings, otherwise the number of LP blocks, at least 1, known also as lV */
315 #endif
316 
320  BOOLEAN LexOrder; // TRUE if the monomial ordering has polynomial and power series blocks
321  BOOLEAN MixedOrder; // TRUE for global/local mixed orderings, FALSE otherwise
322  BOOLEAN pLexOrder; /* TRUE if the monomial ordering is not compatible with pFDeg */
323 
324  BOOLEAN ComponentOrder; // 1 if ringorder_c, -1 for ringorder_C,ringorder_S,ringorder_s
325 
326  // what follows below here should be set by rComplete, _only_
327  // contains component, but no weight fields in E */
328  short ExpL_Size; // size of exponent vector in long
329  short CmpL_Size; // portions which need to be compared
330  /* number of long vars in exp vector:
331  long vars are those longs in the exponent vector which are
332  occupied by variables, only */
333  short VarL_Size;
334  short BitsPerExp; /* number of bits per exponent */
335  short ExpPerLong; /* maximal number of Exponents per long */
336  short pCompIndex; /* p->exp.e[pCompIndex] is the component */
337  short pOrdIndex; /* p->exp[pOrdIndex] is pGetOrd(p) */
338  short OrdSize; /* size of ord vector (in sro_ord) */
339 
340  /* if >= 0, long vars in exp vector are consecutive and start there
341  if < 0, long vars in exp vector are not consecutive */
343 
345  /* array of size VarL_Size,
346  VarL_Offset[i] gets i-th long var in exp vector */
348 
349  /* mask for getting single exponents, also maxExp */
350  unsigned long bitmask;
351  /* wanted maxExp */
352  unsigned long wanted_maxExp;
353  /* mask used for divisiblity tests */
354  unsigned long divmask; // rComplete
355 
356  p_Procs_s* p_Procs; // rComplete/p_ProcsSet
357 
358  /* FDeg and LDeg */
359  pFDegProc pFDeg; // rComplete/rSetDegStuff
360  pLDegProc pLDeg; // rComplete/rSetDegStuff
361 
362  /* as it was determined by rComplete */
364  /* and as it was determined before rOptimizeLDeg */
366 
369 #ifdef HAVE_PLURAL
370  private:
371  nc_struct* _nc; // private
372  public:
373  inline const nc_struct* GetNC() const { return _nc; }; // public!!!
374  inline nc_struct*& GetNC() { return _nc; }; // public!!!
375 #endif
376  public:
377  operator coeffs() const { return cf; }
378 };
379 
380 ////////// DEPRECATED
381 /////// void rChangeCurrRing(ring r);
382 
383 ring rDefault(int ch, int N, char **n);
384 ring rDefault(const coeffs cf, int N, char **n, const rRingOrder_t o=ringorder_lp);
385 ring rDefault(int ch, int N, char **n,int ord_size, rRingOrder_t *ord, int *block0, int *block1, int **wvhdl=NULL);
386 ring rDefault(const coeffs cf, int N, char **n,int ord_size, rRingOrder_t *ord, int *block0, int *block1, int **wvhdl=NULL, unsigned long bitmask=0);
387 unsigned long rGetExpSize(unsigned long bitmask, int & bits, int N);
388 
389 // #define rIsRingVar(A) r_IsRingVar(A,currRing)
390 int r_IsRingVar(const char *n, char**names, int N);
391 void rWrite(ring r, BOOLEAN details = FALSE);
392 ring rCopy(ring r);
393 ring rCopy0(const ring r, BOOLEAN copy_qideal = TRUE, BOOLEAN copy_ordering = TRUE);
394 ring rCopy0AndAddA(ring r, int64vec *wv64, BOOLEAN copy_qideal = TRUE,
395  BOOLEAN copy_ordering = TRUE);
396 ring rOpposite(ring r);
397 ring rEnvelope(ring r);
398 
399 /// we must always have this test!
400 static inline BOOLEAN rIsPluralRing(const ring r)
401 {
402  assume(r != NULL);
403 #ifdef HAVE_PLURAL
404  nc_struct *n;
405  return ((n=r->GetNC()) != NULL) /*&& (n->type != nc_error)*/;
406 #else
407  return FALSE;
408 #endif
409 }
410 
411 static inline BOOLEAN rIsLPRing(const ring r)
412 {
413  assume(r != NULL);
414 #if defined(HAVE_PLURAL) && defined(HAVE_SHIFTBBA)
415  return (r->isLPring!=0);
416 #else
417  return FALSE;
418 #endif
419 }
420 
421 static inline BOOLEAN rIsNCRing(const ring r)
422 {
423 #ifdef HAVE_PLURAL
424  return rIsLPRing(r) || rIsPluralRing(r);
425 #else
426  return FALSE;
427 #endif
428 }
429 
430 static inline BOOLEAN rIsRatGRing(const ring r)
431 {
432  assume(r != NULL);
433 #ifdef HAVE_PLURAL
434  /* nc_struct *n; */
435  return (r != NULL) /* && ((n=r->GetNC()) != NULL) */
436  && (r->real_var_start>1);
437 #else
438  return FALSE;
439 #endif
440 }
441 
442 // The following are for LaScala3 only!
443 void rChangeSComps(int* currComponents, long* currShiftedComponents, int length, ring r);
444 void rGetSComps(int** currComponents, long** currShiftedComponents, int *length, ring r);
445 
446 
447 
448 const char * rSimpleOrdStr(int ord);
449 rRingOrder_t rOrderName(char * ordername);
450 char * rOrdStr(ring r);
451 char * rVarStr(ring r);
452 char * rCharStr(ring r);
453 char * rString(ring r);
454 int rChar(ring r);
455 
456 char * rParStr(ring r);
457 
458 int rSum(ring r1, ring r2, ring &sum);
459 /// returns -1 for not compatible, 1 for compatible (and sum)
460 /// dp_dp:0: block ordering, 1: dp,dp, 2: aa(...),dp
461 /// vartest: check for name conflicts
462 int rSumInternal(ring r1, ring r2, ring &sum, BOOLEAN vartest, BOOLEAN dp_dp);
463 
464 /// returns TRUE, if r1 equals r2 FALSE, otherwise Equality is
465 /// determined componentwise, if qr == 1, then qrideal equality is
466 /// tested, as well
467 BOOLEAN rEqual(ring r1, ring r2, BOOLEAN qr = TRUE);
468 
469 /// returns TRUE, if r1 and r2 represents the monomials in the same way
470 /// FALSE, otherwise
471 /// this is an analogue to rEqual but not so strict
472 BOOLEAN rSamePolyRep(ring r1, ring r2);
473 
474 void rUnComplete(ring r);
475 
476 BOOLEAN rRing_is_Homog(const ring r);
477 BOOLEAN rRing_has_CompLastBlock(const ring r);
478 BOOLEAN rRing_ord_pure_dp(const ring r);
479 BOOLEAN rRing_ord_pure_Dp(const ring r);
480 BOOLEAN rRing_ord_pure_lp(const ring r);
481 
482 #ifdef HAVE_RINGS
483 static inline BOOLEAN rField_is_Ring_2toM(const ring r)
484 { assume(r != NULL); assume(r->cf != NULL); return ( nCoeff_is_Ring_2toM(r->cf) ); }
485 
486 static inline BOOLEAN rField_is_Ring_PtoM(const ring r)
487 { assume(r != NULL); assume(r->cf != NULL); return ( nCoeff_is_Ring_PtoM(r->cf) ); }
488 
489 static inline BOOLEAN rField_is_Ring(const ring r)
490 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_Ring(r->cf); }
491 
492 static inline BOOLEAN rField_is_Domain(const ring r)
493 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_Domain(r->cf); }
494 
495 static inline BOOLEAN rField_has_Units(const ring r)
496 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_has_Units(r->cf); }
497 #else
498 #define rField_is_Ring(A) (0)
499 #define rField_is_Ring_2toM(A) (0)
500 #define rField_is_Ring_PtoM(A) (0)
501 #define rField_is_Domain(A) (1)
502 #define rField_has_Units(A) (1)
503 #endif
504 
505 static inline BOOLEAN rField_is_Zp(const ring r)
506 { assume(r != NULL); assume(r->cf != NULL); return (getCoeffType(r->cf) == n_Zp); }
507 
508 static inline BOOLEAN rField_is_Zp(const ring r, int p)
509 { assume(r != NULL); assume(r->cf != NULL); return (getCoeffType(r->cf) == n_Zp) && (r->cf->ch == p); }
510 
511 static inline BOOLEAN rField_is_Q(const ring r)
512 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_Q(r->cf); }
513 
514 static inline BOOLEAN rField_is_Z(const ring r)
515 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_Z(r->cf); }
516 
517 static inline BOOLEAN rField_is_Zn(const ring r)
518 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_Zn(r->cf); }
519 
520 static inline BOOLEAN rField_is_numeric(const ring r) /* R, long R, long C */
521 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_numeric(r->cf); }
522 
523 static inline BOOLEAN rField_is_R(const ring r)
524 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_R(r->cf); }
525 
526 static inline BOOLEAN rField_is_GF(const ring r)
527 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_GF(r->cf); }
528 
529 static inline BOOLEAN rField_is_GF(const ring r, int q)
530 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_GF(r->cf, q); }
531 
532 /* DO NOT USE; just here for compatibility reasons towards
533  the SINGULAR svn trunk */
534 static inline BOOLEAN rField_is_Zp_a(const ring r)
535 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_Zp_a(r->cf); }
536 
537 /* DO NOT USE; just here for compatibility reasons towards
538  the SINGULAR svn trunk */
539 static inline BOOLEAN rField_is_Zp_a(const ring r, int p)
540 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_Zp_a(r->cf, p); }
541 
542 /* DO NOT USE; just here for compatibility reasons towards
543  the SINGULAR svn trunk */
544 static inline BOOLEAN rField_is_Q_a(const ring r)
545 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_Q_a(r->cf); }
546 
547 static inline BOOLEAN rField_is_long_R(const ring r)
548 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_long_R(r->cf); }
549 
550 static inline BOOLEAN rField_is_long_C(const ring r)
551 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_long_C(r->cf); }
552 
553 static inline BOOLEAN rField_has_simple_inverse(const ring r)
554 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_has_simple_inverse(r->cf); }
555 
556 /// Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies
557 static inline BOOLEAN rField_has_simple_Alloc(const ring r)
558 { assume(r != NULL); assume(r->cf != NULL); return nCoeff_has_simple_Alloc(r->cf); }
559 
560 /// the type of the coefficient filed of r (n_Zp, n_Q, etc)
561 static inline n_coeffType rFieldType(const ring r) { return (r->cf->type); }
562 
563 /// this needs to be called whenever a new ring is created: new fields
564 /// in ring are created (like VarOffset), unless they already exist
565 /// with force == 1, new fields are _always_ created (overwritten),
566 /// even if they exist
567 BOOLEAN rComplete(ring r, int force = 0);
568 // use this to free fields created by rComplete //?
569 
570 /// set all properties of a new ring - also called by rComplete
571 void p_SetGlobals(const ring r, BOOLEAN complete = TRUE);
572 
573 static inline int rBlocks(ring r)
574 {
575  assume(r != NULL);
576  int i=0;
577  while (r->order[i]!=0) i++;
578  return i+1;
579 }
580 
581 // misc things
582 static inline char* rRingVar(short i, const ring r)
583 {
584  assume(r != NULL); assume(r->cf != NULL); return r->names[i];
585 }
586 static inline BOOLEAN rShortOut(const ring r)
587 {
588  assume(r != NULL); return (r->ShortOut);
589 }
590 
591 static inline BOOLEAN rCanShortOut(const ring r)
592 {
593  assume(r != NULL); return (r->CanShortOut);
594 }
595 
596 /// #define rVar(r) (r->N)
597 static inline short rVar(const ring r)
598 {
599  assume(r != NULL);
600  return r->N;
601 }
602 
603 /// (r->cf->P)
604 static inline int rPar(const ring r)
605 {
606  assume(r != NULL);
607  const coeffs C = r->cf;
608  assume(C != NULL);
609 
610  return n_NumberOfParameters(C);
611 // if( nCoeff_is_Extension(C) )
612 // {
613 // const ring R = C->extRing;
614 // assume( R != NULL );
615 // return rVar( R );
616 // }
617 // else if (nCoeff_is_GF(C))
618 // {
619 // return 1;
620 // }
621 // else if (nCoeff_is_long_C(C))
622 // {
623 // return 1;
624 // }
625 // return 0;
626 }
627 
628 
629 /// (r->cf->parameter)
630 static inline char const ** rParameter(const ring r)
631 {
632  assume(r != NULL);
633  const coeffs C = r->cf;
634  assume(C != NULL);
635 
636  return n_ParameterNames(C);
637 // if( nCoeff_is_Extension(C) ) // only alg / trans. exts...
638 // {
639 // const ring R = C->extRing;
640 // assume( R != NULL );
641 // return R->names;
642 // }
643 // else if (nCoeff_is_GF(C))
644 // {
645 // return &(C->m_nfParameter);
646 // }
647 // else if (nCoeff_is_long_C(C))
648 // {
649 // return &(C->complex_parameter);
650 // }
651 // return NULL;
652 }
653 
654 /// return the specified parameter as a (new!) number in the given
655 /// polynomial ring, or NULL if invalid
656 /// parameters (as variables) begin with 1!
657 static inline number n_Param(const short iParameter, const ring r)
658 {
659  assume(r != NULL);
660  const coeffs C = r->cf;
661  assume(C != NULL);
662  return n_Param(iParameter, C);
663 // const n_coeffType _filed_type = getCoeffType(C);
664 //
665 // if ( iParameter <= 0 || iParameter > rPar(r) )
666 // // Wrong parameter
667 // return NULL;
668 //
669 // if( _filed_type == n_algExt )
670 // return naParameter(iParameter, C);
671 //
672 // if( _filed_type == n_transExt )
673 // return ntParameter(iParameter, C);
674 //
675 // if (_filed_type == n_GF)// if (nCoeff_is_GF(C))
676 // {
677 // number nfPar (int i, const coeffs);
678 // return nfPar(iParameter, C);
679 // }
680 //
681 // if (_filed_type == n_long_C) // if (nCoeff_is_long_C(C))
682 // {
683 // number ngcPar(int i, const coeffs r);
684 // return ngcPar(iParameter, C);
685 // }
686 //
687 // return NULL;
688 }
689 
690 /// if m == var(i)/1 => return i,
691 int n_IsParam(number m, const ring r);
692 
693 //#define rInternalChar(r) ((r)->cf->ch)
694 static inline int rInternalChar(const ring r)
695 {
696  assume(r != NULL);
697  const coeffs C = r->cf;
698  assume(C != NULL);
699  return C->ch;
700 }
701 
702 
703 /// Tests whether '(r->cf->minpoly) == NULL'
704 static inline BOOLEAN rMinpolyIsNULL(const ring r)
705 {
706  assume(r != NULL);
707  const coeffs C = r->cf;
708  assume(C != NULL);
709 
710  const BOOLEAN ret = nCoeff_is_algExt(C); // || nCoeff_is_GF(C) || nCoeff_is_long_C(C);
711 
712  if( ret )
713  {
714  assume( (C->extRing) != NULL );
715  BOOLEAN idIs0 (ideal h);
716  assume((!((C->extRing)->qideal==NULL)) && (!idIs0((C->extRing)->qideal)));
717  }
718 
719  // TODO: this leads to test fails (due to rDecompose?)
720  return !ret;
721 }
722 
723 
724 
725 static inline BOOLEAN rIsSyzIndexRing(const ring r)
726 { assume(r != NULL); assume(r->cf != NULL); return r->order[0] == ringorder_s;}
727 
728 static inline int rGetCurrSyzLimit(const ring r)
729 { assume(r != NULL); assume(r->cf != NULL); return (rIsSyzIndexRing(r)? r->typ[0].data.syz.limit : 0);}
730 
731 void rSetSyzComp(int k, const ring r);
732 
733 // Ring Manipulations
734 ring rAssure_HasComp(const ring r);
735 ring rAssure_SyzOrder(const ring r, BOOLEAN complete);
736 ring rAssure_SyzComp(const ring r, BOOLEAN complete = TRUE);
737 ring rAssure_InducedSchreyerOrdering(const ring r, BOOLEAN complete = TRUE, int sgn = 1);
738 
739 ring rAssure_dp_S(const ring r);
740 ring rAssure_dp_C(const ring r);
741 ring rAssure_C_dp(const ring r);
742 ring rAssure_c_dp(const ring r);
743 
744 /// makes sure that c/C ordering is last ordering
745 ring rAssure_CompLastBlock(const ring r, BOOLEAN complete = TRUE);
746 
747 /// makes sure that c/C ordering is last ordering and SyzIndex is first
748 ring rAssure_SyzComp_CompLastBlock(const ring r);
749 ring rAssure_TDeg(const ring r, int &pos);
750 
751 /// return the max-comonent wchich has syzIndex i
752 /// Assume: i<= syzIndex_limit
753 int rGetMaxSyzComp(int i, const ring r);
754 
755 BOOLEAN rHasSimpleOrder(const ring r);
756 BOOLEAN rHas_c_Ordering(const ring r);
757 
758 /// returns TRUE, if simple lp or ls ordering
759 BOOLEAN rHasSimpleLexOrder(const ring r);
760 
761 //???? return TRUE if p->exp[r->pOrdIndex] holds total degree of p ???
762 
763 
764 inline BOOLEAN rHasGlobalOrdering(const ring r){ return (r->OrdSgn==1); }
765 inline BOOLEAN rHasLocalOrMixedOrdering(const ring r){ return (r->OrdSgn==-1); }
766 inline BOOLEAN rHasMixedOrdering(const ring r) { return (r->MixedOrder); }
767 
768 // #define rHasGlobalOrdering(R) ((R)->OrdSgn==1)
769 // #define rHasLocalOrMixedOrdering(R) ((R)->OrdSgn==-1)
770 
772 
773 /// return TRUE if p_SetComp requires p_Setm
774 BOOLEAN rOrd_SetCompRequiresSetm(const ring r);
776 
777 /// returns TRUE if var(i) belongs to p-block
778 BOOLEAN rIsPolyVar(int i, const ring r);
779 
780 static inline BOOLEAN rOrd_is_Comp_dp(const ring r)
781 {
782  assume(r != NULL);
783  assume(r->cf != NULL);
784  return ((r->order[0] == ringorder_c || r->order[0] == ringorder_C) &&
785  r->order[1] == ringorder_dp &&
786  r->order[2] == 0);
787 }
788 
789 #ifdef RDEBUG
790 #define rTest(r) rDBTest(r, __FILE__, __LINE__)
791 extern BOOLEAN rDBTest(ring r, const char* fn, const int l);
792 #else
793 #define rTest(r) (TRUE)
794 #endif
795 
796 ring rModifyRing(ring r, BOOLEAN omit_degree,
797  BOOLEAN omit_comp,
798  unsigned long exp_limit);
799 
800 /// construct Wp, C ring
801 ring rModifyRing_Wp(ring r, int* weights);
802 void rModify_a_to_A(ring r);
803 
804 void rKillModifiedRing(ring r);
805 // also frees weights
806 void rKillModified_Wp_Ring(ring r);
807 
808 ring rModifyRing_Simple(ring r, BOOLEAN omit_degree, BOOLEAN omit_comp, unsigned long exp_limit, BOOLEAN &simple);
809 
810 #ifdef RDEBUG
811 void rDebugPrint(const ring r);
812 // void pDebugPrint(poly p);
813 void p_DebugPrint(poly p, const ring r);
814 #endif
815 
816 int64 * rGetWeightVec(const ring r);
817 void rSetWeightVec(ring r, int64 *wv);
818 
819 /////////////////////////////
820 // Auxillary functions
821 //
822 
823 /* return the varIndex-th ring variable as a poly;
824  varIndex starts at index 1 */
825 poly rGetVar(const int varIndex, const ring r);
826 
827 BOOLEAN rSetISReference(const ring r, const ideal F, const int i = 0, const int p = 0);
828 
829 /// return the position of the p^th IS block order block in r->typ[]...
830 int rGetISPos(const int p, const ring r);
831 void pISUpdateComponents(ideal F, const intvec *const V, const int MIN, const ring r);
832 
833 BOOLEAN rCheckIV(const intvec *iv);
834 int rTypeOfMatrixOrder(const intvec *order);
835 
836 void rDelete(ring r); // To be used instead of rKill!
837 
839 
840 // ring manipulation
841 /// K[x],"y" -> K[x,y] resp. K[y,x]
842 ring rPlusVar(const ring r, char *v,int left);
843 
844 /// undo rPlusVar
845 ring rMinusVar(const ring r, char *v);
846 
847 static inline ring rIncRefCnt(ring r) { r->ref++; return r; }
848 static inline void rDecRefCnt(ring r) { r->ref--; }
849 #endif
int sgn(const Rational &a)
Definition: GMPrat.cc:430
All the auxiliary stuff.
long int64
Definition: auxiliary.h:68
int BOOLEAN
Definition: auxiliary.h:87
#define TRUE
Definition: auxiliary.h:100
#define FALSE
Definition: auxiliary.h:96
const CanonicalForm CFMap CFMap & N
Definition: cfEzgcd.cc:56
int l
Definition: cfEzgcd.cc:100
int m
Definition: cfEzgcd.cc:128
int i
Definition: cfEzgcd.cc:132
int k
Definition: cfEzgcd.cc:99
int p
Definition: cfModGcd.cc:4080
CanonicalForm cf
Definition: cfModGcd.cc:4085
CanonicalForm map(const CanonicalForm &primElem, const Variable &alpha, const CanonicalForm &F, const Variable &beta)
map from to such that is mapped onto
Definition: cf_map_ext.cc:504
Definition: idrec.h:35
Definition: intvec.h:23
Coefficient rings, fields and other domains suitable for Singular polynomials.
static FORCE_INLINE BOOLEAN nCoeff_has_Units(const coeffs r)
returns TRUE, if r is not a field and r has non-trivial units
Definition: coeffs.h:821
static FORCE_INLINE BOOLEAN nCoeff_is_GF(const coeffs r)
Definition: coeffs.h:863
static FORCE_INLINE BOOLEAN nCoeff_is_Z(const coeffs r)
Definition: coeffs.h:840
static FORCE_INLINE BOOLEAN nCoeff_is_long_R(const coeffs r)
Definition: coeffs.h:915
static FORCE_INLINE BOOLEAN nCoeff_is_Ring_PtoM(const coeffs r)
Definition: coeffs.h:751
n_coeffType
Definition: coeffs.h:28
@ n_Zp
\F{p < 2^31}
Definition: coeffs.h:30
static FORCE_INLINE BOOLEAN nCoeff_is_numeric(const coeffs r)
Definition: coeffs.h:856
static FORCE_INLINE BOOLEAN nCoeff_is_Domain(const coeffs r)
returns TRUE, if r is a field or r has no zero divisors (i.e is a domain)
Definition: coeffs.h:763
static FORCE_INLINE BOOLEAN nCoeff_is_Zp_a(const coeffs r)
Definition: coeffs.h:883
static FORCE_INLINE BOOLEAN nCoeff_has_simple_inverse(const coeffs r)
TRUE, if the computation of the inverse is fast, i.e. prefer leading coeff. 1 over content.
Definition: coeffs.h:926
static FORCE_INLINE BOOLEAN nCoeff_is_Q(const coeffs r)
Definition: coeffs.h:830
static FORCE_INLINE char const ** n_ParameterNames(const coeffs r)
Returns a (const!) pointer to (const char*) names of parameters.
Definition: coeffs.h:802
static FORCE_INLINE BOOLEAN nCoeff_has_simple_Alloc(const coeffs r)
TRUE if n_Delete/n_New are empty operations.
Definition: coeffs.h:930
static FORCE_INLINE BOOLEAN nCoeff_is_Ring(const coeffs r)
Definition: coeffs.h:754
static FORCE_INLINE n_coeffType getCoeffType(const coeffs r)
Returns the type of coeffs domain.
Definition: coeffs.h:422
static FORCE_INLINE BOOLEAN nCoeff_is_Zn(const coeffs r)
Definition: coeffs.h:850
static FORCE_INLINE int n_NumberOfParameters(const coeffs r)
Returns the number of parameters.
Definition: coeffs.h:798
static FORCE_INLINE BOOLEAN nCoeff_is_Q_a(const coeffs r)
Definition: coeffs.h:909
static FORCE_INLINE BOOLEAN nCoeff_is_Ring_2toM(const coeffs r)
Definition: coeffs.h:748
static FORCE_INLINE BOOLEAN nCoeff_is_algExt(const coeffs r)
TRUE iff r represents an algebraic extension field.
Definition: coeffs.h:934
static FORCE_INLINE BOOLEAN nCoeff_is_R(const coeffs r)
Definition: coeffs.h:860
static FORCE_INLINE BOOLEAN nCoeff_is_long_C(const coeffs r)
Definition: coeffs.h:918
const Variable & v
< [in] a sqrfree bivariate poly
Definition: facBivar.h:39
#define const
Definition: fegetopt.c:41
#define EXTERN_VAR
Definition: globaldefs.h:6
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
static BOOLEAN length(leftv result, leftv arg)
Definition: interval.cc:257
STATIC_VAR Poly * h
Definition: janet.cc:971
#define assume(x)
Definition: mod2.h:387
The main handler for Singular numbers which are suitable for Singular polynomials.
Definition: qr.h:46
#define MIN(a, b)
Definition: omDebug.c:102
#define NULL
Definition: omList.c:12
omBin_t * omBin
Definition: omStructs.h:12
BOOLEAN rOrd_SetCompRequiresSetm(const ring r)
return TRUE if p_SetComp requires p_Setm
Definition: ring.cc:1910
ring rOpposite(ring r)
Definition: ring.cc:5253
static BOOLEAN rField_is_Ring(const ring r)
Definition: ring.h:489
static BOOLEAN rField_is_R(const ring r)
Definition: ring.h:523
int rSum(ring r1, ring r2, ring &sum)
Definition: ring.cc:1347
short place
Definition: ring.h:134
static int rBlocks(ring r)
Definition: ring.h:573
int * weights_m
Definition: ring.h:140
short end
Definition: ring.h:136
int n_IsParam(number m, const ring r)
if m == var(i)/1 => return i,
Definition: ring.cc:5768
static char * rRingVar(short i, const ring r)
Definition: ring.h:582
BOOLEAN rComplete(ring r, int force=0)
this needs to be called whenever a new ring is created: new fields in ring are created (like VarOffse...
Definition: ring.cc:3403
int * Components
Definition: ring.h:170
void rGetSComps(int **currComponents, long **currShiftedComponents, int *length, ring r)
Definition: ring.cc:4405
static BOOLEAN rField_is_Zp_a(const ring r)
Definition: ring.h:534
BOOLEAN rRing_ord_pure_Dp(const ring r)
Definition: ring.cc:5174
ring rModifyRing_Wp(ring r, int *weights)
construct Wp, C ring
Definition: ring.cc:2893
short end
Definition: ring.h:151
void pISUpdateComponents(ideal F, const intvec *const V, const int MIN, const ring r)
Definition: ring.cc:4317
char * rVarStr(ring r)
Definition: ring.cc:624
short place
Definition: ring.h:159
short place
Definition: ring.h:149
void rSetWeightVec(ring r, int64 *wv)
Definition: ring.cc:5204
static BOOLEAN rField_is_Z(const ring r)
Definition: ring.h:514
const char * rSimpleOrdStr(int ord)
Definition: ring.cc:77
static BOOLEAN rField_is_Zp(const ring r)
Definition: ring.h:505
short start
Definition: ring.h:125
int r_IsRingVar(const char *n, char **names, int N)
Definition: ring.cc:212
struct p_Procs_s p_Procs_s
Definition: ring.h:23
int rGetISPos(const int p, const ring r)
return the position of the p^th IS block order block in r->typ[]...
Definition: ring.cc:4950
static BOOLEAN rField_is_Ring_PtoM(const ring r)
Definition: ring.h:486
short place
Definition: ring.h:124
short start
Definition: ring.h:196
BOOLEAN rHasSimpleLexOrder(const ring r)
returns TRUE, if simple lp or ls ordering
Definition: ring.cc:1836
void p_DebugPrint(poly p, const ring r)
Definition: ring.cc:4280
void rKillModifiedRing(ring r)
Definition: ring.cc:3007
void(* p_SetmProc)(poly p, const ring r)
Definition: ring.h:39
BOOLEAN rRing_ord_pure_dp(const ring r)
Definition: ring.cc:5164
short end
Definition: ring.h:117
static n_coeffType rFieldType(const ring r)
the type of the coefficient filed of r (n_Zp, n_Q, etc)
Definition: ring.h:561
static BOOLEAN rIsPluralRing(const ring r)
we must always have this test!
Definition: ring.h:400
static BOOLEAN rField_is_long_C(const ring r)
Definition: ring.h:550
ro_typ ord_typ
Definition: ring.h:220
int * pVarOffset
Definition: ring.h:198
static BOOLEAN rOrd_is_Comp_dp(const ring r)
Definition: ring.h:780
ring rAssure_CompLastBlock(const ring r, BOOLEAN complete=TRUE)
makes sure that c/C ordering is last ordering
Definition: ring.cc:4658
ring rCopy0AndAddA(ring r, int64vec *wv64, BOOLEAN copy_qideal=TRUE, BOOLEAN copy_ordering=TRUE)
Definition: ring.cc:1495
ideal(* BBA_Proc)(const ideal, const ideal, const intvec *, const intvec *, kStrategy strat, const ring)
Definition: ring.h:244
int * weights
Definition: ring.h:138
ring rAssure_c_dp(const ring r)
Definition: ring.cc:4940
long(* pFDegProc)(poly p, ring r)
Definition: ring.h:38
static int rGetCurrSyzLimit(const ring r)
Definition: ring.h:728
char * rCharStr(ring r)
TODO: make it a virtual method of coeffs, together with: Decompose & Compose, rParameter & rPar.
Definition: ring.cc:648
rOrderType_t rGetOrderType(ring r)
Definition: ring.cc:1757
int rChar(ring r)
Definition: ring.cc:714
int rTypeOfMatrixOrder(const intvec *order)
Definition: ring.cc:185
char * rOrdStr(ring r)
Definition: ring.cc:523
void rUnComplete(ring r)
Definition: ring.cc:3918
static ring rIncRefCnt(ring r)
Definition: ring.h:847
static char const ** rParameter(const ring r)
(r->cf->parameter)
Definition: ring.h:630
ring rModifyRing_Simple(ring r, BOOLEAN omit_degree, BOOLEAN omit_comp, unsigned long exp_limit, BOOLEAN &simple)
Definition: ring.cc:2941
void rKillModified_Wp_Ring(ring r)
Definition: ring.cc:3017
static BOOLEAN rField_is_Domain(const ring r)
Definition: ring.h:492
int curr_index
Definition: ring.h:183
ring rMinusVar(const ring r, char *v)
undo rPlusVar
Definition: ring.cc:5871
short place
Definition: ring.h:115
BOOLEAN rRing_has_CompLastBlock(const ring r)
Definition: ring.cc:5157
short place
Definition: ring.h:180
long(* pLDegProc)(poly p, int *length, ring r)
Definition: ring.h:37
kBucket * kBucket_pt
Definition: ring.h:24
BOOLEAN rOrd_is_Totaldegree_Ordering(const ring r)
Definition: ring.cc:1930
static BOOLEAN rIsRatGRing(const ring r)
Definition: ring.h:430
static BOOLEAN rField_is_Zn(const ring r)
Definition: ring.h:517
static int rPar(const ring r)
(r->cf->P)
Definition: ring.h:604
ring rAssure_SyzOrder(const ring r, BOOLEAN complete)
Definition: ring.cc:4421
poly(* NF_Proc)(ideal, ideal, poly, int, int, const ring _currRing)
Definition: ring.h:243
ring rAssure_C_dp(const ring r)
Definition: ring.cc:4935
skStrategy * kStrategy
Definition: ring.h:240
BOOLEAN rSetISReference(const ring r, const ideal F, const int i=0, const int p=0)
Changes r by setting induced ordering parameters: limit and reference leading terms F belong to r,...
Definition: ring.cc:4982
BOOLEAN rHasSimpleOrder(const ring r)
Definition: ring.cc:1804
ideal F
Definition: ring.h:212
ro_typ
Definition: ring.h:51
@ ro_wp64
Definition: ring.h:55
@ ro_syz
Definition: ring.h:60
@ ro_cp
Definition: ring.h:58
@ ro_dp
Definition: ring.h:52
@ ro_is
Definition: ring.h:61
@ ro_wp_neg
Definition: ring.h:56
@ ro_wp
Definition: ring.h:53
@ ro_isTemp
Definition: ring.h:61
@ ro_am
Definition: ring.h:54
@ ro_none
Definition: ring.h:62
@ ro_syzcomp
Definition: ring.h:59
ring rAssure_SyzComp(const ring r, BOOLEAN complete=TRUE)
Definition: ring.cc:4426
int rGetMaxSyzComp(int i, const ring r)
return the max-comonent wchich has syzIndex i Assume: i<= syzIndex_limit
Definition: ring.cc:5108
static int rInternalChar(const ring r)
Definition: ring.h:694
static BOOLEAN rIsLPRing(const ring r)
Definition: ring.h:411
ring rAssure_HasComp(const ring r)
Definition: ring.cc:4603
int limit
Definition: ring.h:181
BOOLEAN rEqual(ring r1, ring r2, BOOLEAN qr=TRUE)
returns TRUE, if r1 equals r2 FALSE, otherwise Equality is determined componentwise,...
Definition: ring.cc:1663
rRingOrder_t
order stuff
Definition: ring.h:68
@ ringorder_lp
Definition: ring.h:77
@ ringorder_a
Definition: ring.h:70
@ ringorder_am
Definition: ring.h:88
@ ringorder_a64
for int64 weights
Definition: ring.h:71
@ ringorder_rs
opposite of ls
Definition: ring.h:92
@ ringorder_C
Definition: ring.h:73
@ ringorder_S
S?
Definition: ring.h:75
@ ringorder_ds
Definition: ring.h:84
@ ringorder_Dp
Definition: ring.h:80
@ ringorder_unspec
Definition: ring.h:94
@ ringorder_L
Definition: ring.h:89
@ ringorder_Ds
Definition: ring.h:85
@ ringorder_dp
Definition: ring.h:78
@ ringorder_c
Definition: ring.h:72
@ ringorder_rp
Definition: ring.h:79
@ ringorder_aa
for idElimination, like a, except pFDeg, pWeigths ignore it
Definition: ring.h:91
@ ringorder_no
Definition: ring.h:69
@ ringorder_Wp
Definition: ring.h:82
@ ringorder_ws
Definition: ring.h:86
@ ringorder_Ws
Definition: ring.h:87
@ ringorder_IS
Induced (Schreyer) ordering.
Definition: ring.h:93
@ ringorder_ls
Definition: ring.h:83
@ ringorder_s
s?
Definition: ring.h:76
@ ringorder_wp
Definition: ring.h:81
@ ringorder_M
Definition: ring.h:74
static BOOLEAN rField_is_Q_a(const ring r)
Definition: ring.h:544
ring rCopy0(const ring r, BOOLEAN copy_qideal=TRUE, BOOLEAN copy_ordering=TRUE)
Definition: ring.cc:1366
BOOLEAN rHas_c_Ordering(const ring r)
Definition: ring.cc:1800
static BOOLEAN rField_is_Q(const ring r)
Definition: ring.h:511
ring rEnvelope(ring r)
Definition: ring.cc:5643
int limit
Definition: ring.h:209
void rDebugPrint(const ring r)
Definition: ring.cc:4075
void rWrite(ring r, BOOLEAN details=FALSE)
Definition: ring.cc:226
static BOOLEAN rField_has_Units(const ring r)
Definition: ring.h:495
static BOOLEAN rShortOut(const ring r)
Definition: ring.h:586
BOOLEAN rIsPolyVar(int i, const ring r)
returns TRUE if var(i) belongs to p-block
Definition: ring.cc:1953
BOOLEAN rRing_ord_pure_lp(const ring r)
Definition: ring.cc:5184
poly rGetVar(const int varIndex, const ring r)
Definition: ring.cc:5758
rOrderType_t
Definition: ring.h:98
@ rOrderType_Syz
syzygy ordering
Definition: ring.h:105
@ rOrderType_Syz2dpc
syzcomp2dpc
Definition: ring.h:107
@ rOrderType_CompExp
simple ordering, component has priority
Definition: ring.h:100
@ rOrderType_Exp
simple ordering, exponent vector has priority component is compatible with exp-vector order
Definition: ring.h:103
@ rOrderType_General
non-simple ordering as specified by currRing
Definition: ring.h:99
@ rOrderType_Schreyer
Schreyer ordering.
Definition: ring.h:106
@ rOrderType_ExpNoComp
simple ordering, differences in component are not considered
Definition: ring.h:108
@ rOrderType_ExpComp
simple ordering, exponent vector has priority component not compatible with exp-vector order
Definition: ring.h:101
void rChangeSComps(int *currComponents, long *currShiftedComponents, int length, ring r)
Definition: ring.cc:4396
EXTERN_VAR omBin sip_sring_bin
Definition: ring.h:838
long * ShiftedComponents
Definition: ring.h:169
static BOOLEAN rField_has_simple_Alloc(const ring r)
Z/p, GF(p,n), R: nCopy, nNew, nDelete are dummies.
Definition: ring.h:557
short end
Definition: ring.h:206
static BOOLEAN rIsNCRing(const ring r)
Definition: ring.h:421
union sro_ord::@0 data
char * rString(ring r)
Definition: ring.cc:674
BOOLEAN rSamePolyRep(ring r1, ring r2)
returns TRUE, if r1 and r2 represents the monomials in the same way FALSE, otherwise this is an analo...
Definition: ring.cc:1716
static void rDecRefCnt(ring r)
Definition: ring.h:848
ring rModifyRing(ring r, BOOLEAN omit_degree, BOOLEAN omit_comp, unsigned long exp_limit)
Definition: ring.cc:2646
int64 * rGetWeightVec(const ring r)
Definition: ring.cc:5194
ring rAssure_SyzComp_CompLastBlock(const ring r)
makes sure that c/C ordering is last ordering and SyzIndex is first
Definition: ring.cc:4713
int * syz_index
Definition: ring.h:182
BOOLEAN rCheckIV(const intvec *iv)
Definition: ring.cc:175
short end
Definition: ring.h:161
short start
Definition: ring.h:135
static BOOLEAN rField_is_long_R(const ring r)
Definition: ring.h:547
rRingOrder_t rOrderName(char *ordername)
Definition: ring.cc:509
short end
Definition: ring.h:126
short len_gen
Definition: ring.h:137
short start
Definition: ring.h:150
short start
Definition: ring.h:116
void rModify_a_to_A(ring r)
Definition: ring.cc:5735
static BOOLEAN rField_is_numeric(const ring r)
Definition: ring.h:520
void rDelete(ring r)
unconditionally deletes fields in r
Definition: ring.cc:449
ring rAssure_InducedSchreyerOrdering(const ring r, BOOLEAN complete=TRUE, int sgn=1)
Definition: ring.cc:4814
int64 * weights64
Definition: ring.h:152
short start
Definition: ring.h:160
BOOLEAN rHasMixedOrdering(const ring r)
Definition: ring.h:766
int order_index
Definition: ring.h:221
void p_SetGlobals(const ring r, BOOLEAN complete=TRUE)
set all properties of a new ring - also called by rComplete
Definition: ring.cc:3368
ring rPlusVar(const ring r, char *v, int left)
K[x],"y" -> K[x,y] resp. K[y,x].
Definition: ring.cc:5789
short start
Definition: ring.h:206
static BOOLEAN rCanShortOut(const ring r)
Definition: ring.h:591
char * rParStr(ring r)
Definition: ring.cc:650
static BOOLEAN rIsSyzIndexRing(const ring r)
Definition: ring.h:725
int * weights
Definition: ring.h:127
static BOOLEAN rMinpolyIsNULL(const ring r)
Tests whether '(r->cf->minpoly) == NULL'.
Definition: ring.h:704
ring rDefault(int ch, int N, char **n)
Definition: ring.cc:155
int * pVarOffset
Definition: ring.h:207
short place
Definition: ring.h:168
static BOOLEAN rField_is_Ring_2toM(const ring r)
Definition: ring.h:483
poly(* pShallowCopyDeleteProc)(poly s_p, ring source_r, ring dest_r, omBin dest_bin)
returns a poly from dest_r which is a ShallowCopy of s_p from source_r assumes that source_r->N == de...
Definition: ring.h:44
static number n_Param(const short iParameter, const ring r)
return the specified parameter as a (new!) number in the given polynomial ring, or NULL if invalid pa...
Definition: ring.h:657
static BOOLEAN rField_is_GF(const ring r)
Definition: ring.h:526
int suffixpos
Definition: ring.h:197
static short rVar(const ring r)
#define rVar(r) (r->N)
Definition: ring.h:597
ring rAssure_dp_S(const ring r)
Definition: ring.cc:4925
ring rAssure_TDeg(const ring r, int &pos)
Definition: ring.cc:4504
int rSumInternal(ring r1, ring r2, ring &sum, BOOLEAN vartest, BOOLEAN dp_dp)
returns -1 for not compatible, 1 for compatible (and sum) dp_dp:0: block ordering,...
Definition: ring.cc:750
BOOLEAN rHasGlobalOrdering(const ring r)
Definition: ring.h:764
BOOLEAN rHasLocalOrMixedOrdering(const ring r)
Definition: ring.h:765
void rSetSyzComp(int k, const ring r)
Definition: ring.cc:5036
BOOLEAN rRing_is_Homog(const ring r)
Definition: ring.cc:5135
long length
Definition: ring.h:172
static BOOLEAN rField_has_simple_inverse(const ring r)
Definition: ring.h:553
ring rAssure_dp_C(const ring r)
Definition: ring.cc:4930
ring rCopy(ring r)
Definition: ring.cc:1648
idrec * idhdl
Definition: ring.h:21
BOOLEAN rDBTest(ring r, const char *fn, const int l)
Definition: ring.cc:1992
unsigned long rGetExpSize(unsigned long bitmask, int &bits, int N)
Definition: ring.cc:2606
Definition: ring.h:205
Definition: ring.h:133
Definition: ring.h:158
Definition: ring.h:114
Definition: ring.h:219
Definition: ring.h:179
Definition: ring.h:123
Definition: ring.h:148
The following sip_sideal structure has many different uses thoughout Singular. Basic use-cases for it...
Definition: simpleideals.h:18
Definition: ring.h:248
poly ppNoether
Definition: ring.h:287
n_Procs_s * cf
Definition: ring.h:368
short ExpPerLong
Definition: ring.h:335
int * block0
Definition: ring.h:254
int * NegWeightL_Offset
Definition: ring.h:269
p_SetmProc p_Setm
Definition: ring.h:367
BOOLEAN pLexOrder
Definition: ring.h:322
void * ext_ref
Definition: ring.h:289
short pCompIndex
Definition: ring.h:336
short pOrdIndex
Definition: ring.h:337
pFDegProc pFDegOrig
Definition: ring.h:363
short N
Definition: ring.h:303
int * firstwv
Definition: ring.h:283
short VarL_Size
Definition: ring.h:333
intvec * pModW
Definition: ring.h:286
short LPncGenCount
Definition: ring.h:314
int * block1
Definition: ring.h:255
short real_var_end
Definition: ring.h:309
short firstBlockEnds
Definition: ring.h:307
BOOLEAN CanShortOut
Definition: ring.h:319
rRingOrder_t * order
Definition: ring.h:253
short NegWeightL_Size
Definition: ring.h:344
unsigned long options
Definition: ring.h:298
pFDegProc pFDeg
Definition: ring.h:359
unsigned long wanted_maxExp
Definition: ring.h:352
int * VarL_Offset
Definition: ring.h:347
omBin PolyBin
Definition: ring.h:285
nc_struct * _nc
Definition: ring.h:371
int * VarOffset
Definition: ring.h:271
short CmpL_Size
Definition: ring.h:329
BOOLEAN ComponentOrder
Definition: ring.h:324
idhdl idroot
Definition: ring.h:252
BOOLEAN MixedOrder
Definition: ring.h:321
long * ordsgn
Definition: ring.h:261
short VarL_LowIndex
Definition: ring.h:342
int ** wvhdl
Definition: ring.h:257
BOOLEAN LexOrder
Definition: ring.h:320
unsigned long divmask
Definition: ring.h:354
p_Procs_s * p_Procs
Definition: ring.h:356
unsigned long bitmask
Definition: ring.h:350
ideal qideal
extension to the ring structure: qring, rInit, OR for Q_a/Zp_a, rInit (replaces minideal!...
Definition: ring.h:275
pLDegProc pLDeg
Definition: ring.h:360
short real_var_start
Definition: ring.h:309
sro_ord * typ
Definition: ring.h:265
char ** names
Definition: ring.h:258
BOOLEAN ShortOut
Definition: ring.h:318
short isLPring
Definition: ring.h:313
pLDegProc pLDegOrig
Definition: ring.h:365
BOOLEAN VectorOut
Definition: ring.h:317
const nc_struct * GetNC() const
Definition: ring.h:373
short BitsPerExp
Definition: ring.h:334
nc_struct *& GetNC()
Definition: ring.h:374
short ExpL_Size
Definition: ring.h:328
short OrdSize
Definition: ring.h:338
short OrdSgn
Definition: ring.h:305
int ref
Definition: ring.h:301
Definition: nc.h:68
EXTERN_VAR long * currShiftedComponents
Definition: syz.h:118