Changeset bdea13 in git
- Timestamp:
- Aug 1, 2016, 2:41:43 PM (7 years ago)
- Branches:
- (u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
- Children:
- c087b397f47ebaf577c6159ff11e8117a1b50545
- Parents:
- 36d61f07ab133fd386896763b697a66e352e67ba0ea8d8757a6a19febdf30dc6b53151e344747dd6
- Files:
-
- 6 added
- 11 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/brnoeth.lib
r0ea8d8 rbdea13 370 370 // the point is non-rational and a field extension with minpoly=aux 371 371 // is needed 372 ring r_ext=(char(basering),@a),(x,y,z),lp; 372 ring r_ext=(char(basering),@a),(x,y,z),lp; 373 poly aux=imap(base_r,aux); 374 minpoly=number(subst(aux,x,@a)); 373 375 poly F=imap(r_auxz,F); 374 376 poly f_xz=subst(F,y,1); 375 poly aux=imap(base_r,aux);376 minpoly=number(subst(aux,x,@a));377 377 map phi=r_ext,x+@a,0,z; 378 378 poly f_origin=phi(f_xz); -
Singular/libsingular.h
r36d61f0 rbdea13 29 29 void siInit(char *); 30 30 31 /* we need this function in Sage*/32 number nr2mMapZp(number from); // TODO: replace with something else...33 31 34 32 -
Tst/Short.lst
r0ea8d8 rbdea13 76 76 Short/bug_633.tst 77 77 Short/bug_7.tst 78 Short/bug_tr770.tst 78 79 Short/bug_8.tst 79 80 Short/bug_9.tst -
Tst/Short/ok_s.lst
r0ea8d8 rbdea13 61 61 bug_tr759 62 62 bug_tr760_761 63 bug_tr767 63 64 bug_genus_etc 64 65 conv_bi -
kernel/GBEngine/shiftgb.cc
r0ea8d8 rbdea13 164 164 165 165 poly q = NULL; 166 poly pp = p; // pCopy(p);166 poly pp = p; 167 167 while (pp!=NULL) 168 168 { 169 q = p_Add_q(q, pmLPshift(pp,sh,uptodeg,lV),currRing);169 poly h=pp; 170 170 pIter(pp); 171 }172 /* delete pp? */173 p_Delete(&p,currRing);174 /* int version: returns TRUE if it was successful */171 pNext(h)=NULL; 172 h=pmLPshift(h,sh,uptodeg,lV); 173 q = p_Add_q(q, h,currRing); 174 } 175 175 return(q); 176 176 } … … 202 202 int *s=(int *)omAlloc0((currRing->N+1)*sizeof(int)); 203 203 pGetExpV(p,e); 204 number c = pGetCoeff(p);205 204 int j; 206 205 for (j=1; j<=currRing->N; j++) … … 211 210 } 212 211 } 213 poly m = pOne(); 214 pSetExpV(m,s); 212 pSetExpV(p,s); 215 213 /* pSetm(m); */ /* done in the pSetExpV */ 216 /* think on the component */217 pSetCoeff0(m,c);218 214 freeT(e, currRing->N); 219 215 freeT(s, currRing->N); 220 return( m);216 return(p); 221 217 } 222 218 -
libpolys/coeffs/longrat.cc
r36d61f0 rbdea13 72 72 void nlWrite(number a, const coeffs r); 73 73 74 number nlGetDenom(number &n, const coeffs r);75 number nlGetNumerator(number &n, const coeffs r);76 74 void nlCoeffWrite(const coeffs r, BOOLEAN details); 77 75 number nlChineseRemainder(number *x, number *q,int rl, const coeffs C); -
libpolys/coeffs/longrat.h
r36d61f0 rbdea13 13 13 14 14 struct snumber; typedef struct snumber *number; 15 16 number nlGetDenom(number &n, const coeffs r); 17 number nlGetNumerator(number &n, const coeffs r); 15 18 16 19 /*-----------------------------------------------------------------*/ -
libpolys/coeffs/rintegers.cc
r36d61f0 rbdea13 37 37 BOOLEAN nrzGreaterZero (number k, const coeffs r); 38 38 number nrzMult (number a, number b, const coeffs r); 39 number nrzInit (long i, const coeffs r);40 39 long nrzInt (number &n, const coeffs r); 41 40 number nrzAdd (number a, number b, const coeffs r); -
libpolys/coeffs/rintegers.h
r36d61f0 rbdea13 29 29 void nrzWrite (number a, const coeffs r); 30 30 31 number nrzInit (long i, const coeffs r); 32 31 33 #endif 32 34 -
libpolys/coeffs/rmodulo2m.h
r36d61f0 rbdea13 17 17 18 18 BOOLEAN nr2mInitChar (coeffs r, void*); 19 number nr2mMapZp (number from, const coeffs /*src*/, const coeffs dst); 19 20 20 21 #endif -
libpolys/coeffs/rmodulon.h
r36d61f0 rbdea13 19 19 20 20 BOOLEAN nrnInitChar (coeffs r, void*); 21 number nrnMapGMP(number from, const coeffs /*src*/, const coeffs dst); 22 nMapFunc nrnSetMap(const coeffs src, const coeffs dst); 21 23 22 24 #endif
Note: See TracChangeset
for help on using the changeset viewer.