40#define BITS_PER_LONG 8*SIZEOF_LONG
111 r->names = (
char **)
omAlloc0(
N *
sizeof(
char *));
125 if (bitmask!=0) r->wanted_maxExp=bitmask;
144 int *block0 = (
int *)
omAlloc0(2 *
sizeof(
int));
145 int *block1 = (
int *)
omAlloc0(2 *
sizeof(
int));
180 WerrorS(
"weights only for orderings wp,ws,Wp,Ws,a,M");
192 WerrorS(
"Matrix order is not a square matrix");
195 while ((
i<
sz) && (typ==1))
198 while ((
j<
sz) && ((*order)[
j*
sz+
i+2]==0))
j++;
202 WerrorS(
"Matrix order not complete");
204 else if ((*order)[
j*
sz+
i+2]<0)
217 for (
int i=0;
i<
N;
i++)
219 if (names[
i]==
NULL)
return -1;
220 if (
strcmp(n,names[
i]) == 0)
return (
int)
i;
249 PrintS(
"// coefficients: ");
304 Print(
"// number of vars : %d",r->N);
312 Print(
"\n// block %3d : ",
l+1);
319 assume( r->block0[
l] == r->block1[
l] );
320 const int s = r->block0[
l];
328 Print(
" syz_comp: %d",r->block0[
l]);
340 for (
i = r->block0[
l]-1;
i<r->block1[
l];
i++)
347 if (r->wvhdl[
l]!=
NULL)
359 Warn(
"should not have wvhdl entry at pos. %d",
l);
363 j<(r->block1[
l]-r->block0[
l]+1)*(r->block1[
l]-r->block0[
l]+1);
366 PrintS(
"\n// : weights ");
367 for (
i = 0;
i<=r->block1[
l]-r->block0[
l];
i++)
385 int m=r->wvhdl[
l][
i];
386 Print(
"\n// : %d module weights ",
m);
395 PrintS(
"\n// noncommutative relations:");
401 for (
i = 1;
i<r->N;
i++)
403 for (
j =
i+1;
j<=r->N;
j++)
408 Print(
"\n// %s%s=",r->names[
j-1],r->names[
i-1]);
419 Print(
"\n// is skew constant:%d",r->GetNC()->IsSkewConstant);
424 PrintS(
"\n// quotient of sca by ideal");
437 Print(
"\n// letterplace ring (block size %d, ncgen count %d)",r->isLPring, r->LPncGenCount);
442 PrintS(
"\n// quotient ring from ideal");
455 if (r ==
NULL)
return;
459 if( r->qideal !=
NULL )
474 if (r->order !=
NULL)
485 if (r->wvhdl[
j]!=
NULL)
498 for (
i=0;
i<r->N;
i++)
546 if (r->wvhdl[
l]!=
NULL)
558 Warn(
"should not have wvhdl entry at pos. %d",
l);
566 j<(r->block1[
l]-r->block0[
l]+1)*(r->block1[
l]-r->block0[
l]+1);
573 for (
i = 0;
i<r->block1[
l]-r->block0[
l];
i++)
582 for (
i = 0;
i<r->block1[
l]-r->block0[
l];
i++)
592 if (
j+
i+1==(r->block1[
l]-r->block0[
l]+1)*(r->block1[
l]-r->block0[
l]+1))
603 assume( r->block0[
l] == r->block1[
l] );
604 const int s = r->block0[
l];
612 if (r->wanted_maxExp!=0)
614 long mm=r->wanted_maxExp;
631 for (
i=0;
i<r->N;
i++)
637 for (
i=0;
i<r->N-1;
i++)
729 for(
int i=1;
i<r->N;
i++)
730 for(
int j=
i+1;
j<=r->N;
j++)
734 WarnS(
"Error initializing multiplication!");
789 && (
mpz_cmp(
r1->cf->modNumber,
r2->cf->extRing->cf->modNumber)==0))
822 if (
r1->cf->extRing->cf==
r2->cf)
832 WerrorS (
"coeff sum of two extension fields not implemented");
838 WerrorS(
"coeff sum not yet implemented");
845 char **names=(
char **)
omAlloc0(
l*
sizeof(
char *));
850 for (
i=0;
i<
r1->N;
i++)
854 if (*(
r1->names[
i]) ==
'\0')
886 if (*(
r2->names[
i]) ==
'\0')
978 if ((
r2->block0[0]==1)
985 tmpR.order[1]=
r2->order[0];
991 int l=
r2->block1[0]-
r2->block0[0]+1;
996 l+=
r2->wvhdl[1][
r2->block1[0]-
r2->block0[0]+1]+1;
1067 WarnS(
"rSum: weights not implemented");
1073 for (
i=0;
r1->order[
i]!=0;
i++)
1083 int l=
r1->block1[
i]-
r1->block0[
i]+1;
1088 l+=
r1->wvhdl[
i][
r1->block1[
i]-
r1->block0[
i]+1]+1;
1103 for (
i=0;
r2->order[
i]!=0;
i++)
1117 int l=
r2->block1[
i]-
r2->block0[
i]+1;
1122 l+=
r2->wvhdl[
i][
r2->block1[
i]-
r2->block0[
i]+1]+1;
1132 if((
r1->OrdSgn==-1)||(
r2->OrdSgn==-1))
1158 int l=
r1->block1[
i]-
r1->block0[
i]+1;
1163 l+=
r1->wvhdl[
i][
r1->block1[
i]-
r1->block0[
i]+1]+1;
1264 MATELEM(C,
i,
j) =
p_PermPoly(
MATELEM(
C1,
i,
j),
perm1,
R1,
sum,
nMap1,
par_perm1,
rPar(
R1));
1267 MATELEM(
D,
i,
j) =
p_PermPoly(
MATELEM(
D1,
i,
j),
perm1,
R1,
sum,
nMap1,
par_perm1,
rPar(
R1));
1280 MATELEM(C,
rVar(
R1)+
i,
rVar(
R1)+
j) =
p_PermPoly(
MATELEM(
C2,
i,
j),
perm2,
R2,
sum,
nMap2,
par_perm2,
rPar(
R2));
1283 MATELEM(
D,
rVar(
R1)+
i,
rVar(
R1)+
j) =
p_PermPoly(
MATELEM(
D2,
i,
j),
perm2,
R2,
sum,
nMap2,
par_perm2,
rPar(
R2));
1291 WarnS(
"Error initializing non-commutative multiplication!");
1300 Print(
"\nRefs: R1: %d, R2: %d\n",
R1->GetNC()->ref,
R2->GetNC()->ref);
1429 res->options=r->options;
1444 res->firstBlockEnds=r->firstBlockEnds;
1446 res->real_var_start=r->real_var_start;
1447 res->real_var_end=r->real_var_end;
1451 res->isLPring=r->isLPring;
1452 res->LPncGenCount=r->LPncGenCount;
1455 res->VectorOut=r->VectorOut;
1456 res->ShortOut=r->ShortOut;
1457 res->CanShortOut=r->CanShortOut;
1473 res->bitmask=r->bitmask;
1474 res->divmask=r->divmask;
1475 res->BitsPerExp = r->BitsPerExp;
1476 res->ExpPerLong = r->ExpPerLong;
1497 res->LexOrder=r->LexOrder;
1498 res->MixedOrder=r->MixedOrder;
1506 if (r->wvhdl[
j]!=
NULL)
1512 int l=r->block1[
j]-r->block0[
j]+1;
1517 l+=r->wvhdl[
j][r->block1[
j]-r->block0[
j]+1]+1;
1528 memcpy(
res->block0,r->block0,
i *
sizeof(
int));
1529 memcpy(
res->block1,r->block1,
i *
sizeof(
int));
1544 if (r->qideal!=
NULL)
1573 res->options=r->options;
1588 res->firstBlockEnds=r->firstBlockEnds;
1590 res->real_var_start=r->real_var_start;
1591 res->real_var_end=r->real_var_end;
1595 res->isLPring=r->isLPring;
1596 res->LPncGenCount=r->LPncGenCount;
1599 res->VectorOut=r->VectorOut;
1600 res->ShortOut=r->ShortOut;
1601 res->CanShortOut=r->CanShortOut;
1602 res->LexOrder=r->LexOrder;
1603 res->MixedOrder=r->MixedOrder;
1619 res->bitmask=r->bitmask;
1620 res->divmask=r->divmask;
1621 res->BitsPerExp = r->BitsPerExp;
1622 res->ExpPerLong = r->ExpPerLong;
1648 for (
j=0;
j<
i-1;
j++)
1650 if (r->wvhdl[
j]!=
NULL)
1656 int l=r->block1[
j]-r->block0[
j]+1;
1661 l+=r->wvhdl[
j][r->block1[
j]-r->block0[
j]+1]+1;
1672 memcpy(&(
res->block0[1]),r->block0,(
i-1) *
sizeof(
int));
1673 memcpy(&(
res->block1[1]),r->block1,(
i-1) *
sizeof(
int));
1691 res->wvhdl[0]=(
int *)
A;
1701 if (r->qideal!=
NULL)
1707 WerrorS(
"internal error: rCopy0(Q,TRUE,FALSE)");
1712 WarnS(
"internal bad stuff: rCopy0(Q,TRUE,TRUE)");
1753 if (
r1->bitmask!=
r2->bitmask)
return FALSE;
1754 #ifdef HAVE_SHIFTBBA
1755 if (
r1->isLPring!=
r2->isLPring)
return FALSE;
1756 if (
r1->LPncGenCount!=
r2->LPncGenCount)
return FALSE;
1808 if ((
r1->cf !=
r2->cf)
1810 || (
r1->OrdSgn !=
r2->OrdSgn))
1814 while (
r1->order[
i] != 0)
1816 if (
r2->order[
i] == 0)
return FALSE;
1817 if ((
r1->order[
i] !=
r2->order[
i])
1818 || (
r1->block0[
i] !=
r2->block0[
i])
1819 || (
r1->block1[
i] !=
r2->block1[
i]))
1825 for (
j=0;
j<
r1->block1[
i]-
r1->block0[
i]+1;
j++)
1826 if (
r2->wvhdl[
i][
j] !=
r1->wvhdl[
i][
j])
1832 if (
r2->order[
i] != 0)
return FALSE;
1999 for (pos=0;pos<r->OrdSize;pos++)
2017 return (
rVar(r) > 1 &&
2023 ((r->order[1]!=0) &&
2029 return (
rVar(r) > 1 &&
2031 ((r->order[1]==
ringorder_dp)&&(r->block1[1]==r->N)&&((r->block0[1]==1))));
2036 return (
rVar(r) > 1 &&
2038 ((r->order[1]==
ringorder_ds)&&(r->block1[1]==r->N)&&((r->block0[1]==1))));
2045 return ((
rVar(r) > 1) &&
2064 if (r->N == 0)
return TRUE;
2066 if ((r->OrdSgn!=1) && (r->OrdSgn!= -1))
2078 for(
int j=0;
j<=
i;
j++)
2081 dError(
"wrong order in r->order");
2092 if (r->VarOffset ==
NULL)
2094 dReportError(
"Null ring VarOffset -- no rComplete (?) in n %s:%d",
fn,
l);
2099 if ((r->OrdSize==0)!=(r->typ==
NULL))
2101 dReportError(
"mismatch OrdSize and typ-pointer in %s:%d");
2107 for(
i=0;
i<=r->N;
i++)
2111 for(
j=0;
j<r->OrdSize;
j++)
2115 const int p = r->typ[
j].data.isTemp.suffixpos;
2122 if(r->typ[
p].ord_typ !=
ro_is)
2123 dReportError(
"ordrec prefix %d is unmatched (suffix: %d is wrong!!!)",
j,
p);
2126 if(r->typ[
j].data.isTemp.pVarOffset[
i] != -1)
2132 else if (r->typ[
j].ord_typ ==
ro_is)
2135 if(r->typ[
j].data.is.pVarOffset[
i] != -1)
2143 if (r->typ[
j].ord_typ==
ro_cp)
2145 if(((
short)r->VarOffset[
i]) == r->typ[
j].data.cp.place)
2150 && (r->VarOffset[
i] == r->typ[
j].data.dp.place))
2156 tmp=r->VarOffset[
i] & 0xffffff;
2157 #if SIZEOF_LONG == 8
2158 if ((r->VarOffset[
i] >> 24) >63)
2160 if ((r->VarOffset[
i] >> 24) >31)
2162 dReportError(
"bit_start out of range:%d",r->VarOffset[
i] >> 24);
2163 if (
i > 0 && ((
tmp<0) ||(
tmp>r->ExpL_Size-1)))
2170 for(
j=0;
j<r->OrdSize;
j++)
2172 if ((r->typ[
j].ord_typ==
ro_dp)
2173 || (r->typ[
j].ord_typ==
ro_wp)
2176 if (r->typ[
j].data.dp.start > r->typ[
j].data.dp.end)
2178 r->typ[
j].data.dp.start, r->typ[
j].data.dp.end);
2179 if ((r->typ[
j].data.dp.start < 1)
2180 || (r->typ[
j].data.dp.end > r->N))
2181 dReportError(
"in ordrec %d: start(%d)<1 or end(%d)>vars(%d)",
j,
2182 r->typ[
j].data.dp.start, r->typ[
j].data.dp.end,r->N);
2246 while((start<end) && (weights[0]==0)) { start++; weights++; }
2247 while((start<end) && (weights[end-start]==0)) { end--; }
2250 for(
i=start;
i<=end;
i++)
2252 if(weights[
i-start]!=1)
2272 for(
i=start;
i<=end;
i++)
2274 if(weights[
i-start]<0)
2296 ord_struct.data.am.weights_m = weights + (end-start+1);
2297 ord_struct.data.am.len_gen=weights[end-start+1];
2332 while((start<end) && (weights[0]==0)) { start++; weights++; }
2333 while((start<end) && (weights[end-start]==0)) { end--; }
2344 for(
i=start;
i<=end;
i++)
2346 if(weights[
i-start]<0)
2516 int *pVarOffset =
tmp_typ[
typ_j].data.isTemp.pVarOffset;
2534 for(
int i = 0;
i <=
N;
i++ )
2537 if(
v[
i] != pVarOffset[
i] )
2539 pVarOffset[
i] =
v[
i];
2541 assume( pVarOffset[
i] != -1 );
2547 if( pVarOffset[0] != -1 )
2548 pVarOffset[0] &= 0x0fff;
2589 bits=16; bitmask=0xffff;
2591 else if (bitmask <= 1L)
2593 bits=1; bitmask = 1L;
2595 else if (bitmask <= 3L)
2597 bits=2; bitmask = 3L;
2599 else if (bitmask <= 7L)
2603 else if (bitmask <= 0xfL)
2605 bits=4; bitmask=0xfL;
2607 else if (bitmask <= 0x1fL)
2609 bits=5; bitmask=0x1fL;
2611 else if (bitmask <= 0x3fL)
2613 bits=6; bitmask=0x3fL;
2616 else if (bitmask <= 0x7fL)
2618 bits=7; bitmask=0x7fL;
2621 else if (bitmask <= 0xffL)
2623 bits=8; bitmask=0xffL;
2626 else if (bitmask <= 0x1ffL)
2628 bits=9; bitmask=0x1ffL;
2631 else if (bitmask <= 0x3ffL)
2633 bits=10; bitmask=0x3ffL;
2636 else if (bitmask <= 0xfffL)
2638 bits=12; bitmask=0xfff;
2641 else if (bitmask <= 0xffffL)
2643 bits=16; bitmask=0xffffL;
2646 else if (bitmask <= 0xfffffL)
2648 bits=20; bitmask=0xfffffL;
2650 else if (bitmask <= 0xffffffffL)
2652 bits=32; bitmask=0xffffffffL;
2654 else if (bitmask <= 0x7fffffffffffffffL)
2656 bits=63; bitmask=0x7fffffffffffffffL;
2660 bits=63; bitmask=0x7fffffffffffffffL;
2663 else if (bitmask <= 0x7fffffff)
2665 bits=31; bitmask=0x7fffffff;
2669 bits=31; bitmask=0x7fffffffL;
2740 if (r->block0[
i]==r->block1[
i])
2765 Warn(
"Error: unhandled ordering in rModifyRing: ringorder_S = [%d]",
r_ord);
2844 block0[
j]=r->block0[
i];
2845 block1[
j]=r->block1[
i];
2846 wvhdl[
j]=r->wvhdl[
i];
2872 res->wanted_maxExp=r->wanted_maxExp;
2879 if (r->pFDegOrig !=
res->pFDegOrig &&
2884 res->firstwv = r->firstwv;
2885 res->firstBlockEnds = r->firstBlockEnds;
2889 res->pLDeg = r->pLDegOrig;
2898 res->typ[0] = r->typ[0];
2900 if (r->typ[0].data.syz.limit > 0)
2902 res->typ[0].data.syz.syz_index
2903 = (
int*)
omAlloc((r->typ[0].data.syz.limit +1)*
sizeof(
int));
2904 memcpy(
res->typ[0].data.syz.syz_index, r->typ[0].data.syz.syz_index,
2905 (r->typ[0].data.syz.limit +1)*
sizeof(
int));
2918 r->typ[
i].data.is.limit,
2929 res->OrdSgn=r->OrdSgn;
2938 WarnS(
"error in nc_rComplete");
2951 WarnS(
"error in sca_Force!");
2977 res->block1[0] = r->N;
2978 res->wvhdl[0] = weights;
2993 WarnS(
"error in nc_rComplete");
3044 res->wanted_maxExp=r->wanted_maxExp;
3055 WarnS(
"error in nc_rComplete");
3099 r->CanShortOut=
FALSE;
3102 r->CanShortOut =
TRUE;
3110 r->CanShortOut=
FALSE;
3118 for (
i=(
N-1);
i>=0;
i--)
3122 r->CanShortOut=
FALSE;
3128 r->ShortOut = r->CanShortOut;
3130 assume( !( !r->CanShortOut && r->ShortOut ) );
3138 if(block1[
i]!=r->N) r->LexOrder=
TRUE;
3139 r->firstBlockEnds=block1[
i];
3140 r->firstwv = wvhdl[
i];
3149 for(
j=block1[
i]-block0[
i];
j>=0;
j--)
3151 if (r->firstwv[
j]==0) r->LexOrder=
TRUE;
3158 for(
j=block1[
i]-block0[
i];
j>=0;
j--)
3160 if (
w[
j]==0) r->LexOrder=
TRUE;
3167 if (r->pFDeg ==
p_Deg)
3188 r->pLDegOrig = r->pLDeg;
3195 int* block0 = r->block0;
3196 int* block1 = r->block1;
3197 int** wvhdl = r->wvhdl;
3206 r->LexOrder =
FALSE;
3213 for(
int ii=block0[0];
ii<=block1[0];
ii++)
3214 if (wvhdl[0][
ii-1]<0) { r->MixedOrder=2;
break;}
3216 for(
int ii=block0[0];
ii<=block1[0];
ii++)
3217 if (wvhdl[0][
ii-1]==0) { r->LexOrder=
TRUE;
break;}
3218 if ((block0[0]==1)&&(block1[0]==r->N))
3229 r->firstwv = wvhdl[0];
3241 if (r->OrdSgn == -1) r->pLDeg =
pLDeg0c;
3260 for(
int ii=block0[0];
ii<=block1[0];
ii++)
3262 if (wvhdl[0][
ii-1]<0) { r->MixedOrder=2;
break;}
3264 if (r->MixedOrder==0)
3266 if ((block0[0]==1)&&(block1[0]==r->N))
3274 r->firstBlockEnds=block1[0];
3275 r->firstwv = wvhdl[0];
3294 r->firstBlockEnds=block1[1];
3295 if (wvhdl!=
NULL) r->firstwv = wvhdl[1];
3303 for(
int ii=block0[1];
ii<=block1[1];
ii++)
3304 if (wvhdl[1][
ii-1]<0) { r->MixedOrder=2;
break;}
3305 if (r->MixedOrder==
FALSE)
3338 if(r->MixedOrder==
FALSE)
3353 r->pFDegOrig = r->pFDeg;
3368 for(
i=0;
i<r->OrdSize;
i++)
3371 ||(r->typ[
i].ord_typ==
ro_am))
3376 r->NegWeightL_Size=
l;
3377 r->NegWeightL_Offset=(
int *)
omAlloc(
l*
sizeof(
int));
3379 for(
i=0;
i<r->OrdSize;
i++)
3383 r->NegWeightL_Offset[
l]=r->typ[
i].data.wp.place;
3386 else if(r->typ[
i].ord_typ==
ro_am)
3388 r->NegWeightL_Offset[
l]=r->typ[
i].data.am.place;
3395 r->NegWeightL_Size = 0;
3396 r->NegWeightL_Offset =
NULL;
3408 if ( (r->cf->extRing!=
NULL)
3417 if (r->LexOrder || r->OrdSgn == -1 || (r->cf->extRing!=
NULL))
3434 r->pLexOrder=r->LexOrder;
3442static inline int sign(
int x) {
return (
x > 0) - (
x < 0);}
3473 r->BitsPerExp =
bits;
3481 for(
i=r->N;
i>=0 ;
i--)
3498 switch (r->order[
i])
3522 r->ComponentOrder=1;
3528 r->ComponentOrder=-1;
3534 k=r->block1[
i]-r->block0[
i]+1;
3539 r->wvhdl[
i]+(r->block1[
i]-r->block0[
i]+1)*
l);
3566 if (r->block0[
i]==r->block1[
i])
3582 if (r->block0[
i]==r->block1[
i])
3598 if (r->block0[
i]==r->block1[
i])
3614 if (r->block0[
i]==r->block1[
i])
3630 if (r->block0[
i]==r->block1[
i])
3652 for(
jj=r->block1[
i]-r->block0[
i];
jj>=0;
jj--)
3663 if (r->block1[
i]!=r->block0[
i])
3677 for(
jj=r->block1[
i]-r->block0[
i];
jj>=0;
jj--)
3688 if (r->block1[
i]!=r->block0[
i])
3699 if (r->block1[
i]!=r->block0[
i])
3710 if (r->block1[
i]!=r->block0[
i])
3722 r->ComponentOrder=-1;
3730 r->ComponentOrder=-1;
3737 assume( r->block0[
i] == r->block1[
i] );
3738 const int s = r->block0[
i];
3784 for(
i=1 ;
i<=r->N ;
i++)
3811 r->ordsgn=(
long *)
omAlloc0(r->ExpL_Size*
sizeof(
long));
3813 for(
j=0;
j<r->CmpL_Size;
j++)
3838 r->pCompIndex=(r->VarOffset[0] & 0xffff);
3841 if (
i==r->pCompIndex)
i++;
3850 if (
i==r->pCompIndex)
i++;
3888 for(
int i=1;
i<=r->N;
i++)
3895 if ((r->block0[
j]<=
i)&&(r->block1[
j]>=
i))
3915 if(r->wvhdl[
j][
i-r->block0[
j]]<0)
3921 else if(r->wvhdl[
j][
i-r->block0[
j]]>0)
3932 if(r->wvhdl[
j][
i-r->block0[
j]]<0)
3938 else if(r->wvhdl[
j][
i-r->block0[
j]]>0)
3946 int add=r->block1[
j]-r->block0[
j]+1;
3951 if (r->wvhdl[
j][
i-r->block0[
j]]<0)
3957 else if(r->wvhdl[
j][
i-r->block0[
j]]>0)
3987 if (
nonneg>0) r->MixedOrder=1;
3998 if (r ==
NULL)
return;
3999 if (r->VarOffset !=
NULL)
4001 if (r->OrdSize!=0 && r->typ !=
NULL)
4003 for(
int i = 0;
i < r->OrdSize;
i++)
4004 if( r->typ[
i].ord_typ ==
ro_is)
4008 if( r->typ[
i].data.is.pVarOffset !=
NULL )
4013 else if (r->typ[
i].ord_typ ==
ro_syz)
4015 if(r->typ[
i].data.syz.limit > 0)
4016 omFreeSize(r->typ[
i].data.syz.syz_index, ((r->typ[
i].data.syz.limit) +1)*
sizeof(
int));
4020 assume( r->typ[
i].data.syzcomp.ShiftedComponents ==
NULL );
4021 assume( r->typ[
i].data.syzcomp.Components ==
NULL );
4031 if (r->PolyBin !=
NULL)
4037 if (r->ordsgn !=
NULL && r->CmpL_Size != 0)
4042 if (r->p_Procs !=
NULL)
4047 omfreeSize(r->VarL_Offset, r->VarL_Size*
sizeof(
int));
4048 r->VarL_Offset=
NULL;
4050 if (r->NegWeightL_Offset!=
NULL)
4052 omFreeSize(r->NegWeightL_Offset, r->NegWeightL_Size*
sizeof(
int));
4053 r->NegWeightL_Offset=
NULL;
4066 for (
i=1;
i<=r->N;
i++)
4072 for (
i=0,
j=0;
i<r->ExpL_Size;
i++)
4087 r->VarL_Offset = (
int*)
omAlloc(r->VarL_Size*
sizeof(
int));
4088 r->VarL_LowIndex = 0;
4091 for (
i=0,
j=0;
i<r->ExpL_Size;
i++)
4095 r->VarL_Offset[
j] =
i;
4096 if (
j > 0 && r->VarL_Offset[
j-1] != r->VarL_Offset[
j] - 1)
4097 r->VarL_LowIndex = -1;
4101 if (r->VarL_LowIndex >= 0)
4102 r->VarL_LowIndex = r->VarL_Offset[0];
4106 j = r->VarL_Offset[
min_j];
4107 r->VarL_Offset[
min_j] = r->VarL_Offset[0];
4108 r->VarL_Offset[0] =
j;
4118 for (
i=0;
i<r->ExpL_Size;
i++)
4122 for (
i=1;
i<=r->N;
i++)
4124 if (
shifts[r->VarOffset[
i] & 0xffffff] > r->VarOffset[
i] >> 24)
4125 shifts[r->VarOffset[
i] & 0xffffff] = r->VarOffset[
i] >> 24;
4128 for (
i=1;
i<=r->N;
i++)
4130 if (
shifts[r->VarOffset[
i] & 0xffffff] != 0)
4132 = (r->VarOffset[
i] & 0xffffff) |
4133 (((r->VarOffset[
i] >> 24) -
shifts[r->VarOffset[
i] & 0xffffff]) << 24);
4141 unsigned long divmask = 1;
4146 divmask |= (((
unsigned long) 1) << (
unsigned long)
i);
4161 const char *
TYP[]={
"ro_dp",
"ro_wp",
"ro_am",
"ro_wp64",
"ro_wp_neg",
"ro_cp",
4162 "ro_syzcomp",
"ro_syz",
"ro_isTemp",
"ro_is",
"ro_none"};
4165 Print(
"ExpL_Size:%d ",r->ExpL_Size);
4166 Print(
"CmpL_Size:%d ",r->CmpL_Size);
4167 Print(
"VarL_Size:%d\n",r->VarL_Size);
4168 Print(
"bitmask=0x%lx (expbound=%ld) \n",r->bitmask, r->bitmask);
4169 Print(
"divmask=%lx\n", r->divmask);
4170 Print(
"BitsPerExp=%d ExpPerLong=%d at L[%d]\n", r->BitsPerExp, r->ExpPerLong, r->VarL_Offset[0]);
4172 Print(
"VarL_LowIndex: %d\n", r->VarL_LowIndex);
4173 PrintS(
"VarL_Offset:\n");
4176 for(
j = 0;
j < r->VarL_Size;
j++)
4177 Print(
" VarL_Offset[%d]: %d ",
j, r->VarL_Offset[
j]);
4184 for(
j=0;
j<=r->N;
j++)
4185 Print(
" v%d at e-pos %d, bit %d\n",
4186 j,r->VarOffset[
j] & 0xffffff, r->VarOffset[
j] >>24);
4188 for(
j=0;
j<r->CmpL_Size;
j++)
4189 Print(
" ordsgn %ld at pos %d\n",r->ordsgn[
j],
j);
4190 Print(
"OrdSgn:%d\n",r->OrdSgn);
4192 for(
j=0;
j<r->OrdSize;
j++)
4194 Print(
" typ %s",
TYP[r->typ[
j].ord_typ]);
4195 if (r->typ[
j].ord_typ==
ro_syz)
4197 const short place = r->typ[
j].data.syz.place;
4198 const int limit = r->typ[
j].data.syz.limit;
4199 const int curr_index = r->typ[
j].data.syz.curr_index;
4200 const int* syz_index = r->typ[
j].data.syz.syz_index;
4202 Print(
" limit %d (place: %d, curr_index: %d), syz_index: ", limit, place, curr_index);
4204 if( syz_index ==
NULL )
4209 for(
i=0;
i <= limit;
i++ )
4210 Print(
"%d ", syz_index[
i]);
4217 Print(
" start (level) %d, suffixpos: %d, VO: ",r->typ[
j].data.isTemp.start, r->typ[
j].data.isTemp.suffixpos);
4220 else if (r->typ[
j].ord_typ==
ro_is)
4222 Print(
" start %d, end: %d: ",r->typ[
j].data.is.start, r->typ[
j].data.is.end);
4226 Print(
" limit %d",r->typ[
j].data.is.limit);
4233 else if (r->typ[
j].ord_typ==
ro_am)
4235 Print(
" place %d",r->typ[
j].data.am.place);
4236 Print(
" start %d",r->typ[
j].data.am.start);
4237 Print(
" end %d",r->typ[
j].data.am.end);
4238 Print(
" len_gen %d",r->typ[
j].data.am.len_gen);
4241 for(
l=r->typ[
j].data.am.start;
l<=r->typ[
j].data.am.end;
l++)
4242 Print(
" %d",r->typ[
j].data.am.weights[
l-r->typ[
j].data.am.start]);
4243 l=r->typ[
j].data.am.end+1;
4244 int ll=r->typ[
j].data.am.weights[
l-r->typ[
j].data.am.start];
4247 Print(
" %d",r->typ[
j].data.am.weights[
lll-r->typ[
j].data.am.start]);
4251 Print(
" place %d",r->typ[
j].data.dp.place);
4255 Print(
" start %d",r->typ[
j].data.dp.start);
4256 Print(
" end %d",r->typ[
j].data.dp.end);
4257 if ((r->typ[
j].ord_typ==
ro_wp)
4261 for(
int l=r->typ[
j].data.wp.start;
l<=r->typ[
j].data.wp.end;
l++)
4262 Print(
" %d",r->typ[
j].data.wp.weights[
l-r->typ[
j].data.wp.start]);
4264 else if (r->typ[
j].ord_typ==
ro_wp64)
4268 for(
l=r->typ[
j].data.wp64.start;
l<=r->typ[
j].data.wp64.end;
l++)
4269 Print(
" %ld",(
long)(r->typ[
j].data.wp64.weights64+
l-r->typ[
j].data.wp64.start));
4275 Print(
"pOrdIndex:%d pCompIndex:%d\n", r->pOrdIndex, r->pCompIndex);
4276 Print(
"OrdSize:%d\n",r->OrdSize);
4277 PrintS(
"--------------------\n");
4278 for(
j=0;
j<r->ExpL_Size;
j++)
4282 Print(
"ordsgn %ld ", r->ordsgn[
j]);
4288 if( (r->VarOffset[
i] & 0xffffff) ==
j )
4289 {
Print(
"v%d at e[%d], bit %d; ",
i,r->VarOffset[
i] & 0xffffff,
4290 r->VarOffset[
i] >>24 ); }
4292 if( r->pCompIndex==
j )
PrintS(
"v0; ");
4293 for(
i=0;
i<r->OrdSize;
i++)
4295 if (r->typ[
i].data.dp.place ==
j)
4297 Print(
"ordrec:%s (start:%d, end:%d) ",
TYP[r->typ[
i].ord_typ],
4298 r->typ[
i].data.dp.start, r->typ[
i].data.dp.end);
4302 if (
j==r->pOrdIndex)
4307 Print(
"LexOrder:%d, MixedOrder:%d\n",r->LexOrder, r->MixedOrder);
4309 Print(
"NegWeightL_Size: %d, NegWeightL_Offset: ", r->NegWeightL_Size);
4310 if (r->NegWeightL_Offset==
NULL)
PrintS(
" NULL");
4312 for(
j = 0;
j < r->NegWeightL_Size;
j++)
4313 Print(
" [%d]: %d ",
j, r->NegWeightL_Offset[
j]);
4334#define pFDeg_CASE(A) if(r->pFDeg == A) PrintS( "" #A "" )
4340 Print(
"(%p)", r->pFDeg);
4343 Print(
"pLDeg : (%p)", r->pLDeg);
4355 else Print(
"%p\n",r->p_Setm);
4365 Print(
"\nexp[0..%d]\n",r->ExpL_Size-1);
4366 for(
i=0;
i<r->ExpL_Size;
i++)
4374 if (
j==0) {
PrintS(
"...\n");
break; }
4383 Print(
"\nexp[0..%d]\n",
R->ExpL_Size - 1);
4384 for(
int i = 0;
i <
R->ExpL_Size;
i++)
4473 WarnS(
"rAssure_SyzComp: input ring has an IS-ordering!");
4484 int ** wvhdl =(
int **)
omAlloc0((
i+1)*
sizeof(
int**));
4487 res->order[
j]=r->order[
j-1];
4488 res->block0[
j]=r->block0[
j-1];
4489 res->block1[
j]=r->block1[
j-1];
4490 if (r->wvhdl[
j-1] !=
NULL)
4496 int l=r->block1[
j-1]-r->block0[
j-1]+1;
4501 l+=r->wvhdl[
j-1][r->block1[
j-1]-r->block0[
j-1]+1]+1;
4504 memcpy(wvhdl[
j],r->wvhdl[
j-1],
l*
sizeof(
int));
4522 WarnS(
"error in nc_rComplete");
4532 if (r->qideal!=
NULL)
4562 pos=r->VarL_LowIndex;
4567 for(
int i=r->OrdSize-1;
i>=0;
i--)
4569 if ((r->typ[
i].ord_typ==
ro_dp)
4570 && (r->typ[
i].data.dp.start==1)
4571 && (r->typ[
i].data.dp.end==r->N))
4573 pos=r->typ[
i].data.dp.place;
4592 res->ExpL_Size=r->ExpL_Size+1;
4596 for(
j=0;
j<r->CmpL_Size;
j++)
4598 res->ordsgn[
j] = r->ordsgn[
j];
4600 res->OrdSize=r->OrdSize+1;
4609 res->typ[
res->OrdSize-1].data.dp.start=1;
4610 res->typ[
res->OrdSize-1].data.dp.end=
res->N;
4611 res->typ[
res->OrdSize-1].data.dp.place=
res->ExpL_Size-1;
4612 pos=
res->ExpL_Size-1;
4628 WarnS(
"error in nc_rComplete");
4634 if (r->qideal!=
NULL)
4664 if (r->order[
i] == 0)
4682 if (r->wvhdl[
j]!=
NULL)
4688 int l=r->block1[
j]-r->block0[
j]+1;
4693 l+=r->wvhdl[
j][r->block1[
j]-r->block0[
j]+1]+1;
4715 WarnS(
"error in nc_rComplete");
4766 WarnS(
"error in nc_rComplete");
4800 WarnS(
"error in nc_rComplete");
4817 WarnS(
"error in nc_SetupQuotient");
4843 (r->order[0] ==
b1) &&
4844 (r->order[1] ==
b2) &&
4857 res->block1[1] = r->N;
4862 res->block1[0] = r->N;
4872 WarnS(
"error in nc_rComplete");
4891 for(
int i=0;
i<r->N;
i++)
4893 if ((*
w)[
i]!=r->wvhdl[0][
i]) { ok=
FALSE;
break;}
4905 res->block1[1] = r->N;
4906 res->wvhdl[0]=(
int*)
omAlloc(r->N*
sizeof(
int));
4907 for(
int i=0;
i<r->N;
i++)
4909 r->wvhdl[0][
i]=(*w)[
i];
4919 WarnS(
"error in nc_rComplete");
4932 Print(
"rAssure_InducedSchreyerOrdering(r, complete = %d, sgn = %d): r: \n", complete,
sgn);
4949 int ** wvhdl =(
int **)
omAlloc0((n+2)*
sizeof(
int**));
4957 res->block0[
j] =
res->block1[
j] = 0;
4961 for(
int i = 0; (
i <= n) && (r->order[
i] != 0);
i++,
j++)
4963 res->order [
j] = r->order [
i];
4964 res->block0[
j] = r->block0[
i];
4965 res->block1[
j] = r->block1[
i];
4967 if (r->wvhdl[
i] !=
NULL)
4973 int l=(r->block1[
i]-r->block0[
i]+1);
4978 l+=r->wvhdl[
i][r->block1[
i]-r->block0[
i]+1]+1;
4981 memcpy(wvhdl[
j],r->wvhdl[
i],
l*
sizeof(
int));
5013 WarnS(
"error in nc_rComplete");
5025 if (r->qideal!=
NULL)
5087 Print(
"rIsIS(p: %d)\nF:",
p);
5098 for(
int pos = 0; pos < r->OrdSize; pos++ )
5099 if( r->typ[pos].ord_typ ==
ro_is)
5121 dReportError(
"Error: WRONG USE of rSetISReference: wrong ring! (typ == NULL)");
5130 dReportError(
"Error: WRONG USE of rSetISReference: specified ordering block was not found!!!" );
5135 if(
i != r->typ[pos].data.is.limit )
5136 Print(
"Changing record on pos: %d\nOld limit: %d --->> New Limit: %d\n", pos, r->typ[pos].data.is.limit,
i);
5142 if( r->typ[pos].data.is.F !=
NULL)
5145 PrintS(
"Deleting old reference set F... \n");
5148 r->typ[pos].data.is.F =
NULL;
5153 r->typ[pos].data.is.F =
FF;
5155 r->typ[pos].data.is.limit =
i;
5179 if ((r->typ!=
NULL) && (r->typ[0].ord_typ==
ro_syz))
5181 r->block0[0]=r->block1[0] =
k;
5182 if(
k == r->typ[0].data.syz.limit )
5186 if (r->typ[0].data.syz.limit == 0)
5188 r->typ[0].data.syz.syz_index = (
int*)
omAlloc0((
k+1)*
sizeof(
int));
5189 r->typ[0].data.syz.syz_index[0] = 0;
5190 r->typ[0].data.syz.curr_index = 1;
5194 r->typ[0].data.syz.syz_index = (
int*)
5196 (r->typ[0].data.syz.limit+1)*
sizeof(
int),
5199 for (
i=r->typ[0].data.syz.limit + 1;
i<=
k;
i++)
5201 r->typ[0].data.syz.syz_index[
i] =
5202 r->typ[0].data.syz.curr_index;
5204 if(
k < r->typ[0].data.syz.limit)
5207 Warn(
"rSetSyzComp called with smaller limit (%d) as before (%d)",
k, r->typ[0].data.syz.limit);
5209 r->typ[0].data.syz.curr_index = 1 + r->typ[0].data.syz.syz_index[
k];
5213 r->typ[0].data.syz.limit =
k;
5214 r->typ[0].data.syz.curr_index++;
5223 Warn(
"rSetSyzComp(%d) in an IS ring! Be careful!",
k);
5228 r->block0[0] = r->block1[0] =
k;
5243 if ((r->typ!=
NULL) && (r->typ[0].ord_typ==
ro_syz) &&
5244 r->typ[0].data.syz.limit > 0 &&
i > 0)
5248 for (
j=0;
j<r->typ[0].data.syz.limit;
j++)
5250 if (r->typ[0].data.syz.syz_index[
j] ==
i &&
5251 r->typ[0].data.syz.syz_index[
j+1] !=
i)
5253 assume(r->typ[0].data.syz.syz_index[
j+1] ==
i+1);
5257 return r->typ[0].data.syz.limit;
5262 WarnS(
"rGetMaxSyzComp: order c");
5277 if ((r->order[0]==
ringorder_dp) &&(r->block0[0]==1) &&(r->block1[0]==r->N))
5280 && ((r->order[1]==
ringorder_dp) &&(r->block0[1]==1) &&(r->block1[1]==r->N)))
5287 if ((r->order[0]==
ringorder_Dp) &&(r->block0[0]==1) &&(r->block1[0]==r->N))
5290 && ((r->order[1]==
ringorder_Dp) &&(r->block0[1]==1) &&(r->block1[1]==r->N)))
5297 if ((r->order[0]==
ringorder_lp) &&(r->block0[0]==1) &&(r->block1[0]==r->N))
5300 && ((r->order[1]==
ringorder_lp) &&(r->block0[1]==1) &&(r->block1[1]==r->N)))
5310 while((r->typ[
i].ord_typ!=
ro_wp64) && (r->typ[
i].ord_typ>0))
i++;
5312 return r->typ[
i].data.wp64.weights64;
5320 memcpy(r->typ[0].data.wp64.weights64,
wv,r->N*
sizeof(
int64));
5331 for(
int k=
size;
k>pos;
k--) r->wvhdl[
k]=r->wvhdl[
k-1];
5343 for(
int k=pos+1;
k<
size;
k++) r->wvhdl[
k]=r->wvhdl[
k+1];
5353 for(
int j=0;
j<=
i2;
j++)
5361#define rOppVar(R,I) (rVar(R)+1-I)
5379 if (src->qideal !=
NULL)
5387 for(
i=
i2;
i>=0;
i--)
5393 p = r->names[
rVar(r)-1-
i];
5394 r->names[
rVar(r)-1-
i] = r->names[
i];
5412 char *
p=r->names[
i];
5465 for(
i=0; src->order[
i]!=0;
i++)
5467 switch (src->order[
i])
5472 r->order[
j]=src->order[
i];
5476 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5477 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5481 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5482 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5488 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5489 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5490 r->wvhdl[
j]=(
int*)
omAlloc((r->block1[
j]-r->block0[
j]+1)*
sizeof(
int));
5491 for(
int k=r->block0[
j];
k<=r->block1[
j];
k++)
5492 r->wvhdl[
j][
k-r->block0[
j]]=1;
5495 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5496 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5504 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5505 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5506 r->wvhdl[
j]=(
int*)
omAlloc((r->block1[
j]-r->block0[
j]+1)*
sizeof(
int));
5507 for(
int k=r->block0[
j];
k<=r->block1[
j];
k++)
5508 r->wvhdl[
j][
k-r->block0[
j]]=1;
5511 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5512 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5520 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5521 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5522 r->wvhdl[
j]=r->wvhdl[
j+1]; r->wvhdl[
j+1]=
NULL;
5526 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5527 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5535 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5536 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5537 r->wvhdl[
j]=r->wvhdl[
j+1]; r->wvhdl[
j+1]=
NULL;
5541 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5542 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5549 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5550 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5551 int n=r->block1[
j]-r->block0[
j];
5553 for (
int nn=0;
nn<=n;
nn++)
5562 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5563 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5605 for(
i=0; src->order[
i]!=0;
i++)
5607 switch (src->order[
i])
5612 r->order[
j]=src->order[
i];
5616 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5617 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5621 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5622 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5627 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5628 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5634 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5635 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5683 for(
i=1;
i<=r->N;
i++)
5699 MATELEM(C,
nj,
ni) =
p_PermPoly(
MATELEM(src->GetNC()->C,
i,
j),perm,src,r,
nMap,
par_perm,
rPar(src));
5702 MATELEM(
D,
nj,
ni) =
p_PermPoly(
MATELEM(src->GetNC()->D,
i,
j),perm,src,r,
nMap,
par_perm,
rPar(src));
5710 WarnS(
"Error initializing non-commutative multiplication!");
5718 assume( r->GetNC()->IsSkewConstant == src->GetNC()->IsSkewConstant);
5725 if (src->qideal !=
NULL)
5728 r->qideal =
idOppose(src, src->qideal, r);
5730 r->qideal =
id_Copy(src->qideal, r);
5762 WarnS(
"Error in rEnvelope at rSum");
5785 const int N = dest->N;
5805 for (
int i = 1;
i <
N;
i++)
5807 for (
int j =
i + 1;
j <=
N;
j++)
5810 const poly
p =
p_NSet(n, dest);
5872 Werror(
"n_IsParam: IsParam is not to be used for (coeff_type = %d)",
getCoeffType(C));
5881 WerrorS(
"only for rings with an ordering of one block");
5898 WerrorS(
"ordering must be dp,Dp,lp,rp,ds,Ds or ls");
5901 for(
int i=r->N-1;
i>=0;
i--)
5905 Werror(
"duplicate variable name >>%s<<",
v);
5911 #ifdef HAVE_SHIFTBBA
5914 R->isLPring=r->isLPring+1;
5915 R->N=((r->N)/r->isLPring)+r->N;
5919 for(
int b=0;
b<((r->N)/r->isLPring);
b++)
5922 for(
int i=
R->isLPring-1;
i>0;
i--)
5923 names[
i+
b*
R->isLPring]=
R->names[
i-1+
b*r->isLPring];
5928 for(
int b=0;
b<((r->N)/r->isLPring);
b++)
5931 for(
int i=
R->isLPring-2;
i>=0;
i--)
5932 names[
i+
b*
R->isLPring]=
R->names[
i+
b*r->isLPring];
5944 for(
int i=
R->N-1;
i>0;
i--) names[
i]=
R->names[
i-1];
5949 for(
int i=
R->N-2;
i>=0;
i--) names[
i]=
R->names[
i];
5963 WerrorS(
"only for rings with an ordering of one block");
5980 WerrorS(
"ordering must be dp,Dp,lp,rp,ds,Ds or ls");
5991 for(
int j=
i;
j<
R->N;
j++)
R->names[
j]=
R->names[
j+1];
int sgn(const Rational &a)
int naIsParam(number m, const coeffs cf)
if m == var(i)/1 => return i,
static int si_max(const int a, const int b)
const CanonicalForm CFMap CFMap & N
Coefficient rings, fields and other domains suitable for Singular polynomials.
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
static FORCE_INLINE void n_CoeffWrite(const coeffs r, BOOLEAN details=TRUE)
output the coeff description
static FORCE_INLINE BOOLEAN nCoeff_is_Extension(const coeffs r)
@ n_R
single prescision (6,6) real numbers
@ n_polyExt
used to represent polys as coeffcients
@ n_Q
rational (GMP) numbers
@ n_Znm
only used if HAVE_RINGS is defined
@ n_algExt
used for all algebraic extensions, i.e., the top-most extension in an extension tower is algebraic
@ n_Zn
only used if HAVE_RINGS is defined
@ n_transExt
used for all transcendental extensions, i.e., the top-most extension in an extension tower is transce...
static FORCE_INLINE char * nCoeffString(const coeffs cf)
TODO: make it a virtual method of coeffs, together with: Decompose & Compose, rParameter & rPar.
static FORCE_INLINE nMapFunc n_SetMap(const coeffs src, const coeffs dst)
set the mapping function pointers for translating numbers from src to dst
coeffs nInitChar(n_coeffType t, void *parameter)
one-time initialisations for new coeffs in case of an error return NULL
static FORCE_INLINE n_coeffType getCoeffType(const coeffs r)
Returns the type of coeffs domain.
static FORCE_INLINE coeffs nCopyCoeff(const coeffs r)
"copy" coeffs, i.e. increment ref
static FORCE_INLINE BOOLEAN nCoeff_is_algExt(const coeffs r)
TRUE iff r represents an algebraic extension field.
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
void nKillChar(coeffs r)
undo all initialisations
static FORCE_INLINE BOOLEAN n_IsOne(number n, const coeffs r)
TRUE iff 'n' represents the one element.
const CanonicalForm int s
const Variable & v
< [in] a sqrfree bivariate poly
static int min(int a, int b)
void WerrorS(const char *s)
ideal id_Copy(ideal h1, const ring r)
copy an ideal
static BOOLEAN length(leftv result, leftv arg)
static bool rIsSCA(const ring r)
ideal idOppose(ring Rop_src, ideal I, const ring Rop_dst)
opposes a module I from Rop to currRing(dst)
bool nc_rCopy(ring res, const ring r, bool bSetupQuotient)
bool nc_SetupQuotient(ring rGR, const ring rG=NULL, bool bCopy=false)
static nc_type & ncRingType(nc_struct *p)
BOOLEAN nc_CallPlural(matrix cc, matrix dd, poly cn, poly dn, ring r, bool bSetupQuotient, bool bCopyInput, bool bBeQuiet, ring curr, bool dummy_ring=false)
returns TRUE if there were errors analyze inputs, check them for consistency detects nc_type,...
void nc_rKill(ring r)
complete destructor
#define UPMATELEM(i, j, nVar)
bool sca_Force(ring rGR, int b, int e)
void maFindPerm(char const *const *const preim_names, int preim_n, char const *const *const preim_par, int preim_p, char const *const *const names, int n, char const *const *const par, int nop, int *perm, int *par_perm, n_coeffType ch)
void mp_Delete(matrix *a, const ring r)
matrix mpNew(int r, int c)
create a r x c zero-matrix
void iiWriteMatrix(matrix im, const char *n, int dim, const ring r, int spaces)
set spaces to zero by default
#define MATELEM(mat, i, j)
1-based access to matrix
STATIC_VAR unsigned add[]
int dReportError(const char *fmt,...)
gmp_float sqrt(const gmp_float &a)
The main handler for Singular numbers which are suitable for Singular polynomials.
#define omFreeSize(addr, size)
#define omCheckAddr(addr)
#define omReallocSize(addr, o_size, size)
#define omCheckAddrSize(addr, size)
#define omFreeBin(addr, bin)
#define omcheckAddrSize(addr, size)
#define omfreeSize(addr, size)
#define omGetSpecBin(size)
#define omUnGetSpecBin(bin_ptr)
void p_ProcsSet(ring r, p_Procs_s *p_Procs)
void p_Debug_GetProcNames(const ring r, p_Procs_s *p_Procs)
void p_Debug_GetSpecNames(const ring r, const char *&field, const char *&length, const char *&ord)
void p_Setm_WFirstTotalDegree(poly p, const ring r)
long pLDegb(poly p, int *l, const ring r)
long pLDeg1_Totaldegree(poly p, int *l, const ring r)
long p_WFirstTotalDegree(poly p, const ring r)
long pLDeg1_WFirstTotalDegree(poly p, int *l, const ring r)
long pLDeg1c_WFirstTotalDegree(poly p, int *l, const ring r)
void p_Setm_Dummy(poly p, const ring r)
void p_Setm_TotalDegree(poly p, const ring r)
poly p_ISet(long i, const ring r)
returns the poly representing the integer i
long pLDeg1c_Deg(poly p, int *l, const ring r)
long pLDeg1(poly p, int *l, const ring r)
poly p_PermPoly(poly p, const int *perm, const ring oldRing, const ring dst, nMapFunc nMap, const int *par_perm, int OldPar, BOOLEAN use_mult)
long pLDeg1_Deg(poly p, int *l, const ring r)
long p_WTotaldegree(poly p, const ring r)
p_SetmProc p_GetSetmProc(const ring r)
void p_Setm_General(poly p, const ring r)
long pLDeg1c(poly p, int *l, const ring r)
long pLDeg1c_Totaldegree(poly p, int *l, const ring r)
long pLDeg0c(poly p, int *l, const ring r)
long pLDeg0(poly p, int *l, const ring r)
poly p_NSet(number n, const ring r)
returns the poly representing the number n, destroys n
long p_Deg(poly a, const ring r)
BOOLEAN p_EqualPolys(poly p1, poly p2, const ring r)
static long p_FDeg(const poly p, const ring r)
void p_Write(poly p, ring lmRing, ring tailRing)
static unsigned long p_SetExp(poly p, const unsigned long e, const unsigned long iBitmask, const int VarOffset)
set a single variable exponent @Note: VarOffset encodes the position in p->exp
static void p_Setm(poly p, const ring r)
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
static void p_Delete(poly *p, const ring r)
void p_Write0(poly p, ring lmRing, ring tailRing)
static long p_Totaldegree(poly p, const ring r)
poly prCopyR(poly p, ring src_r, ring dest_r)
ideal idrCopyR(ideal id, ring src_r, ring dest_r)
ideal idrCopyR_NoSort(ideal id, ring src_r, ring dest_r)
ideal idrHeadR(ideal id, ring r, ring dest_r)
Copy leading terms of id[i] via prHeeadR into dest_r.
void StringSetS(const char *st)
void StringAppendS(const char *st)
void PrintS(const char *s)
void Werror(const char *fmt,...)
static void rSetNegWeight(ring r)
BOOLEAN rOrd_SetCompRequiresSetm(const ring r)
return TRUE if p_SetComp requires p_Setm
static void rO_ISSuffix(int &place, int &bitplace, int &prev_ord, long *o, int N, int *v, sro_ord *tmp_typ, int &typ_i, int sgn)
int rSum(ring r1, ring r2, ring &sum)
ring rAssure_TDeg(ring r, int &pos)
void rWrite(ring r, BOOLEAN details)
ring rAssure_InducedSchreyerOrdering(const ring r, BOOLEAN complete, int sgn)
static ring rAssure_Global(rRingOrder_t b1, rRingOrder_t b2, const ring r)
BOOLEAN rOrder_is_WeightedOrdering(rRingOrder_t order)
void rGetSComps(int **currComponents, long **currShiftedComponents, int *length, ring r)
BOOLEAN rRing_ord_pure_Dp(const ring r)
static void rNChangeSComps(int *currComponents, long *currShiftedComponents, ring r)
ring rModifyRing_Wp(ring r, int *weights)
construct Wp, C ring
BOOLEAN rOrder_is_DegOrdering(const rRingOrder_t order)
BOOLEAN rHasSimpleOrderAA(ring r)
void rSetWeightVec(ring r, int64 *wv)
static void rSetOption(ring r)
BOOLEAN rComplete(ring r, int force)
this needs to be called whenever a new ring is created: new fields in ring are created (like VarOffse...
int r_IsRingVar(const char *n, char **names, int N)
int rGetISPos(const int p, const ring r)
Finds p^th IS ordering, and returns its position in r->typ[] returns -1 if something went wrong!...
static void rNGetSComps(int **currComponents, long **currShiftedComponents, ring r)
static void rO_WDegree64(int &place, int &bitplace, int start, int end, long *o, sro_ord &ord_struct, int64 *weights)
BOOLEAN rHasSimpleLexOrder(const ring r)
returns TRUE, if simple lp or ls ordering
void p_SetGlobals(const ring r, BOOLEAN complete)
set all properties of a new ring - also called by rComplete
ring rAssure_SyzComp(const ring r, BOOLEAN complete)
BOOLEAN nc_rComplete(const ring src, ring dest, bool bSetupQuotient)
void p_DebugPrint(poly p, const ring r)
void rKillModifiedRing(ring r)
BOOLEAN rRing_ord_pure_dp(const ring r)
static void rSetVarL(ring r)
set r->VarL_Size, r->VarL_Offset, r->VarL_LowIndex
static void rO_LexVars(int &place, int &bitplace, int start, int end, int &prev_ord, long *o, int *v, int bits, int opt_var)
const char * rSimpleOrdStr(int ord)
ring rAssure_Wp_C(const ring r, intvec *w)
BOOLEAN rOrd_is_MixedDegree_Ordering(ring r)
static void rDBChangeSComps(int *currComponents, long *currShiftedComponents, int length, ring r)
ring rAssure_c_dp(const ring r)
static void rSetOutParams(ring r)
static void rSetDegStuff(ring r)
static void rDBGetSComps(int **currComponents, long **currShiftedComponents, int *length, ring r)
rOrderType_t rGetOrderType(ring r)
int rTypeOfMatrixOrder(const intvec *order)
ring nc_rCreateNCcomm_rCopy(ring r)
static void rOppWeight(int *w, int l)
static void rO_WDegree_neg(int &place, int &bitplace, int start, int end, long *o, sro_ord &ord_struct, int *weights)
void rKillModified_Wp_Ring(ring r)
ring rMinusVar(const ring r, char *v)
undo rPlusVar
BOOLEAN rRing_has_CompLastBlock(const ring r)
ring rAssure_Dp_C(const ring r)
ring rCopy0AndAddA(const ring r, int64vec *wv64, BOOLEAN copy_qideal, BOOLEAN copy_ordering)
static void rO_Syzcomp(int &place, int &bitplace, int &prev_ord, long *o, sro_ord &ord_struct)
BOOLEAN rOrd_is_Totaldegree_Ordering(const ring r)
ring rModifyRing(ring r, BOOLEAN omit_degree, BOOLEAN try_omit_comp, unsigned long exp_limit)
ring rAssure_SyzOrder(const ring r, BOOLEAN complete)
static void rO_TDegree(int &place, int &bitplace, int start, int end, long *o, sro_ord &ord_struct)
ring rAssure_C_dp(const ring r)
BOOLEAN rHasSimpleOrder(const ring r)
int rGetMaxSyzComp(int i, const ring r)
return the max-comonent wchich has syzIndex i Assume: i<= syzIndex_limit
BOOLEAN rSetISReference(const ring r, const ideal F, const int i, const int p)
Changes r by setting induced ordering parameters: limit and reference leading terms F belong to r,...
ring rAssure_HasComp(const ring r)
ring rCopy0(const ring r, BOOLEAN copy_qideal, BOOLEAN copy_ordering)
static void rO_WMDegree(int &place, int &bitplace, int start, int end, long *o, sro_ord &ord_struct, int *weights)
static void rO_Syz(int &place, int &bitplace, int &prev_ord, int syz_comp, long *o, sro_ord &ord_struct)
BOOLEAN rHas_c_Ordering(const ring r)
static int rRealloc1(ring r, int size, int pos)
static unsigned long rGetExpSize(unsigned long bitmask, int &bits)
void rDebugPrint(const ring r)
static void rCheckOrdSgn(ring r, int i)
BOOLEAN rRing_ord_pure_lp(const ring r)
poly rGetVar(const int varIndex, const ring r)
BOOLEAN rOrd_is_dp(const ring r)
ring rModifyRing_Simple(ring r, BOOLEAN ommit_degree, BOOLEAN ommit_comp, unsigned long exp_limit, BOOLEAN &simple)
void rChangeSComps(int *currComponents, long *currShiftedComponents, int length, ring r)
static void m_DebugPrint(const poly p, const ring R)
debug-print monomial poly/vector p, assuming that it lives in the ring R
static unsigned long rGetDivMask(int bits)
get r->divmask depending on bits per exponent
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...
ring rAssure_SyzComp_CompLastBlock(const ring r)
makes sure that c/C ordering is last ordering and SyzIndex is first
char * rCharStr(const ring r)
TODO: make it a virtual method of coeffs, together with: Decompose & Compose, rParameter & rPar.
static void rOptimizeLDeg(ring r)
BOOLEAN rCheckIV(const intvec *iv)
rRingOrder_t rOrderName(char *ordername)
void rDelete(ring r)
unconditionally deletes fields in r
ring rDefault(const coeffs cf, int N, char **n, int ord_size, rRingOrder_t *ord, int *block0, int *block1, int **wvhdl, unsigned long bitmask)
static void rRightAdjustVarOffset(ring r)
right-adjust r->VarOffset
ring rPlusVar(const ring r, char *v, int left)
K[x],"y" -> K[x,y] resp. K[y,x].
ring rAssure_CompLastBlock(ring r, BOOLEAN complete)
makes sure that c/C ordering is last ordering
static void rO_ISPrefix(int &place, int &bitplace, int &prev_ord, long *o, int N, int *v, sro_ord &ord_struct)
static void rO_Align(int &place, int &bitplace)
ring rAssure_dp_S(const ring r)
BOOLEAN rOrd_is_ds(const ring r)
static void rO_TDegree_neg(int &place, int &bitplace, int start, int end, long *o, sro_ord &ord_struct)
static void rSetFirstWv(ring r, int i, rRingOrder_t *order, int *block0, int *block1, int **wvhdl)
BOOLEAN rEqual(ring r1, ring r2, BOOLEAN qr)
returns TRUE, if r1 equals r2 FALSE, otherwise Equality is determined componentwise,...
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,...
void rSetSyzComp(int k, const ring r)
static const char *const ringorder_name[]
static void rO_WDegree(int &place, int &bitplace, int start, int end, long *o, sro_ord &ord_struct, int *weights)
BOOLEAN rOrd_is_WeightedDegree_Ordering(const ring r)
int n_IsParam(const number m, const ring r)
TODO: rewrite somehow...
int64 * rGetWeightVec(const ring r)
static void rO_LexVars_neg(int &place, int &bitplace, int start, int end, int &prev_ord, long *o, int *v, int bits, int opt_var)
ring rAssure_dp_C(const ring r)
BOOLEAN rDBTest(ring r, const char *fn, const int l)
struct p_Procs_s p_Procs_s
static BOOLEAN rIsPluralRing(const ring r)
we must always have this test!
static int rBlocks(const ring r)
static ring rIncRefCnt(ring r)
static int rPar(const ring r)
(r->cf->P)
static BOOLEAN rIsLPRing(const ring r)
@ ringorder_a64
for int64 weights
@ ringorder_aa
for idElimination, like a, except pFDeg, pWeigths ignore it
@ ringorder_is
opposite of ls
@ ringorder_IS
Induced (Schreyer) ordering.
static BOOLEAN rField_is_Q(const ring r)
static BOOLEAN rShortOut(const ring r)
@ rOrderType_CompExp
simple ordering, component has priority
@ rOrderType_Exp
simple ordering, exponent vector has priority component is compatible with exp-vector order
@ rOrderType_General
non-simple ordering as specified by currRing
@ rOrderType_ExpComp
simple ordering, exponent vector has priority component not compatible with exp-vector order
static BOOLEAN rIsNCRing(const ring r)
static char const ** rParameter(const ring r)
(r->cf->parameter)
static BOOLEAN rCanShortOut(const ring r)
static short rVar(const ring r)
#define rVar(r) (r->N)
#define rField_is_Ring(R)
ideal SCAQuotient(const ring r)
static short scaLastAltVar(ring r)
static short scaFirstAltVar(ring r)
ideal idInit(int idsize, int rank)
initialise an ideal / module
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s
void idShow(const ideal id, const ring lmRing, const ring tailRing, const int debugPrint)
ideal id_SimpleAdd(ideal h1, ideal h2, const ring R)
concat the lists h1 and h2 without zeros
EXTERN_VAR long * currShiftedComponents
int ntIsParam(number m, const coeffs cf)
if m == var(i)/1 => return i,