Changeset 67e0dc in git for kernel/combinatorics/hdegree.cc
- Timestamp:
- Oct 21, 2015, 2:57:17 PM (9 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 5bd9ec36b87fa8f176a21995de2b56724d67be2d
- Parents:
- a1b6c917a1c8886b1bba1b05680ff06cfd39c82def1a968e317a12b42f88e04cd7f9483e47fba2f7
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/combinatorics/hdegree.cc
ra1b6c91 r67e0dc 1010 1010 int i; 1011 1011 int k = ak; 1012 1013 1012 #if HAVE_RINGS 1014 1013 if (rField_is_Ring(currRing) && (currRing->OrdSgn == -1)) 1015 1014 { 1016 //consider just monic generators (over rings with zero-divisors) 1017 ideal SS=id_Copy(S,tailRing); 1018 for(i=0;i<=idElem(SS);i++) 1019 { 1020 if(pIsPurePower(SS->m[i])==0) 1021 p_Delete(&SS->m[i],tailRing); 1015 //consider just monic generators (over rings with zero-divisors) 1016 ideal SS=id_Copy(S,tailRing); 1017 for(i=0;i<=idElem(S);i++) 1018 { 1019 if(p_IsPurePower(SS->m[i],tailRing)==0) 1020 { 1021 p_Delete(&SS->m[i],tailRing); 1022 } 1022 1023 } 1023 1024 S=id_Copy(SS,tailRing); 1024 } 1025 idSkipZeroes(S); 1026 } 1027 #if 0 1028 printf("\nThis is HC:\n"); 1029 for(int ii=0;ii<=idElem(S);ii++) 1030 { 1031 pWrite(S->m[ii]); 1032 } 1033 //getchar(); 1025 1034 #endif 1026 1035 #endif 1036 if(idElem(S) == 0) 1037 return; 1027 1038 hNvar = (currRing->N); 1028 1039 hexist = hInit(S, Q, &hNexist, tailRing); // tailRing? … … 1031 1042 else 1032 1043 hNstc = hNexist; 1044 assume(hNexist > 0); 1033 1045 hwork = (scfmon)omAlloc(hNexist * sizeof(scmon)); 1034 1046 hvar = (varset)omAlloc((hNvar + 1) * sizeof(int));
Note: See TracChangeset
for help on using the changeset viewer.