My Project
Loading...
Searching...
No Matches
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 */
21class idrec; typedef idrec * idhdl; // _only_ for idhdl ip_sring::idroot
22struct p_Procs_s;
23typedef struct p_Procs_s p_Procs_s;
24class kBucket;
26
27struct sip_sideal;
28typedef struct sip_sideal * ideal;
29typedef struct sip_sideal const * const_ideal;
30
31struct sip_smap;
32typedef struct sip_smap * map;
33typedef struct sip_smap const * const_map;
34
35/* the function pointer types */
36
37typedef long (*pLDegProc)(poly p, int *length, ring r);
38typedef long (*pFDegProc)(poly p, ring r);
39typedef 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
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
50typedef 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)
64ro_typ;
65
66/// order stuff
67typedef enum rRingOrder_t
68{
71 ringorder_a64, ///< for int64 weights
75 ringorder_S, ///< S?
76 ringorder_s, ///< s?
83 ringorder_Ip, /// degree, ip
91 // the following are only used internally
92 ringorder_aa, ///< for idElimination, like a, except pFDeg, pWeigths ignore it
93 ringorder_is, ///< opposite of ls
94 ringorder_IS, ///< Induced (Schreyer) ordering
97
98// compat entries:
99#define ringorder_rp ringorder_ip
100#define ringorder_rs ringorder_is
101
102typedef enum rOrderType_t
103{
104 rOrderType_General = 0, ///< non-simple ordering as specified by currRing
105 rOrderType_CompExp, ///< simple ordering, component has priority
106 rOrderType_ExpComp, ///< simple ordering, exponent vector has priority
107 ///< component not compatible with exp-vector order
108 rOrderType_Exp, ///< simple ordering, exponent vector has priority
109 ///< component is compatible with exp-vector order
110 rOrderType_Syz, ///< syzygy ordering
111 rOrderType_Schreyer, ///< Schreyer ordering
112 rOrderType_Syz2dpc, ///< syzcomp2dpc
113 rOrderType_ExpNoComp ///< simple ordering, differences in component are
114 ///< not considered
116
117// ordering is a degree ordering
118struct sro_dp
119{
120 short place; // where degree is stored (in L):
121 short start; // bounds of ordering (in E):
122 short end;
123};
124typedef struct sro_dp sro_dp;
125
126// ordering is a weighted degree ordering
127struct sro_wp
128{
129 short place; // where weighted degree is stored (in L)
130 short start; // bounds of ordering (in E)
131 short end;
132 int *weights; // pointers into wvhdl field
133};
134typedef struct sro_wp sro_wp;
135
136// ordering is a weighted degree ordering
137struct sro_am
138{
139 short place; // where weighted degree is stored (in L)
140 short start; // bounds of ordering (in E)
141 short end;
142 short len_gen; // i>len_gen: weight(gen(i)):=0
143 int *weights; // pointers into wvhdl field of length (end-start+1) + len_gen + 1
144 // contents w_{start},... w_{end}, len, mod_w_1, .. mod_w_len, 0
145 int *weights_m; // pointers into wvhdl field of length len_gen + 1
146 // len_gen, mod_w_1, .. mod_w_len, 0
147
148};
149typedef struct sro_am sro_am;
150
151// ordering is a weighted degree ordering
153{
154 short place; // where weighted degree is stored (in L)
155 short start; // bounds of ordering (in E)
156 short end;
157 int64 *weights64; // pointers into wvhdl field
158};
159typedef struct sro_wp64 sro_wp64;
160
161// ordering duplicates variables
162struct sro_cp
163{
164 short place; // where start is copied to (in E)
165 short start; // bounds of sources of copied variables (in E)
166 short end;
167};
168typedef struct sro_cp sro_cp;
169
170// ordering indicates "subset" of component number
172{
173 short place; // where the index is stored (in L)
174 long *ShiftedComponents; // pointer into index field
176#ifdef PDEBUG
177 long length;
178#endif
179};
180typedef struct sro_syzcomp sro_syzcomp;
181
182// ordering with component number >syzcomp is lower
184{
185 short place; // where the index is stored (in L)
186 int limit; // syzcomp
187 int* syz_index; // mapping Component -> SyzIndex for Comp <= limit
188 int curr_index; // SyzIndex for Component > limit
189};
190
191typedef struct sro_syz sro_syz;
192// Induced Syzygy (Schreyer) ordering is built inductively as follows:
193// we look for changes made by ordering blocks which are between prefix/suffix markers:
194// that is: which variables where placed by them and where (judging by v)
195
196// due to prefix/suffix nature we need some placeholder:
197// prefix stores here initial state
198// suffix cleares this up
200{
201 short start; // 1st member SHOULD be short "place"
203 int* pVarOffset; // copy!
204};
205
206// So this is the actuall thing!
207// suffix uses last sro_ISTemp (cleares it up afterwards) and
208// creates this block
209struct sro_IS
210{
211 short start, end; // which part of L we want to want to update...
212 int* pVarOffset; // same as prefix!
213
214 int limit; // first referenced component
215
216 // reference poly set?? // Should it be owned by ring?!!!
217 ideal F; // reference leading (module)-monomials set. owned by ring...
218};
219
220typedef struct sro_IS sro_IS;
221typedef struct sro_ISTemp sro_ISTemp;
222
224{
226 int order_index; // comes from r->order[order_index]
227 union
228 {
229 sro_dp dp;
230 sro_wp wp;
231 sro_am am;
232 sro_wp64 wp64;
233 sro_cp cp;
234 sro_syzcomp syzcomp;
235 sro_syz syz;
236 sro_IS is;
237 sro_ISTemp isTemp;
239};
240
241#ifdef HAVE_PLURAL
242struct nc_struct;
243typedef struct nc_struct nc_struct;
244#endif
245class skStrategy;
247
248typedef poly (*NF_Proc)(ideal, ideal, poly, int, int, const ring _currRing);
249typedef ideal (*BBA_Proc) (const ideal, const ideal, const intvec *, const intvec *, kStrategy strat, const ring);
250
251
253{
254// each entry must have a description and a procedure defining it,
255// general ordering: pointer/structs, long, int, short, BOOLEAN/char/enum
256// general defining procedures: rInit, rComplete, interpreter, ??
257 idhdl idroot; /* local objects , interpreter*/
258 rRingOrder_t* order; /* array of orderings, rInit/rSleftvOrdering2Ordering */
259 int* block0; /* starting pos., rInit/rSleftvOrdering2Ordering*/
260 int* block1; /* ending pos., rInit/rSleftvOrdering2Ordering*/
261// char** parameter; /* names of parameters, rInit */
262 int** wvhdl; /* array of weight vectors, rInit/rSleftvOrdering2Ordering */
263 char ** names; /* array of variable names, rInit */
264
265 // what follows below here should be set by rComplete, _only_
266 long *ordsgn; /* array of +/- 1 (or 0) for comparing monomials */
267 /* ExpL_Size entries*/
268
269 // is NULL for lp or N == 1, otherwise non-NULL (with OrdSize > 0 entries) */
270 sro_ord* typ; /* array of orderings + sizes, OrdSize entries */
271 /* if NegWeightL_Size > 0, then NegWeightL_Offset[0..size_1] is index of longs
272 in ExpVector whose values need an offset due to negative weights */
273 /* array of NegWeigtL_Size indicies */
275
277
278// ideal minideal;
279// number minpoly; /* replaced by minideal->m[0] */
280 ideal qideal; /**< extension to the ring structure: qring, rInit, OR
281 for Q_a/Zp_a, rInit (replaces minideal!);
282 for a start, we assume that there is either no
283 or exactly one generator in minideal, playing
284 the role of the former minpoly; minideal may
285 also be NULL which coincides with the
286 no-generator-case **/
287
289
290 omBin PolyBin; /* Bin from where monoms are allocated */
291 intvec * pModW; /* std: module weights */
292 poly ppNoether; /* variables, set by procedures from hecke/kstd1:
293 the highest monomial below pHEdge */
294 void * ext_ref; /* libsing GAP object */
295// #ifdef HAVE_RINGS
296// unsigned int cf->ringtype; /* cring = 0 => coefficient field, cring = 1 => coeffs from Z/2^m */
297// mpz_ptr cf->modBase; /* Z/(ringflag^cf->modExponent)=Z/cf->modNumber*/
298// unsigned long cf->modExponent;
299// unsigned long cf->modNumber; /* Z/cf->modNumber */
300// mpz_ptr cf->modNumber;
301// #endif
302
303 unsigned long options; /* ring dependent options */
304
305// int ch; /* characteristic, rInit */
306 int ref; /* reference counter to the ring, interpreter */
307
308 short N; /* number of vars, rInit */
309
310 short OrdSgn; /* 1 for polynomial rings, -1 otherwise, rInit */
311
313#ifdef HAVE_PLURAL
315#endif
316
317#ifdef HAVE_SHIFTBBA
318 short isLPring; /* 0 for non-letterplace rings, otherwise the number of LP blocks, at least 1, known also as lV */
320#endif
321
325 BOOLEAN LexOrder; // TRUE if the monomial ordering has polynomial and power series blocks
326 BOOLEAN MixedOrder; // TRUE for global/local mixed orderings, FALSE otherwise
327 BOOLEAN pLexOrder; /* TRUE if the monomial ordering is not compatible with pFDeg */
328
329 BOOLEAN ComponentOrder; // 1 if ringorder_c, -1 for ringorder_C,ringorder_S,ringorder_s
330
331 // what follows below here should be set by rComplete, _only_
332 // contains component, but no weight fields in E */
333 short ExpL_Size; // size of exponent vector in long
334 short CmpL_Size; // portions which need to be compared
335 /* number of long vars in exp vector:
336 long vars are those longs in the exponent vector which are
337 occupied by variables, only */
339 short BitsPerExp; /* number of bits per exponent */
340 short ExpPerLong; /* maximal number of Exponents per long */
341 short pCompIndex; /* p->exp.e[pCompIndex] is the component */
342 short pOrdIndex; /* p->exp[pOrdIndex] is pGetOrd(p) */
343 short OrdSize; /* size of ord vector (in sro_ord) */
344
345 /* if >= 0, long vars in exp vector are consecutive and start there
346 if < 0, long vars in exp vector are not consecutive */
348
350 /* array of size VarL_Size,
351 VarL_Offset[i] gets i-th long var in exp vector */
353
354 /* mask for getting single exponents, also maxExp */
355 unsigned long bitmask;
356 /* wanted maxExp */
357 unsigned long wanted_maxExp;
358 /* mask used for divisiblity tests */
359 unsigned long divmask; // rComplete
360
361 p_Procs_s* p_Procs; // rComplete/p_ProcsSet
362
363 /* FDeg and LDeg */
364 pFDegProc pFDeg; // rComplete/rSetDegStuff
365 pLDegProc pLDeg; // rComplete/rSetDegStuff
366
367 /* as it was determined by rComplete */
369 /* and as it was determined before rOptimizeLDeg */
371
374#ifdef HAVE_PLURAL
375 private:
376 nc_struct* _nc; // private
377 public:
378 inline const nc_struct* GetNC() const { return _nc; }; // public!!!
379 inline nc_struct*& GetNC() { return _nc; }; // public!!!
380#endif
381 public:
382 operator coeffs() const { return cf; }
383};
384
385////////// DEPRECATED
386/////// void rChangeCurrRing(ring r);
387
388ring rDefault(int ch, int N, char **n);
389ring rDefault(const coeffs cf, int N, char **n, const rRingOrder_t o=ringorder_lp);
390ring rDefault(int ch, int N, char **n,int ord_size, rRingOrder_t *ord, int *block0, int *block1, int **wvhdl=NULL);
391ring 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);
392unsigned long rGetExpSize(unsigned long bitmask, int & bits, int N);
393
394// #define rIsRingVar(A) r_IsRingVar(A,currRing)
395int r_IsRingVar(const char *n, char**names, int N);
396void rWrite(ring r, BOOLEAN details = FALSE);
397ring rCopy(ring r);
403
404/// we must always have this test!
405static inline BOOLEAN rIsPluralRing(const ring r)
406{
407 assume(r != NULL);
408#ifdef HAVE_PLURAL
409 nc_struct *n;
410 return ((n=r->GetNC()) != NULL) /*&& (n->type != nc_error)*/;
411#else
412 return FALSE;
413#endif
414}
415
416static inline BOOLEAN rIsLPRing(const ring r)
417{
418 assume(r != NULL);
419#ifdef HAVE_SHIFTBBA
420 return (r->isLPring!=0);
421#else
422 return FALSE;
423#endif
424}
425
426static inline BOOLEAN rIsNCRing(const ring r)
427{
428 assume(r != NULL);
429 return rIsPluralRing(r) || rIsLPRing(r);
430}
431
432static inline BOOLEAN rIsRatGRing(const ring r)
433{
434 assume(r != NULL);
435#ifdef HAVE_PLURAL
436 /* nc_struct *n; */
437 return (r != NULL) /* && ((n=r->GetNC()) != NULL) */
438 && (r->real_var_start>1);
439#else
440 return FALSE;
441#endif
442}
443
444// The following are for LaScala3 only!
446void rGetSComps(int** currComponents, long** currShiftedComponents, int *length, ring r);
447
448
449
450const char * rSimpleOrdStr(int ord);
452char * rOrdStr(ring r);
453char * rVarStr(ring r);
454char * rCharStr(ring r);
455char * rString(ring r);
456int rChar(ring r);
457
458char * rParStr(ring r);
459
460int rSum(ring r1, ring r2, ring &sum);
461/// returns -1 for not compatible, 1 for compatible (and sum)
462/// dp_dp:0: block ordering, 1: dp,dp, 2: aa(...),dp
463/// vartest: check for name conflicts
465
466/// returns TRUE, if r1 equals r2 FALSE, otherwise Equality is
467/// determined componentwise, if qr == 1, then qrideal equality is
468/// tested, as well
470
471/// returns TRUE, if r1 and r2 represents the monomials in the same way
472/// FALSE, otherwise
473/// this is an analogue to rEqual but not so strict
475
476void rUnComplete(ring r);
477
482
483#ifdef HAVE_RINGS
484static inline BOOLEAN rField_is_Ring_2toM(const ring r)
485{ assume(r != NULL); assume(r->cf != NULL); return ( nCoeff_is_Ring_2toM(r->cf) ); }
486
487static inline BOOLEAN rField_is_Ring_PtoM(const ring r)
488{ assume(r != NULL); assume(r->cf != NULL); return ( nCoeff_is_Ring_PtoM(r->cf) ); }
489
490#define rField_is_Ring(R) nCoeff_is_Ring((R)->cf)
491
492static inline BOOLEAN rField_is_Domain(const ring r)
493{ assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_Domain(r->cf); }
494
495static 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
505static inline BOOLEAN rField_is_Zp(const ring r)
506{ assume(r != NULL); assume(r->cf != NULL); return (getCoeffType(r->cf) == n_Zp); }
507
508static 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
511static inline BOOLEAN rField_is_Q(const ring r)
512{ assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_Q(r->cf); }
513
514static inline BOOLEAN rField_is_Z(const ring r)
515{ assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_Z(r->cf); }
516
517static inline BOOLEAN rField_is_Zn(const ring r)
518{ assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_Zn(r->cf); }
519
520static 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
523static inline BOOLEAN rField_is_R(const ring r)
524{ assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_R(r->cf); }
525
526static inline BOOLEAN rField_is_GF(const ring r)
527{ assume(r != NULL); assume(r->cf != NULL); return nCoeff_is_GF(r->cf); }
528
529static 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 */
534static 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 */
539static 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 */
544static 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
547static 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
550static 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
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
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)
561static 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
567BOOLEAN 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
571void p_SetGlobals(const ring r, BOOLEAN complete = TRUE);
572
573static inline int rBlocks(const 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
582static inline char* rRingVar(short i, const ring r)
583{
584 assume(r != NULL); assume(r->cf != NULL); return r->names[i];
585}
586static inline BOOLEAN rShortOut(const ring r)
587{
588 assume(r != NULL); return (r->ShortOut);
589}
590
591static inline BOOLEAN rCanShortOut(const ring r)
592{
593 assume(r != NULL); return (r->CanShortOut);
594}
595
596/// #define rVar(r) (r->N)
597static inline short rVar(const ring r)
598{
599 assume(r != NULL);
600 return r->N;
601}
602
603/// (r->cf->P)
604static 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)
630static 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!
657static 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,
691int n_IsParam(number m, const ring r);
692
693//#define rInternalChar(r) ((r)->cf->ch)
694static 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'
704static 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 );
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
725static inline BOOLEAN rIsSyzIndexRing(const ring r)
726{ assume(r != NULL); assume(r->cf != NULL); return r->order[0] == ringorder_s;}
727
728static 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
731void rSetSyzComp(int k, const ring r);
732
733// Ring Manipulations
734ring rAssure_HasComp(const ring r);
735ring rAssure_SyzOrder(const ring r, BOOLEAN complete);
736ring rAssure_SyzComp(const ring r, BOOLEAN complete = TRUE);
737ring rAssure_InducedSchreyerOrdering(const ring r, BOOLEAN complete = TRUE, int sgn = 1);
738
739ring rAssure_dp_S(const ring r);
740ring rAssure_dp_C(const ring r);
741ring rAssure_Dp_C(const ring r);
742ring rAssure_Wp_C(const ring r, intvec *w);
743ring rAssure_C_dp(const ring r);
744ring rAssure_c_dp(const ring r);
745
746/// makes sure that c/C ordering is last ordering
747ring rAssure_CompLastBlock(const ring r, BOOLEAN complete = TRUE);
748
749/// makes sure that c/C ordering is last ordering and SyzIndex is first
751ring rAssure_TDeg(const ring r, int &pos);
752
753/// return the max-comonent wchich has syzIndex i
754/// Assume: i<= syzIndex_limit
755int rGetMaxSyzComp(int i, const ring r);
756
759
760/// returns TRUE, if simple lp or ls ordering
762
763//???? return TRUE if p->exp[r->pOrdIndex] holds total degree of p ???
764
765
766inline BOOLEAN rHasGlobalOrdering(const ring r){ return (r->OrdSgn==1); }
767inline BOOLEAN rHasLocalOrMixedOrdering(const ring r){ return (r->OrdSgn==-1); }
768inline BOOLEAN rHasMixedOrdering(const ring r) { return (r->MixedOrder); }
769
770// #define rHasGlobalOrdering(R) ((R)->OrdSgn==1)
771// #define rHasLocalOrMixedOrdering(R) ((R)->OrdSgn==-1)
772
774BOOLEAN rOrd_is_dp(const ring r);
775BOOLEAN rOrd_is_ds(const ring r);
776
777/// return TRUE if p_SetComp requires p_Setm
780
781static inline BOOLEAN rOrd_is_Comp_dp(const ring r)
782{
783 assume(r != NULL);
784 assume(r->cf != NULL);
785 return ((r->order[0] == ringorder_c || r->order[0] == ringorder_C) &&
786 r->order[1] == ringorder_dp &&
787 r->order[2] == 0);
788}
789
790#ifdef RDEBUG
791#define rTest(r) rDBTest(r, __FILE__, __LINE__)
792extern BOOLEAN rDBTest(ring r, const char* fn, const int l);
793#else
794#define rTest(r) (TRUE)
795#endif
796
799 unsigned long exp_limit);
800
801/// construct Wp, C ring
802ring rModifyRing_Wp(ring r, int* weights);
803
804void rKillModifiedRing(ring r);
805// also frees weights
807
809
810#ifdef RDEBUG
811void rDebugPrint(const ring r);
812// void pDebugPrint(poly p);
813void p_DebugPrint(poly p, const ring r);
814#endif
815
816int64 * rGetWeightVec(const ring r);
817void 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 */
825poly rGetVar(const int varIndex, const ring r);
826
827BOOLEAN 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[]...
830int rGetISPos(const int p, const ring r);
831
832BOOLEAN rCheckIV(const intvec *iv);
833int rTypeOfMatrixOrder(const intvec *order);
834
835void rDelete(ring r); // To be used instead of rKill!
836
838
839// ring manipulation
840/// K[x],"y" -> K[x,y] resp. K[y,x]
841ring rPlusVar(const ring r, char *v,int left);
842
843/// undo rPlusVar
844ring rMinusVar(const ring r, char *v);
845
846static inline ring rIncRefCnt(ring r) { r->ref++; return r; }
847static inline void rDecRefCnt(ring r) { r->ref--; }
848#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:4086
CanonicalForm cf
Definition cfModGcd.cc:4091
CanonicalForm map(const CanonicalForm &primElem, const Variable &alpha, const CanonicalForm &F, const Variable &beta)
map from to such that is mapped onto
Definition idrec.h:35
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:790
static FORCE_INLINE BOOLEAN nCoeff_is_GF(const coeffs r)
Definition coeffs.h:832
static FORCE_INLINE BOOLEAN nCoeff_is_Z(const coeffs r)
Definition coeffs.h:809
static FORCE_INLINE BOOLEAN nCoeff_is_long_R(const coeffs r)
Definition coeffs.h:884
static FORCE_INLINE BOOLEAN nCoeff_is_Ring_PtoM(const coeffs r)
Definition coeffs.h:727
n_coeffType
Definition coeffs.h:27
@ n_Zp
\F{p < 2^31}
Definition coeffs.h:29
static FORCE_INLINE BOOLEAN nCoeff_is_numeric(const coeffs r)
Definition coeffs.h:825
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:734
static FORCE_INLINE BOOLEAN nCoeff_is_Zp_a(const coeffs r)
Definition coeffs.h:852
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:895
static FORCE_INLINE char const ** n_ParameterNames(const coeffs r)
Returns a (const!) pointer to (const char*) names of parameters.
Definition coeffs.h:771
static FORCE_INLINE BOOLEAN nCoeff_is_Q(const coeffs r)
Definition coeffs.h:799
static FORCE_INLINE BOOLEAN nCoeff_has_simple_Alloc(const coeffs r)
TRUE if n_Delete is empty operation.
Definition coeffs.h:899
static FORCE_INLINE n_coeffType getCoeffType(const coeffs r)
Returns the type of coeffs domain.
Definition coeffs.h:429
static FORCE_INLINE BOOLEAN nCoeff_is_Zn(const coeffs r)
Definition coeffs.h:819
static FORCE_INLINE int n_NumberOfParameters(const coeffs r)
Returns the number of parameters.
Definition coeffs.h:767
static FORCE_INLINE BOOLEAN nCoeff_is_Q_a(const coeffs r)
Definition coeffs.h:878
static FORCE_INLINE BOOLEAN nCoeff_is_Ring_2toM(const coeffs r)
Definition coeffs.h:724
static FORCE_INLINE BOOLEAN nCoeff_is_algExt(const coeffs r)
TRUE iff r represents an algebraic extension field.
Definition coeffs.h:903
static FORCE_INLINE BOOLEAN nCoeff_is_R(const coeffs r)
Definition coeffs.h:829
static FORCE_INLINE BOOLEAN nCoeff_is_long_C(const coeffs r)
Definition coeffs.h:887
const CanonicalForm & w
Definition facAbsFact.cc:51
const Variable & v
< [in] a sqrfree bivariate poly
Definition facBivar.h:39
#define const
Definition fegetopt.c:39
#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 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:1996
ring rOpposite(ring r)
Definition ring.cc:5364
static BOOLEAN rField_is_R(const ring r)
Definition ring.h:523
int rSum(ring r1, ring r2, ring &sum)
Definition ring.cc:1405
short place
Definition ring.h:139
int * weights_m
Definition ring.h:145
short end
Definition ring.h:141
int n_IsParam(number m, const ring r)
if m == var(i)/1 => return i,
Definition ring.cc:5860
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:3465
int * Components
Definition ring.h:175
void rGetSComps(int **currComponents, long **currShiftedComponents, int *length, ring r)
Definition ring.cc:4445
static BOOLEAN rField_is_Zp_a(const ring r)
Definition ring.h:534
BOOLEAN rRing_ord_pure_Dp(const ring r)
Definition ring.cc:5285
ring rModifyRing_Wp(ring r, int *weights)
construct Wp, C ring
Definition ring.cc:2962
short end
Definition ring.h:156
short place
Definition ring.h:164
short place
Definition ring.h:154
void rSetWeightVec(ring r, int64 *wv)
Definition ring.cc:5315
static BOOLEAN rField_is_Z(const ring r)
Definition ring.h:514
static BOOLEAN rField_is_Zp(const ring r)
Definition ring.h:505
short start
Definition ring.h:130
int r_IsRingVar(const char *n, char **names, int N)
Definition ring.cc:213
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:5083
static BOOLEAN rField_is_Ring_PtoM(const ring r)
Definition ring.h:487
short place
Definition ring.h:129
short start
Definition ring.h:201
BOOLEAN rHasSimpleLexOrder(const ring r)
returns TRUE, if simple lp or ls ordering
Definition ring.cc:1922
void p_DebugPrint(poly p, const ring r)
Definition ring.cc:4358
void rKillModifiedRing(ring r)
Definition ring.cc:3076
void(* p_SetmProc)(poly p, const ring r)
Definition ring.h:39
BOOLEAN rRing_ord_pure_dp(const ring r)
Definition ring.cc:5275
short end
Definition ring.h:122
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:405
static BOOLEAN rField_is_long_C(const ring r)
Definition ring.h:550
ro_typ ord_typ
Definition ring.h:225
int * pVarOffset
Definition ring.h:203
static BOOLEAN rOrd_is_Comp_dp(const ring r)
Definition ring.h:781
const char * rSimpleOrdStr(int ord)
Definition ring.cc:78
ring rAssure_CompLastBlock(const ring r, BOOLEAN complete=TRUE)
makes sure that c/C ordering is last ordering
Definition ring.cc:4725
ring rAssure_Wp_C(const ring r, intvec *w)
Definition ring.cc:4881
ring rCopy0AndAddA(ring r, int64vec *wv64, BOOLEAN copy_qideal=TRUE, BOOLEAN copy_ordering=TRUE)
Definition ring.cc:1567
ideal(* BBA_Proc)(const ideal, const ideal, const intvec *, const intvec *, kStrategy strat, const ring)
Definition ring.h:249
int * weights
Definition ring.h:143
static int rBlocks(const ring r)
Definition ring.h:573
ring rAssure_c_dp(const ring r)
Definition ring.cc:5073
long(* pFDegProc)(poly p, ring r)
Definition ring.h:38
static int rGetCurrSyzLimit(const ring r)
Definition ring.h:728
rOrderType_t rGetOrderType(ring r)
Definition ring.cc:1843
int rChar(ring r)
Definition ring.cc:716
int rTypeOfMatrixOrder(const intvec *order)
Definition ring.cc:186
void rUnComplete(ring r)
Definition ring.cc:3996
static ring rIncRefCnt(ring r)
Definition ring.h:846
char * rCharStr(ring r)
TODO: make it a virtual method of coeffs, together with: Decompose & Compose, rParameter & rPar.
Definition ring.cc:650
ring rModifyRing_Simple(ring r, BOOLEAN omit_degree, BOOLEAN omit_comp, unsigned long exp_limit, BOOLEAN &simple)
Definition ring.cc:3010
void rKillModified_Wp_Ring(ring r)
Definition ring.cc:3086
static BOOLEAN rField_is_Domain(const ring r)
Definition ring.h:492
int curr_index
Definition ring.h:188
ring rMinusVar(const ring r, char *v)
undo rPlusVar
Definition ring.cc:5963
short place
Definition ring.h:120
BOOLEAN rRing_has_CompLastBlock(const ring r)
Definition ring.cc:5268
short place
Definition ring.h:185
ring rAssure_Dp_C(const ring r)
Definition ring.cc:5063
long(* pLDegProc)(poly p, int *length, ring r)
Definition ring.h:37
kBucket * kBucket_pt
Definition ring.h:25
BOOLEAN rOrd_is_Totaldegree_Ordering(const ring r)
Definition ring.cc:2016
static BOOLEAN rIsRatGRing(const ring r)
Definition ring.h:432
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:4461
poly(* NF_Proc)(ideal, ideal, poly, int, int, const ring _currRing)
Definition ring.h:248
ring rAssure_C_dp(const ring r)
Definition ring.cc:5068
skStrategy * kStrategy
Definition ring.h:246
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:5115
BOOLEAN rHasSimpleOrder(const ring r)
Definition ring.cc:1890
ideal F
Definition ring.h:217
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:4466
int rGetMaxSyzComp(int i, const ring r)
return the max-comonent wchich has syzIndex i Assume: i<= syzIndex_limit
Definition ring.cc:5241
static int rInternalChar(const ring r)
Definition ring.h:694
char * rString(ring r)
Definition ring.cc:676
static BOOLEAN rIsLPRing(const ring r)
Definition ring.h:416
ring rAssure_HasComp(const ring r)
Definition ring.cc:4656
int limit
Definition ring.h:186
BOOLEAN rEqual(ring r1, ring r2, BOOLEAN qr=TRUE)
returns TRUE, if r1 equals r2 FALSE, otherwise Equality is determined componentwise,...
Definition ring.cc:1749
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:89
@ ringorder_a64
for int64 weights
Definition ring.h:71
@ ringorder_C
Definition ring.h:73
@ ringorder_S
S?
Definition ring.h:75
@ ringorder_ds
Definition ring.h:85
@ ringorder_Dp
Definition ring.h:80
@ ringorder_unspec
Definition ring.h:95
@ ringorder_L
Definition ring.h:90
@ ringorder_Ds
Definition ring.h:86
@ ringorder_Ip
Definition ring.h:83
@ ringorder_dp
Definition ring.h:78
@ ringorder_c
Definition ring.h:72
@ ringorder_aa
for idElimination, like a, except pFDeg, pWeigths ignore it
Definition ring.h:92
@ ringorder_no
Definition ring.h:69
@ ringorder_Wp
Definition ring.h:82
@ ringorder_ip
Definition ring.h:79
@ ringorder_is
opposite of ls
Definition ring.h:93
@ ringorder_ws
Definition ring.h:87
@ ringorder_Ws
Definition ring.h:88
@ ringorder_IS
Induced (Schreyer) ordering.
Definition ring.h:94
@ ringorder_ls
degree, ip
Definition ring.h:84
@ 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:1424
static char * rRingVar(short i, const ring r)
Definition ring.h:582
BOOLEAN rHas_c_Ordering(const ring r)
Definition ring.cc:1886
static BOOLEAN rField_is_Q(const ring r)
Definition ring.h:511
ring rEnvelope(ring r)
Definition ring.cc:5758
int limit
Definition ring.h:214
void rDebugPrint(const ring r)
Definition ring.cc:4153
void rWrite(ring r, BOOLEAN details=FALSE)
Definition ring.cc:227
static BOOLEAN rField_has_Units(const ring r)
Definition ring.h:495
static BOOLEAN rShortOut(const ring r)
Definition ring.h:586
BOOLEAN rRing_ord_pure_lp(const ring r)
Definition ring.cc:5295
poly rGetVar(const int varIndex, const ring r)
Definition ring.cc:5850
BOOLEAN rOrd_is_dp(const ring r)
Definition ring.cc:2029
rOrderType_t
Definition ring.h:103
@ rOrderType_Syz
syzygy ordering
Definition ring.h:110
@ rOrderType_Syz2dpc
syzcomp2dpc
Definition ring.h:112
@ rOrderType_CompExp
simple ordering, component has priority
Definition ring.h:105
@ rOrderType_Exp
simple ordering, exponent vector has priority component is compatible with exp-vector order
Definition ring.h:108
@ rOrderType_General
non-simple ordering as specified by currRing
Definition ring.h:104
@ rOrderType_Schreyer
Schreyer ordering.
Definition ring.h:111
@ rOrderType_ExpNoComp
simple ordering, differences in component are not considered
Definition ring.h:113
@ rOrderType_ExpComp
simple ordering, exponent vector has priority component not compatible with exp-vector order
Definition ring.h:106
void rChangeSComps(int *currComponents, long *currShiftedComponents, int length, ring r)
Definition ring.cc:4436
EXTERN_VAR omBin sip_sring_bin
Definition ring.h:837
long * ShiftedComponents
Definition ring.h:174
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:211
static BOOLEAN rIsNCRing(const ring r)
Definition ring.h:426
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:1802
static void rDecRefCnt(ring r)
Definition ring.h:847
static char const ** rParameter(const ring r)
(r->cf->parameter)
Definition ring.h:630
ring rModifyRing(ring r, BOOLEAN omit_degree, BOOLEAN omit_comp, unsigned long exp_limit)
Definition ring.cc:2715
ring rAssure_SyzComp_CompLastBlock(const ring r)
makes sure that c/C ordering is last ordering and SyzIndex is first
Definition ring.cc:4780
char * rParStr(ring r)
Definition ring.cc:652
int * syz_index
Definition ring.h:187
BOOLEAN rCheckIV(const intvec *iv)
Definition ring.cc:176
short end
Definition ring.h:166
short start
Definition ring.h:140
static BOOLEAN rField_is_long_R(const ring r)
Definition ring.h:547
rRingOrder_t rOrderName(char *ordername)
Definition ring.cc:510
short end
Definition ring.h:131
short len_gen
Definition ring.h:142
short start
Definition ring.h:155
short start
Definition ring.h:121
char * rOrdStr(ring r)
Definition ring.cc:524
static BOOLEAN rField_is_numeric(const ring r)
Definition ring.h:520
void rDelete(ring r)
unconditionally deletes fields in r
Definition ring.cc:452
ring rAssure_InducedSchreyerOrdering(const ring r, BOOLEAN complete=TRUE, int sgn=1)
Definition ring.cc:4928
int64 * weights64
Definition ring.h:157
short start
Definition ring.h:165
BOOLEAN rHasMixedOrdering(const ring r)
Definition ring.h:768
int order_index
Definition ring.h:226
char * rVarStr(ring r)
Definition ring.cc:626
void p_SetGlobals(const ring r, BOOLEAN complete=TRUE)
set all properties of a new ring - also called by rComplete
Definition ring.cc:3432
ring rPlusVar(const ring r, char *v, int left)
K[x],"y" -> K[x,y] resp. K[y,x].
Definition ring.cc:5881
short start
Definition ring.h:211
static BOOLEAN rCanShortOut(const ring r)
Definition ring.h:591
static BOOLEAN rIsSyzIndexRing(const ring r)
Definition ring.h:725
int * weights
Definition ring.h:132
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:156
int * pVarOffset
Definition ring.h:212
short place
Definition ring.h:173
static BOOLEAN rField_is_Ring_2toM(const ring r)
Definition ring.h:484
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:202
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:5053
BOOLEAN rOrd_is_ds(const ring r)
Definition ring.cc:2036
ring rAssure_TDeg(const ring r, int &pos)
Definition ring.cc:4558
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:752
BOOLEAN rHasGlobalOrdering(const ring r)
Definition ring.h:766
BOOLEAN rHasLocalOrMixedOrdering(const ring r)
Definition ring.h:767
union sro_ord::@1 data
void rSetSyzComp(int k, const ring r)
Definition ring.cc:5169
long length
Definition ring.h:177
int64 * rGetWeightVec(const ring r)
Definition ring.cc:5305
static BOOLEAN rField_has_simple_inverse(const ring r)
Definition ring.h:553
ring rAssure_dp_C(const ring r)
Definition ring.cc:5058
ring rCopy(ring r)
Definition ring.cc:1734
idrec * idhdl
Definition ring.h:21
BOOLEAN rDBTest(ring r, const char *fn, const int l)
Definition ring.cc:2055
unsigned long rGetExpSize(unsigned long bitmask, int &bits, int N)
Definition ring.cc:2680
Definition ring.h:210
Definition ring.h:138
Definition ring.h:163
Definition ring.h:119
Definition ring.h:128
The following sip_sideal structure has many different uses thoughout Singular. Basic use-cases for it...
poly ppNoether
Definition ring.h:292
n_Procs_s * cf
Definition ring.h:373
short ExpPerLong
Definition ring.h:340
int * block0
Definition ring.h:259
int * NegWeightL_Offset
Definition ring.h:274
p_SetmProc p_Setm
Definition ring.h:372
BOOLEAN pLexOrder
Definition ring.h:327
void * ext_ref
Definition ring.h:294
short pCompIndex
Definition ring.h:341
short pOrdIndex
Definition ring.h:342
pFDegProc pFDegOrig
Definition ring.h:368
short N
Definition ring.h:308
int * firstwv
Definition ring.h:288
short VarL_Size
Definition ring.h:338
intvec * pModW
Definition ring.h:291
const nc_struct * GetNC() const
Definition ring.h:378
short LPncGenCount
Definition ring.h:319
int * block1
Definition ring.h:260
short real_var_end
Definition ring.h:314
short firstBlockEnds
Definition ring.h:312
BOOLEAN CanShortOut
Definition ring.h:324
rRingOrder_t * order
Definition ring.h:258
short NegWeightL_Size
Definition ring.h:349
unsigned long options
Definition ring.h:303
pFDegProc pFDeg
Definition ring.h:364
unsigned long wanted_maxExp
Definition ring.h:357
int * VarL_Offset
Definition ring.h:352
omBin PolyBin
Definition ring.h:290
nc_struct * _nc
Definition ring.h:376
int * VarOffset
Definition ring.h:276
short CmpL_Size
Definition ring.h:334
BOOLEAN ComponentOrder
Definition ring.h:329
idhdl idroot
Definition ring.h:257
BOOLEAN MixedOrder
Definition ring.h:326
long * ordsgn
Definition ring.h:266
short VarL_LowIndex
Definition ring.h:347
int ** wvhdl
Definition ring.h:262
BOOLEAN LexOrder
Definition ring.h:325
unsigned long divmask
Definition ring.h:359
p_Procs_s * p_Procs
Definition ring.h:361
unsigned long bitmask
Definition ring.h:355
ideal qideal
extension to the ring structure: qring, rInit, OR for Q_a/Zp_a, rInit (replaces minideal!...
Definition ring.h:280
pLDegProc pLDeg
Definition ring.h:365
short real_var_start
Definition ring.h:314
sro_ord * typ
Definition ring.h:270
char ** names
Definition ring.h:263
BOOLEAN ShortOut
Definition ring.h:323
short isLPring
Definition ring.h:318
pLDegProc pLDegOrig
Definition ring.h:370
BOOLEAN VectorOut
Definition ring.h:322
short BitsPerExp
Definition ring.h:339
short ExpL_Size
Definition ring.h:333
nc_struct *& GetNC()
Definition ring.h:379
short OrdSize
Definition ring.h:343
short OrdSgn
Definition ring.h:310
int ref
Definition ring.h:306
Definition nc.h:68
EXTERN_VAR long * currShiftedComponents
Definition syz.h:118