Changeset 7ac612 in git
- Timestamp:
- Jul 29, 2011, 4:40:54 PM (12 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
- Children:
- 38f8dfcfefe32659c95fdaeaba57fc8133c2dca8
- Parents:
- ad3aa7914b6579de07eda993d2ee2be453525603
- git-author:
- Hans Schoenemann <hannes@mathematik.uni-kl.de>2011-07-29 16:40:54+02:00
- git-committer:
- Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 13:01:16+01:00
- Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/fglm.h
rad3aa7 r7ac612 15 15 16 16 #ifdef HAVE_FACTORY 17 #include <factory/factory .h>17 #include <factory/factoryconf.h> 18 18 19 19 #include <polys/polys.h> … … 39 39 BOOLEAN isBasisOrEdge() const { return ( (divisors[0] == numVars) ? TRUE : FALSE ); } 40 40 void newDivisor( int var ) { divisors[ ++divisors[0] ]= var; } 41 #ifndef NOSTREAMIO42 friend OSTREAM & operator <<(OSTREAM &, fglmSelem);43 #endif41 //#ifndef NOSTREAMIO 42 //friend OSTREAM & operator <<(OSTREAM &, fglmSelem); 43 //#endif 44 44 }; 45 #ifndef NOSTREAMIO46 inline OSTREAM & operator <<(OSTREAM & os, fglmSelem) { return os;};47 #endif45 //#ifndef NOSTREAMIO 46 //inline OSTREAM & operator <<(OSTREAM & os, fglmSelem) { return os;}; 47 //#endif 48 48 49 49 class fglmDelem … … 59 59 BOOLEAN isBasisOrEdge() const { return ( (insertions == 0) ? TRUE : FALSE ); } 60 60 void newDivisor() { insertions--; } 61 #ifndef NOSTREAMIO62 friend OSTREAM & operator <<(OSTREAM &, fglmDelem);63 #endif61 //#ifndef NOSTREAMIO 62 //friend OSTREAM & operator <<(OSTREAM &, fglmDelem); 63 //#endif 64 64 }; 65 #ifndef NOSTREAMIO66 inline OSTREAM & operator <<(OSTREAM & os, fglmDelem) { return os;};67 #endif65 //#ifndef NOSTREAMIO 66 //inline OSTREAM & operator <<(OSTREAM & os, fglmDelem) { return os;}; 67 //#endif 68 68 69 69 // fglmzero(...): -
kernel/walkProc.cc
rad3aa7 r7ac612 253 253 pperm= NULL; 254 254 255 maFindPerm( sring->names, nvar, sring-> parameter, npar,256 dring->names, nvar, dring-> parameter, npar, vperm, pperm,255 maFindPerm( sring->names, nvar, sring->extring->names, npar, 256 dring->names, nvar, dring->extring->names, npar, vperm, pperm, 257 257 dring->ch); 258 258 -
libpolys/polys/monomials/maps.cc
rad3aa7 r7ac612 195 195 void maFindPerm(char **preim_names, int preim_n, char **preim_par, int preim_p, 196 196 char **names, int n, char **par, int nop, 197 int * perm, int *par_perm, intch)197 int * perm, int *par_perm, n_coeffType ch) 198 198 { 199 199 int i,j; … … 214 214 if ((perm[i+1]==0)&&(par!=NULL) 215 215 // do not consider par of Fq 216 && (ch < 2))216 && (ch!=n_GF)) 217 217 { 218 218 for(j=0; j<nop; j++) … … 272 272 maFindPerm(r->names, rVar(r), rParameter(r), rPar(r), 273 273 dst_r->names, rVar(dst_r),rParameter(dst_r), rPar(dst_r), 274 perm,NULL, dst_r->cf-> ch);274 perm,NULL, dst_r->cf->type); 275 275 poly res=p_PermPoly(p,perm,r,dst_r, nMap /*,par_perm,rPar(r)*/); 276 276 omFreeSize((ADDRESS)perm,(r->N+1)*sizeof(int)); -
libpolys/polys/monomials/maps.h
rad3aa7 r7ac612 28 28 void maFindPerm(char **preim_names, int preim_n, char **preim_par, int preim_p, 29 29 char **names, int n, char **par, int nop, 30 int * perm, int *par_perm, intch);30 int * perm, int *par_perm, n_coeffType ch); 31 31 poly pSubstPoly(poly p, int var, poly image); 32 32 ideal idSubstPoly(ideal id, int n, poly e); -
libpolys/polys/monomials/ring.cc
rad3aa7 r7ac612 1126 1126 maFindPerm(R1->names, rVar(R1), rParameter(R1), rPar(R1), 1127 1127 sum->names, rVar(sum), rParameter(sum), rPar(sum), 1128 perm1, par_perm1, sum->cf-> ch);1128 perm1, par_perm1, sum->cf->type); 1129 1129 1130 1130 maFindPerm(R2->names, rVar(R2), rParameter(R2), rPar(R2), 1131 1131 sum->names, rVar(sum), rParameter(sum), rPar(sum), 1132 perm2, par_perm2, sum->cf-> ch);1132 perm2, par_perm2, sum->cf->type); 1133 1133 1134 1134 … … 1231 1231 maFindPerm(r1->names, rVar(r1), rParameter(r1), rPar(r1), 1232 1232 sum->names, rVar(sum), rParameter(sum), rPar(sum), 1233 perm1, par_perm1, sum->cf-> ch);1233 perm1, par_perm1, sum->cf->type); 1234 1234 nMapFunc nMap1 = n_SetMap(r1->cf,sum->cf); 1235 1235 Q1 = idInit(IDELEMS(r1->qideal),1); … … 1254 1254 maFindPerm(r2->names, rVar(r2), rParameter(r2), rPar(r2), 1255 1255 sum->names, rVar(sum), rParameter(sum), rPar(sum), 1256 perm2, par_perm2, sum->cf-> ch);1256 perm2, par_perm2, sum->cf->type); 1257 1257 nMapFunc nMap2 = n_SetMap(r2->cf,sum->cf); 1258 1258 Q2 = idInit(IDELEMS(r2->qideal),1);
Note: See TracChangeset
for help on using the changeset viewer.