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);
362 int bl=r->block1[
l]-r->block0[
l]+1;
364 j<(r->block1[
l]-r->block0[
l]+1)*(r->block1[
l]-r->block0[
l]+1);
367 PrintS(
"\n// : weights ");
368 for (
i = 0;
i<=r->block1[
l]-r->block0[
l];
i++)
386 int m=r->wvhdl[
l][
bl];
387 Print(
"\n// : %d module weights ",
m);
396 PrintS(
"\n// noncommutative relations:");
402 for (
i = 1;
i<r->N;
i++)
404 for (
j =
i+1;
j<=r->N;
j++)
409 Print(
"\n// %s%s=",r->names[
j-1],r->names[
i-1]);
420 Print(
"\n// is skew constant:%d",r->GetNC()->IsSkewConstant);
425 PrintS(
"\n// quotient of sca by ideal");
438 Print(
"\n// letterplace ring (block size %d, ncgen count %d)",r->isLPring, r->LPncGenCount);
443 PrintS(
"\n// quotient ring from ideal");
456 if (r ==
NULL)
return;
461 if( r->qideal !=
NULL )
476 if (r->order !=
NULL)
487 if (r->wvhdl[
j]!=
NULL)
500 for (
i=0;
i<r->N;
i++)
548 if (r->wvhdl[
l]!=
NULL)
560 Warn(
"should not have wvhdl entry at pos. %d",
l);
568 j<(r->block1[
l]-r->block0[
l]+1)*(r->block1[
l]-r->block0[
l]+1);
575 for (
i = 0;
i<r->block1[
l]-r->block0[
l];
i++)
584 for (
i = 0;
i<r->block1[
l]-r->block0[
l];
i++)
594 if (
j+
i+1==(r->block1[
l]-r->block0[
l]+1)*(r->block1[
l]-r->block0[
l]+1))
605 assume( r->block0[
l] == r->block1[
l] );
606 const int s = r->block0[
l];
614 if (r->wanted_maxExp!=0)
616 long mm=r->wanted_maxExp;
633 for (
i=0;
i<r->N;
i++)
639 for (
i=0;
i<r->N-1;
i++)
731 for(
int i=1;
i<r->N;
i++)
732 for(
int j=
i+1;
j<=r->N;
j++)
736 WarnS(
"Error initializing multiplication!");
791 && (
mpz_cmp(
r1->cf->modNumber,
r2->cf->extRing->cf->modNumber)==0))
824 if (
r1->cf->extRing->cf==
r2->cf)
834 WerrorS (
"coeff sum of two extension fields not implemented");
840 WerrorS(
"coeff sum not yet implemented");
847 char **names=(
char **)
omAlloc0(
l*
sizeof(
char *));
852 for (
i=0;
i<
r1->N;
i++)
856 if (*(
r1->names[
i]) ==
'\0')
888 if (*(
r2->names[
i]) ==
'\0')
980 if ((
r2->block0[0]==1)
987 tmpR.order[1]=
r2->order[0];
993 int l=
r2->block1[0]-
r2->block0[0]+1;
998 l+=
r2->wvhdl[1][
r2->block1[0]-
r2->block0[0]+1]+1;
1069 WarnS(
"rSum: weights not implemented");
1075 for (
i=0;
r1->order[
i]!=0;
i++)
1085 int l=
r1->block1[
i]-
r1->block0[
i]+1;
1090 l+=
r1->wvhdl[
i][
r1->block1[
i]-
r1->block0[
i]+1]+1;
1105 for (
i=0;
r2->order[
i]!=0;
i++)
1119 int l=
r2->block1[
i]-
r2->block0[
i]+1;
1124 l+=
r2->wvhdl[
i][
r2->block1[
i]-
r2->block0[
i]+1]+1;
1134 if((
r1->OrdSgn==-1)||(
r2->OrdSgn==-1))
1160 int l=
r1->block1[
i]-
r1->block0[
i]+1;
1165 l+=
r1->wvhdl[
i][
r1->block1[
i]-
r1->block0[
i]+1]+1;
1266 MATELEM(C,
i,
j) =
p_PermPoly(
MATELEM(
C1,
i,
j),
perm1,
R1,
sum,
nMap1,
par_perm1,
rPar(
R1));
1269 MATELEM(
D,
i,
j) =
p_PermPoly(
MATELEM(
D1,
i,
j),
perm1,
R1,
sum,
nMap1,
par_perm1,
rPar(
R1));
1282 MATELEM(C,
rVar(
R1)+
i,
rVar(
R1)+
j) =
p_PermPoly(
MATELEM(
C2,
i,
j),
perm2,
R2,
sum,
nMap2,
par_perm2,
rPar(
R2));
1285 MATELEM(
D,
rVar(
R1)+
i,
rVar(
R1)+
j) =
p_PermPoly(
MATELEM(
D2,
i,
j),
perm2,
R2,
sum,
nMap2,
par_perm2,
rPar(
R2));
1293 WarnS(
"Error initializing non-commutative multiplication!");
1302 Print(
"\nRefs: R1: %d, R2: %d\n",
R1->GetNC()->ref,
R2->GetNC()->ref);
1431 res->options=r->options;
1446 res->firstBlockEnds=r->firstBlockEnds;
1448 res->real_var_start=r->real_var_start;
1449 res->real_var_end=r->real_var_end;
1453 res->isLPring=r->isLPring;
1454 res->LPncGenCount=r->LPncGenCount;
1457 res->VectorOut=r->VectorOut;
1458 res->ShortOut=r->ShortOut;
1459 res->CanShortOut=r->CanShortOut;
1475 res->bitmask=r->bitmask;
1476 res->divmask=r->divmask;
1477 res->BitsPerExp = r->BitsPerExp;
1478 res->ExpPerLong = r->ExpPerLong;
1499 res->LexOrder=r->LexOrder;
1500 res->MixedOrder=r->MixedOrder;
1508 if (r->wvhdl[
j]!=
NULL)
1514 int l=r->block1[
j]-r->block0[
j]+1;
1519 l+=r->wvhdl[
j][r->block1[
j]-r->block0[
j]+1]+1;
1530 memcpy(
res->block0,r->block0,
i *
sizeof(
int));
1531 memcpy(
res->block1,r->block1,
i *
sizeof(
int));
1546 if (r->qideal!=
NULL)
1575 res->options=r->options;
1590 res->firstBlockEnds=r->firstBlockEnds;
1592 res->real_var_start=r->real_var_start;
1593 res->real_var_end=r->real_var_end;
1597 res->isLPring=r->isLPring;
1598 res->LPncGenCount=r->LPncGenCount;
1601 res->VectorOut=r->VectorOut;
1602 res->ShortOut=r->ShortOut;
1603 res->CanShortOut=r->CanShortOut;
1604 res->LexOrder=r->LexOrder;
1605 res->MixedOrder=r->MixedOrder;
1621 res->bitmask=r->bitmask;
1622 res->divmask=r->divmask;
1623 res->BitsPerExp = r->BitsPerExp;
1624 res->ExpPerLong = r->ExpPerLong;
1650 for (
j=0;
j<
i-1;
j++)
1652 if (r->wvhdl[
j]!=
NULL)
1658 int l=r->block1[
j]-r->block0[
j]+1;
1663 l+=r->wvhdl[
j][r->block1[
j]-r->block0[
j]+1]+1;
1674 memcpy(&(
res->block0[1]),r->block0,(
i-1) *
sizeof(
int));
1675 memcpy(&(
res->block1[1]),r->block1,(
i-1) *
sizeof(
int));
1693 res->wvhdl[0]=(
int *)
A;
1703 if (r->qideal!=
NULL)
1709 WerrorS(
"internal error: rCopy0(Q,TRUE,FALSE)");
1714 WarnS(
"internal bad stuff: rCopy0(Q,TRUE,TRUE)");
1755 if (
r1->bitmask!=
r2->bitmask)
return FALSE;
1756 #ifdef HAVE_SHIFTBBA
1757 if (
r1->isLPring!=
r2->isLPring)
return FALSE;
1758 if (
r1->LPncGenCount!=
r2->LPncGenCount)
return FALSE;
1810 if ((
r1->cf !=
r2->cf)
1812 || (
r1->OrdSgn !=
r2->OrdSgn))
1816 while (
r1->order[
i] != 0)
1818 if (
r2->order[
i] == 0)
return FALSE;
1819 if ((
r1->order[
i] !=
r2->order[
i])
1820 || (
r1->block0[
i] !=
r2->block0[
i])
1821 || (
r1->block1[
i] !=
r2->block1[
i]))
1827 for (
j=0;
j<
r1->block1[
i]-
r1->block0[
i]+1;
j++)
1828 if (
r2->wvhdl[
i][
j] !=
r1->wvhdl[
i][
j])
1834 if (
r2->order[
i] != 0)
return FALSE;
2001 for (pos=0;pos<r->OrdSize;pos++)
2019 return ((
rVar(r) > 1) &&
2025 ((r->order[1]!=0) &&
2033 return ((
rVar(r) > 1) &&
2035 &&(r->block0[ord]==1)
2036 &&(r->block1[ord]==r->N));
2043 return ((
rVar(r) > 1) &&
2045 &&(r->block0[ord]==1)
2046 &&(r->block1[ord]==r->N));
2053 return ((
rVar(r) > 1) &&
2055 &&(r->block0[ord]==1)
2056 &&(r->block1[ord]==r->N));
2063 return ((
rVar(r) > 1) &&
2082 if (r->N == 0)
return TRUE;
2084 if ((r->OrdSgn!=1) && (r->OrdSgn!= -1))
2096 for(
int j=0;
j<=
i;
j++)
2099 dError(
"wrong order in r->order");
2110 if (r->VarOffset ==
NULL)
2112 dReportError(
"Null ring VarOffset -- no rComplete (?) in n %s:%d",
fn,
l);
2117 if ((r->OrdSize==0)!=(r->typ==
NULL))
2119 dReportError(
"mismatch OrdSize and typ-pointer in %s:%d");
2125 for(
i=0;
i<=r->N;
i++)
2129 for(
j=0;
j<r->OrdSize;
j++)
2133 const int p = r->typ[
j].data.isTemp.suffixpos;
2140 if(r->typ[
p].ord_typ !=
ro_is)
2141 dReportError(
"ordrec prefix %d is unmatched (suffix: %d is wrong!!!)",
j,
p);
2144 if(r->typ[
j].data.isTemp.pVarOffset[
i] != -1)
2150 else if (r->typ[
j].ord_typ ==
ro_is)
2153 if(r->typ[
j].data.is.pVarOffset[
i] != -1)
2161 if (r->typ[
j].ord_typ==
ro_cp)
2163 if(((
short)r->VarOffset[
i]) == r->typ[
j].data.cp.place)
2168 && (r->VarOffset[
i] == r->typ[
j].data.dp.place))
2174 tmp=r->VarOffset[
i] & 0xffffff;
2175 #if SIZEOF_LONG == 8
2176 if ((r->VarOffset[
i] >> 24) >63)
2178 if ((r->VarOffset[
i] >> 24) >31)
2180 dReportError(
"bit_start out of range:%d",r->VarOffset[
i] >> 24);
2181 if (
i > 0 && ((
tmp<0) ||(
tmp>r->ExpL_Size-1)))
2188 for(
j=0;
j<r->OrdSize;
j++)
2190 if ((r->typ[
j].ord_typ==
ro_dp)
2191 || (r->typ[
j].ord_typ==
ro_wp)
2194 if (r->typ[
j].data.dp.start > r->typ[
j].data.dp.end)
2196 r->typ[
j].data.dp.start, r->typ[
j].data.dp.end);
2197 if ((r->typ[
j].data.dp.start < 1)
2198 || (r->typ[
j].data.dp.end > r->N))
2199 dReportError(
"in ordrec %d: start(%d)<1 or end(%d)>vars(%d)",
j,
2200 r->typ[
j].data.dp.start, r->typ[
j].data.dp.end,r->N);
2264 while((start<end) && (weights[0]==0)) { start++; weights++; }
2265 while((start<end) && (weights[end-start]==0)) { end--; }
2268 for(
i=start;
i<=end;
i++)
2270 if(weights[
i-start]!=1)
2290 for(
i=start;
i<=end;
i++)
2292 if(weights[
i-start]<0)
2314 ord_struct.data.am.weights_m = weights + (end-start+1);
2315 ord_struct.data.am.len_gen=weights[end-start+1];
2350 while((start<end) && (weights[0]==0)) { start++; weights++; }
2351 while((start<end) && (weights[end-start]==0)) { end--; }
2362 for(
i=start;
i<=end;
i++)
2364 if(weights[
i-start]<0)
2534 int *pVarOffset =
tmp_typ[
typ_j].data.isTemp.pVarOffset;
2552 for(
int i = 0;
i <=
N;
i++ )
2555 if(
v[
i] != pVarOffset[
i] )
2557 pVarOffset[
i] =
v[
i];
2559 assume( pVarOffset[
i] != -1 );
2565 if( pVarOffset[0] != -1 )
2566 pVarOffset[0] &= 0x0fff;
2607 bits=16; bitmask=0xffff;
2609 else if (bitmask <= 1L)
2611 bits=1; bitmask = 1L;
2613 else if (bitmask <= 3L)
2615 bits=2; bitmask = 3L;
2617 else if (bitmask <= 7L)
2621 else if (bitmask <= 0xfL)
2623 bits=4; bitmask=0xfL;
2625 else if (bitmask <= 0x1fL)
2627 bits=5; bitmask=0x1fL;
2629 else if (bitmask <= 0x3fL)
2631 bits=6; bitmask=0x3fL;
2634 else if (bitmask <= 0x7fL)
2636 bits=7; bitmask=0x7fL;
2639 else if (bitmask <= 0xffL)
2641 bits=8; bitmask=0xffL;
2644 else if (bitmask <= 0x1ffL)
2646 bits=9; bitmask=0x1ffL;
2649 else if (bitmask <= 0x3ffL)
2651 bits=10; bitmask=0x3ffL;
2654 else if (bitmask <= 0xfffL)
2656 bits=12; bitmask=0xfff;
2659 else if (bitmask <= 0xffffL)
2661 bits=16; bitmask=0xffffL;
2664 else if (bitmask <= 0xfffffL)
2666 bits=20; bitmask=0xfffffL;
2668 else if (bitmask <= 0xffffffffL)
2670 bits=32; bitmask=0xffffffffL;
2672 else if (bitmask <= 0x7fffffffffffffffL)
2674 bits=63; bitmask=0x7fffffffffffffffL;
2678 bits=63; bitmask=0x7fffffffffffffffL;
2681 else if (bitmask <= 0x7fffffff)
2683 bits=31; bitmask=0x7fffffff;
2687 bits=31; bitmask=0x7fffffffL;
2758 if (r->block0[
i]==r->block1[
i])
2783 Warn(
"Error: unhandled ordering in rModifyRing: ringorder_S = [%d]",
r_ord);
2862 block0[
j]=r->block0[
i];
2863 block1[
j]=r->block1[
i];
2864 wvhdl[
j]=r->wvhdl[
i];
2890 res->wanted_maxExp=r->wanted_maxExp;
2897 if (r->pFDegOrig !=
res->pFDegOrig &&
2902 res->firstwv = r->firstwv;
2903 res->firstBlockEnds = r->firstBlockEnds;
2907 res->pLDeg = r->pLDegOrig;
2916 res->typ[0] = r->typ[0];
2918 if (r->typ[0].data.syz.limit > 0)
2920 res->typ[0].data.syz.syz_index
2921 = (
int*)
omAlloc((r->typ[0].data.syz.limit +1)*
sizeof(
int));
2922 memcpy(
res->typ[0].data.syz.syz_index, r->typ[0].data.syz.syz_index,
2923 (r->typ[0].data.syz.limit +1)*
sizeof(
int));
2936 r->typ[
i].data.is.limit,
2947 res->OrdSgn=r->OrdSgn;
2956 WarnS(
"error in nc_rComplete");
2969 WarnS(
"error in sca_Force!");
2995 res->block1[0] = r->N;
2996 res->wvhdl[0] = weights;
3011 WarnS(
"error in nc_rComplete");
3062 res->wanted_maxExp=r->wanted_maxExp;
3073 WarnS(
"error in nc_rComplete");
3117 r->CanShortOut=
FALSE;
3120 r->CanShortOut =
TRUE;
3128 r->CanShortOut=
FALSE;
3136 for (
i=(
N-1);
i>=0;
i--)
3140 r->CanShortOut=
FALSE;
3146 r->ShortOut = r->CanShortOut;
3148 assume( !( !r->CanShortOut && r->ShortOut ) );
3156 if(block1[
i]!=r->N) r->LexOrder=
TRUE;
3157 r->firstBlockEnds=block1[
i];
3158 r->firstwv = wvhdl[
i];
3167 for(
j=block1[
i]-block0[
i];
j>=0;
j--)
3169 if (r->firstwv[
j]==0) r->LexOrder=
TRUE;
3176 for(
j=block1[
i]-block0[
i];
j>=0;
j--)
3178 if (
w[
j]==0) r->LexOrder=
TRUE;
3185 if (r->pFDeg ==
p_Deg)
3206 r->pLDegOrig = r->pLDeg;
3213 int* block0 = r->block0;
3214 int* block1 = r->block1;
3215 int** wvhdl = r->wvhdl;
3224 r->LexOrder =
FALSE;
3231 for(
int ii=block0[0];
ii<=block1[0];
ii++)
3232 if (wvhdl[0][
ii-1]<0) { r->MixedOrder=2;
break;}
3234 for(
int ii=block0[0];
ii<=block1[0];
ii++)
3235 if (wvhdl[0][
ii-1]==0) { r->LexOrder=
TRUE;
break;}
3236 if ((block0[0]==1)&&(block1[0]==r->N))
3247 r->firstwv = wvhdl[0];
3259 if (r->OrdSgn == -1) r->pLDeg =
pLDeg0c;
3278 for(
int ii=block0[0];
ii<=block1[0];
ii++)
3280 if (wvhdl[0][
ii-1]<0) { r->MixedOrder=2;
break;}
3282 if (r->MixedOrder==0)
3284 if ((block0[0]==1)&&(block1[0]==r->N))
3292 r->firstBlockEnds=block1[0];
3293 r->firstwv = wvhdl[0];
3312 r->firstBlockEnds=block1[1];
3313 if (wvhdl!=
NULL) r->firstwv = wvhdl[1];
3321 for(
int ii=block0[1];
ii<=block1[1];
ii++)
3322 if (wvhdl[1][
ii-1]<0) { r->MixedOrder=2;
break;}
3323 if (r->MixedOrder==
FALSE)
3356 if(r->MixedOrder==
FALSE)
3371 r->pFDegOrig = r->pFDeg;
3386 for(
i=0;
i<r->OrdSize;
i++)
3389 ||(r->typ[
i].ord_typ==
ro_am))
3394 r->NegWeightL_Size=
l;
3395 r->NegWeightL_Offset=(
int *)
omAlloc(
l*
sizeof(
int));
3397 for(
i=0;
i<r->OrdSize;
i++)
3401 r->NegWeightL_Offset[
l]=r->typ[
i].data.wp.place;
3404 else if(r->typ[
i].ord_typ==
ro_am)
3406 r->NegWeightL_Offset[
l]=r->typ[
i].data.am.place;
3413 r->NegWeightL_Size = 0;
3414 r->NegWeightL_Offset =
NULL;
3426 if ( (r->cf->extRing!=
NULL)
3435 if (r->LexOrder || r->OrdSgn == -1 || (r->cf->extRing!=
NULL))
3450 r->pLexOrder=r->LexOrder;
3458static inline int sign(
int x) {
return (
x > 0) - (
x < 0);}
3489 r->BitsPerExp =
bits;
3497 for(
i=r->N;
i>=0 ;
i--)
3514 switch (r->order[
i])
3538 r->ComponentOrder=1;
3544 r->ComponentOrder=-1;
3550 k=r->block1[
i]-r->block0[
i]+1;
3555 r->wvhdl[
i]+(r->block1[
i]-r->block0[
i]+1)*
l);
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])
3646 if (r->block0[
i]==r->block1[
i])
3668 for(
jj=r->block1[
i]-r->block0[
i];
jj>=0;
jj--)
3679 if (r->block1[
i]!=r->block0[
i])
3693 for(
jj=r->block1[
i]-r->block0[
i];
jj>=0;
jj--)
3704 if (r->block1[
i]!=r->block0[
i])
3715 if (r->block1[
i]!=r->block0[
i])
3726 if (r->block1[
i]!=r->block0[
i])
3738 r->ComponentOrder=-1;
3746 r->ComponentOrder=-1;
3753 assume( r->block0[
i] == r->block1[
i] );
3754 const int s = r->block0[
i];
3800 for(
i=1 ;
i<=r->N ;
i++)
3827 r->ordsgn=(
long *)
omAlloc0(r->ExpL_Size*
sizeof(
long));
3829 for(
j=0;
j<r->CmpL_Size;
j++)
3854 r->pCompIndex=(r->VarOffset[0] & 0xffff);
3857 if (
i==r->pCompIndex)
i++;
3866 if (
i==r->pCompIndex)
i++;
3904 for(
int i=1;
i<=r->N;
i++)
3911 if ((r->block0[
j]<=
i)&&(r->block1[
j]>=
i))
3931 if(r->wvhdl[
j][
i-r->block0[
j]]<0)
3937 else if(r->wvhdl[
j][
i-r->block0[
j]]>0)
3948 if(r->wvhdl[
j][
i-r->block0[
j]]<0)
3954 else if(r->wvhdl[
j][
i-r->block0[
j]]>0)
3962 int add=r->block1[
j]-r->block0[
j]+1;
3967 if (r->wvhdl[
j][
i-r->block0[
j]]<0)
3973 else if(r->wvhdl[
j][
i-r->block0[
j]]>0)
4003 if (
nonneg>0) r->MixedOrder=1;
4014 if (r ==
NULL)
return;
4015 if (r->VarOffset !=
NULL)
4017 if (r->OrdSize!=0 && r->typ !=
NULL)
4019 for(
int i = 0;
i < r->OrdSize;
i++)
4020 if( r->typ[
i].ord_typ ==
ro_is)
4024 if( r->typ[
i].data.is.pVarOffset !=
NULL )
4029 else if (r->typ[
i].ord_typ ==
ro_syz)
4031 if(r->typ[
i].data.syz.limit > 0)
4032 omFreeSize(r->typ[
i].data.syz.syz_index, ((r->typ[
i].data.syz.limit) +1)*
sizeof(
int));
4036 assume( r->typ[
i].data.syzcomp.ShiftedComponents ==
NULL );
4037 assume( r->typ[
i].data.syzcomp.Components ==
NULL );
4047 if (r->PolyBin !=
NULL)
4053 if (r->ordsgn !=
NULL && r->CmpL_Size != 0)
4058 if (r->p_Procs !=
NULL)
4063 omfreeSize(r->VarL_Offset, r->VarL_Size*
sizeof(
int));
4064 r->VarL_Offset=
NULL;
4066 if (r->NegWeightL_Offset!=
NULL)
4068 omFreeSize(r->NegWeightL_Offset, r->NegWeightL_Size*
sizeof(
int));
4069 r->NegWeightL_Offset=
NULL;
4082 for (
i=1;
i<=r->N;
i++)
4088 for (
i=0,
j=0;
i<r->ExpL_Size;
i++)
4103 r->VarL_Offset = (
int*)
omAlloc(r->VarL_Size*
sizeof(
int));
4104 r->VarL_LowIndex = 0;
4107 for (
i=0,
j=0;
i<r->ExpL_Size;
i++)
4111 r->VarL_Offset[
j] =
i;
4112 if (
j > 0 && r->VarL_Offset[
j-1] != r->VarL_Offset[
j] - 1)
4113 r->VarL_LowIndex = -1;
4117 if (r->VarL_LowIndex >= 0)
4118 r->VarL_LowIndex = r->VarL_Offset[0];
4122 j = r->VarL_Offset[
min_j];
4123 r->VarL_Offset[
min_j] = r->VarL_Offset[0];
4124 r->VarL_Offset[0] =
j;
4134 for (
i=0;
i<r->ExpL_Size;
i++)
4138 for (
i=1;
i<=r->N;
i++)
4140 if (
shifts[r->VarOffset[
i] & 0xffffff] > r->VarOffset[
i] >> 24)
4141 shifts[r->VarOffset[
i] & 0xffffff] = r->VarOffset[
i] >> 24;
4144 for (
i=1;
i<=r->N;
i++)
4146 if (
shifts[r->VarOffset[
i] & 0xffffff] != 0)
4148 = (r->VarOffset[
i] & 0xffffff) |
4149 (((r->VarOffset[
i] >> 24) -
shifts[r->VarOffset[
i] & 0xffffff]) << 24);
4157 unsigned long divmask = 1;
4162 divmask |= (((
unsigned long) 1) << (
unsigned long)
i);
4177 const char *
TYP[]={
"ro_dp",
"ro_wp",
"ro_am",
"ro_wp64",
"ro_wp_neg",
"ro_cp",
4178 "ro_syzcomp",
"ro_syz",
"ro_isTemp",
"ro_is",
"ro_none"};
4181 Print(
"ExpL_Size:%d ",r->ExpL_Size);
4182 Print(
"CmpL_Size:%d ",r->CmpL_Size);
4183 Print(
"VarL_Size:%d\n",r->VarL_Size);
4184 Print(
"bitmask=0x%lx (expbound=%ld) \n",r->bitmask, r->bitmask);
4185 Print(
"divmask=%lx\n", r->divmask);
4186 Print(
"BitsPerExp=%d ExpPerLong=%d at L[%d]\n", r->BitsPerExp, r->ExpPerLong, r->VarL_Offset[0]);
4188 Print(
"VarL_LowIndex: %d\n", r->VarL_LowIndex);
4189 PrintS(
"VarL_Offset:\n");
4192 for(
j = 0;
j < r->VarL_Size;
j++)
4193 Print(
" VarL_Offset[%d]: %d ",
j, r->VarL_Offset[
j]);
4200 for(
j=0;
j<=r->N;
j++)
4201 Print(
" v%d at e-pos %d, bit %d\n",
4202 j,r->VarOffset[
j] & 0xffffff, r->VarOffset[
j] >>24);
4204 for(
j=0;
j<r->CmpL_Size;
j++)
4205 Print(
" ordsgn %ld at pos %d\n",r->ordsgn[
j],
j);
4206 Print(
"OrdSgn:%d\n",r->OrdSgn);
4208 for(
j=0;
j<r->OrdSize;
j++)
4210 Print(
" typ %s",
TYP[r->typ[
j].ord_typ]);
4211 if (r->typ[
j].ord_typ==
ro_syz)
4213 const short place = r->typ[
j].data.syz.place;
4214 const int limit = r->typ[
j].data.syz.limit;
4215 const int curr_index = r->typ[
j].data.syz.curr_index;
4216 const int* syz_index = r->typ[
j].data.syz.syz_index;
4218 Print(
" limit %d (place: %d, curr_index: %d), syz_index: ", limit, place, curr_index);
4220 if( syz_index ==
NULL )
4225 for(
i=0;
i <= limit;
i++ )
4226 Print(
"%d ", syz_index[
i]);
4233 Print(
" start (level) %d, suffixpos: %d, VO: ",r->typ[
j].data.isTemp.start, r->typ[
j].data.isTemp.suffixpos);
4236 else if (r->typ[
j].ord_typ==
ro_is)
4238 Print(
" start %d, end: %d: ",r->typ[
j].data.is.start, r->typ[
j].data.is.end);
4242 Print(
" limit %d",r->typ[
j].data.is.limit);
4249 else if (r->typ[
j].ord_typ==
ro_am)
4251 Print(
" place %d",r->typ[
j].data.am.place);
4252 Print(
" start %d",r->typ[
j].data.am.start);
4253 Print(
" end %d",r->typ[
j].data.am.end);
4254 Print(
" len_gen %d",r->typ[
j].data.am.len_gen);
4257 for(
l=r->typ[
j].data.am.start;
l<=r->typ[
j].data.am.end;
l++)
4258 Print(
" %d",r->typ[
j].data.am.weights[
l-r->typ[
j].data.am.start]);
4259 l=r->typ[
j].data.am.end+1;
4260 int ll=r->typ[
j].data.am.weights[
l-r->typ[
j].data.am.start];
4263 Print(
" %d",r->typ[
j].data.am.weights[
lll-r->typ[
j].data.am.start]);
4267 Print(
" place %d",r->typ[
j].data.dp.place);
4271 Print(
" start %d",r->typ[
j].data.dp.start);
4272 Print(
" end %d",r->typ[
j].data.dp.end);
4273 if ((r->typ[
j].ord_typ==
ro_wp)
4277 for(
int l=r->typ[
j].data.wp.start;
l<=r->typ[
j].data.wp.end;
l++)
4278 Print(
" %d",r->typ[
j].data.wp.weights[
l-r->typ[
j].data.wp.start]);
4280 else if (r->typ[
j].ord_typ==
ro_wp64)
4284 for(
l=r->typ[
j].data.wp64.start;
l<=r->typ[
j].data.wp64.end;
l++)
4285 Print(
" %ld",(
long)(r->typ[
j].data.wp64.weights64+
l-r->typ[
j].data.wp64.start));
4291 Print(
"pOrdIndex:%d pCompIndex:%d\n", r->pOrdIndex, r->pCompIndex);
4292 Print(
"OrdSize:%d\n",r->OrdSize);
4293 PrintS(
"--------------------\n");
4294 for(
j=0;
j<r->ExpL_Size;
j++)
4298 Print(
"ordsgn %ld ", r->ordsgn[
j]);
4304 if( (r->VarOffset[
i] & 0xffffff) ==
j )
4305 {
Print(
"v%d at e[%d], bit %d; ",
i,r->VarOffset[
i] & 0xffffff,
4306 r->VarOffset[
i] >>24 ); }
4308 if( r->pCompIndex==
j )
PrintS(
"v0; ");
4309 for(
i=0;
i<r->OrdSize;
i++)
4311 if (r->typ[
i].data.dp.place ==
j)
4313 Print(
"ordrec:%s (start:%d, end:%d) ",
TYP[r->typ[
i].ord_typ],
4314 r->typ[
i].data.dp.start, r->typ[
i].data.dp.end);
4318 if (
j==r->pOrdIndex)
4323 Print(
"LexOrder:%d, MixedOrder:%d\n",r->LexOrder, r->MixedOrder);
4325 Print(
"NegWeightL_Size: %d, NegWeightL_Offset: ", r->NegWeightL_Size);
4326 if (r->NegWeightL_Offset==
NULL)
PrintS(
" NULL");
4328 for(
j = 0;
j < r->NegWeightL_Size;
j++)
4329 Print(
" [%d]: %d ",
j, r->NegWeightL_Offset[
j]);
4350#define pFDeg_CASE(A) if(r->pFDeg == A) PrintS( "" #A "" )
4356 Print(
"(%p)", r->pFDeg);
4359 Print(
"pLDeg : (%p)", r->pLDeg);
4371 else Print(
"%p\n",r->p_Setm);
4381 Print(
"\nexp[0..%d]\n",r->ExpL_Size-1);
4382 for(
i=0;
i<r->ExpL_Size;
i++)
4390 if (
j==0) {
PrintS(
"...\n");
break; }
4399 Print(
"\nexp[0..%d]\n",
R->ExpL_Size - 1);
4400 for(
int i = 0;
i <
R->ExpL_Size;
i++)
4489 WarnS(
"rAssure_SyzComp: input ring has an IS-ordering!");
4500 int ** wvhdl =(
int **)
omAlloc0((
i+1)*
sizeof(
int**));
4503 res->order[
j]=r->order[
j-1];
4504 res->block0[
j]=r->block0[
j-1];
4505 res->block1[
j]=r->block1[
j-1];
4506 if (r->wvhdl[
j-1] !=
NULL)
4512 int l=r->block1[
j-1]-r->block0[
j-1]+1;
4517 l+=r->wvhdl[
j-1][r->block1[
j-1]-r->block0[
j-1]+1]+1;
4520 memcpy(wvhdl[
j],r->wvhdl[
j-1],
l*
sizeof(
int));
4538 WarnS(
"error in nc_rComplete");
4548 if (r->qideal!=
NULL)
4578 pos=r->VarL_LowIndex;
4583 for(
int i=r->OrdSize-1;
i>=0;
i--)
4585 if ((r->typ[
i].ord_typ==
ro_dp)
4586 && (r->typ[
i].data.dp.start==1)
4587 && (r->typ[
i].data.dp.end==r->N))
4589 pos=r->typ[
i].data.dp.place;
4608 res->ExpL_Size=r->ExpL_Size+1;
4612 for(
j=0;
j<r->CmpL_Size;
j++)
4614 res->ordsgn[
j] = r->ordsgn[
j];
4616 res->OrdSize=r->OrdSize+1;
4625 res->typ[
res->OrdSize-1].data.dp.start=1;
4626 res->typ[
res->OrdSize-1].data.dp.end=
res->N;
4627 res->typ[
res->OrdSize-1].data.dp.place=
res->ExpL_Size-1;
4628 pos=
res->ExpL_Size-1;
4644 WarnS(
"error in nc_rComplete");
4650 if (r->qideal!=
NULL)
4680 if (r->order[
i] == 0)
4698 if (r->wvhdl[
j]!=
NULL)
4704 int l=r->block1[
j]-r->block0[
j]+1;
4709 l+=r->wvhdl[
j][r->block1[
j]-r->block0[
j]+1]+1;
4731 WarnS(
"error in nc_rComplete");
4782 WarnS(
"error in nc_rComplete");
4816 WarnS(
"error in nc_rComplete");
4833 WarnS(
"error in nc_SetupQuotient");
4859 (r->order[0] ==
b1) &&
4860 (r->order[1] ==
b2) &&
4873 res->block1[1] = r->N;
4878 res->block1[0] = r->N;
4888 WarnS(
"error in nc_rComplete");
4907 for(
int i=0;
i<r->N;
i++)
4909 if ((*
w)[
i]!=r->wvhdl[0][
i]) { ok=
FALSE;
break;}
4921 res->block1[1] = r->N;
4922 res->wvhdl[0]=(
int*)
omAlloc(r->N*
sizeof(
int));
4923 for(
int i=0;
i<r->N;
i++)
4925 r->wvhdl[0][
i]=(*w)[
i];
4935 WarnS(
"error in nc_rComplete");
4948 Print(
"rAssure_InducedSchreyerOrdering(r, complete = %d, sgn = %d): r: \n", complete,
sgn);
4965 int ** wvhdl =(
int **)
omAlloc0((n+2)*
sizeof(
int**));
4973 res->block0[
j] =
res->block1[
j] = 0;
4977 for(
int i = 0; (
i <= n) && (r->order[
i] != 0);
i++,
j++)
4979 res->order [
j] = r->order [
i];
4980 res->block0[
j] = r->block0[
i];
4981 res->block1[
j] = r->block1[
i];
4983 if (r->wvhdl[
i] !=
NULL)
4989 int l=(r->block1[
i]-r->block0[
i]+1);
4994 l+=r->wvhdl[
i][r->block1[
i]-r->block0[
i]+1]+1;
4997 memcpy(wvhdl[
j],r->wvhdl[
i],
l*
sizeof(
int));
5029 WarnS(
"error in nc_rComplete");
5041 if (r->qideal!=
NULL)
5103 Print(
"rIsIS(p: %d)\nF:",
p);
5114 for(
int pos = 0; pos < r->OrdSize; pos++ )
5115 if( r->typ[pos].ord_typ ==
ro_is)
5137 dReportError(
"Error: WRONG USE of rSetISReference: wrong ring! (typ == NULL)");
5146 dReportError(
"Error: WRONG USE of rSetISReference: specified ordering block was not found!!!" );
5151 if(
i != r->typ[pos].data.is.limit )
5152 Print(
"Changing record on pos: %d\nOld limit: %d --->> New Limit: %d\n", pos, r->typ[pos].data.is.limit,
i);
5158 if( r->typ[pos].data.is.F !=
NULL)
5161 PrintS(
"Deleting old reference set F... \n");
5164 r->typ[pos].data.is.F =
NULL;
5169 r->typ[pos].data.is.F =
FF;
5171 r->typ[pos].data.is.limit =
i;
5195 if ((r->typ!=
NULL) && (r->typ[0].ord_typ==
ro_syz))
5197 r->block0[0]=r->block1[0] =
k;
5198 if(
k == r->typ[0].data.syz.limit )
5202 if (r->typ[0].data.syz.limit == 0)
5204 r->typ[0].data.syz.syz_index = (
int*)
omAlloc0((
k+1)*
sizeof(
int));
5205 r->typ[0].data.syz.syz_index[0] = 0;
5206 r->typ[0].data.syz.curr_index = 1;
5210 r->typ[0].data.syz.syz_index = (
int*)
5212 (r->typ[0].data.syz.limit+1)*
sizeof(
int),
5215 for (
i=r->typ[0].data.syz.limit + 1;
i<=
k;
i++)
5217 r->typ[0].data.syz.syz_index[
i] =
5218 r->typ[0].data.syz.curr_index;
5220 if(
k < r->typ[0].data.syz.limit)
5223 Warn(
"rSetSyzComp called with smaller limit (%d) as before (%d)",
k, r->typ[0].data.syz.limit);
5225 r->typ[0].data.syz.curr_index = 1 + r->typ[0].data.syz.syz_index[
k];
5229 r->typ[0].data.syz.limit =
k;
5230 r->typ[0].data.syz.curr_index++;
5239 Warn(
"rSetSyzComp(%d) in an IS ring! Be careful!",
k);
5244 r->block0[0] = r->block1[0] =
k;
5259 if ((r->typ!=
NULL) && (r->typ[0].ord_typ==
ro_syz) &&
5260 r->typ[0].data.syz.limit > 0 &&
i > 0)
5264 for (
j=0;
j<r->typ[0].data.syz.limit;
j++)
5266 if (r->typ[0].data.syz.syz_index[
j] ==
i &&
5267 r->typ[0].data.syz.syz_index[
j+1] !=
i)
5269 assume(r->typ[0].data.syz.syz_index[
j+1] ==
i+1);
5273 return r->typ[0].data.syz.limit;
5278 WarnS(
"rGetMaxSyzComp: order c");
5293 if ((r->order[0]==
ringorder_dp) &&(r->block0[0]==1) &&(r->block1[0]==r->N))
5296 && ((r->order[1]==
ringorder_dp) &&(r->block0[1]==1) &&(r->block1[1]==r->N)))
5303 if ((r->order[0]==
ringorder_Dp) &&(r->block0[0]==1) &&(r->block1[0]==r->N))
5306 && ((r->order[1]==
ringorder_Dp) &&(r->block0[1]==1) &&(r->block1[1]==r->N)))
5313 if ((r->order[0]==
ringorder_lp) &&(r->block0[0]==1) &&(r->block1[0]==r->N))
5316 && ((r->order[1]==
ringorder_lp) &&(r->block0[1]==1) &&(r->block1[1]==r->N)))
5326 while((r->typ[
i].ord_typ!=
ro_wp64) && (r->typ[
i].ord_typ>0))
i++;
5328 return r->typ[
i].data.wp64.weights64;
5336 memcpy(r->typ[0].data.wp64.weights64,
wv,r->N*
sizeof(
int64));
5347 for(
int k=
size;
k>pos;
k--) r->wvhdl[
k]=r->wvhdl[
k-1];
5359 for(
int k=pos+1;
k<
size;
k++) r->wvhdl[
k]=r->wvhdl[
k+1];
5369 for(
int j=0;
j<=
i2;
j++)
5377#define rOppVar(R,I) (rVar(R)+1-I)
5395 if (src->qideal !=
NULL)
5403 for(
i=
i2;
i>=0;
i--)
5409 p = r->names[
rVar(r)-1-
i];
5410 r->names[
rVar(r)-1-
i] = r->names[
i];
5428 char *
p=r->names[
i];
5481 for(
i=0; src->order[
i]!=0;
i++)
5483 switch (src->order[
i])
5488 r->order[
j]=src->order[
i];
5492 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5493 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5497 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5498 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]=(
int*)
omAlloc((r->block1[
j]-r->block0[
j]+1)*
sizeof(
int));
5523 for(
int k=r->block0[
j];
k<=r->block1[
j];
k++)
5524 r->wvhdl[
j][
k-r->block0[
j]]=1;
5527 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5528 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5536 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5537 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5538 r->wvhdl[
j]=r->wvhdl[
j+1]; r->wvhdl[
j+1]=
NULL;
5542 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5543 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5551 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5552 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5553 r->wvhdl[
j]=r->wvhdl[
j+1]; r->wvhdl[
j+1]=
NULL;
5557 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5558 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5565 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5566 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5567 int n=r->block1[
j]-r->block0[
j];
5569 for (
int nn=0;
nn<=n;
nn++)
5578 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5579 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5624 for(
i=0; src->order[
i]!=0;
i++)
5626 switch (src->order[
i])
5631 r->order[
j]=src->order[
i];
5635 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5636 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5640 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5641 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5646 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5647 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5653 r->block0[
j]=
rOppVar(r, src->block1[
i]);
5654 r->block1[
j]=
rOppVar(r, src->block0[
i]);
5703 for(
i=1;
i<=r->N;
i++)
5719 MATELEM(C,
nj,
ni) =
p_PermPoly(
MATELEM(src->GetNC()->C,
i,
j),perm,src,r,
nMap,
par_perm,
rPar(src));
5722 MATELEM(
D,
nj,
ni) =
p_PermPoly(
MATELEM(src->GetNC()->D,
i,
j),perm,src,r,
nMap,
par_perm,
rPar(src));
5730 WarnS(
"Error initializing non-commutative multiplication!");
5738 assume( r->GetNC()->IsSkewConstant == src->GetNC()->IsSkewConstant);
5745 if (src->qideal !=
NULL)
5748 r->qideal =
idOppose(src, src->qideal, r);
5750 r->qideal =
id_Copy(src->qideal, r);
5782 WarnS(
"Error in rEnvelope at rSum");
5805 const int N = dest->N;
5825 for (
int i = 1;
i <
N;
i++)
5827 for (
int j =
i + 1;
j <=
N;
j++)
5830 const poly
p =
p_NSet(n, dest);
5892 Werror(
"n_IsParam: IsParam is not to be used for (coeff_type = %d)",
getCoeffType(C));
5901 WerrorS(
"only for rings with an ordering of one block");
5918 WerrorS(
"ordering must be dp,Dp,lp,rp,ds,Ds or ls");
5921 for(
int i=r->N-1;
i>=0;
i--)
5925 Werror(
"duplicate variable name >>%s<<",
v);
5931 #ifdef HAVE_SHIFTBBA
5934 R->isLPring=r->isLPring+1;
5935 R->N=((r->N)/r->isLPring)+r->N;
5939 for(
int b=0;
b<((r->N)/r->isLPring);
b++)
5942 for(
int i=
R->isLPring-1;
i>0;
i--)
5943 names[
i+
b*
R->isLPring]=
R->names[
i-1+
b*r->isLPring];
5948 for(
int b=0;
b<((r->N)/r->isLPring);
b++)
5951 for(
int i=
R->isLPring-2;
i>=0;
i--)
5952 names[
i+
b*
R->isLPring]=
R->names[
i+
b*r->isLPring];
5964 for(
int i=
R->N-1;
i>0;
i--) names[
i]=
R->names[
i-1];
5969 for(
int i=
R->N-2;
i>=0;
i--) names[
i]=
R->names[
i];
5983 WerrorS(
"only for rings with an ordering of one block");
6000 WerrorS(
"ordering must be dp,Dp,lp,rp,ds,Ds or ls");
6011 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 coefficients
@ 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)
BOOLEAN rOrd_is_Ds(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,