Changeset 2d2e40 in git for libpolys/polys
- Timestamp:
- Dec 5, 2011, 2:54:08 PM (12 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 1f03abac6bde42c766ce63555d33ee5bf00aa447
- Parents:
- 1f2d3b43da540e3165c73bc71f9dd23f9ec5170f
- Location:
- libpolys/polys
- Files:
-
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
libpolys/polys/ext_fields/algext.cc
r1f2d3b r2d2e40 571 571 return (number)p; 572 572 } 573 CanonicalForm naConvSingNFactoryN( number n, BOOLEAN setChar, const coeffs cf )573 CanonicalForm naConvSingNFactoryN( number n, BOOLEAN /*setChar*/, const coeffs cf ) 574 574 { 575 575 naTest(n); … … 639 639 #endif 640 640 641 number naCopyExt(number a, const coeffs src, const coeffs dst)641 number naCopyExt(number a, const coeffs src, const coeffs) 642 642 { 643 643 fraction fa=(fraction)a; -
libpolys/polys/matpol.cc
r1f2d3b r2d2e40 728 728 } 729 729 730 static void mp_FinalClean(matrix a, const ring R)730 static void mp_FinalClean(matrix a, const ring) 731 731 { 732 732 omFreeSize((ADDRESS)a->m,a->nrows*a->ncols*sizeof(poly)); … … 1457 1457 /// entries of a are minors and go to result (only if not in R) 1458 1458 void mp_MinorToResult(ideal result, int &elems, matrix a, int r, int c, 1459 ideal R, const ring ri)1459 ideal R, const ring) 1460 1460 { 1461 1461 poly *q1; -
libpolys/polys/monomials/p_polys.cc
r1f2d3b r2d2e40 3307 3307 * NOTE: this only works for Frank's alg. & trans. fields 3308 3308 */ 3309 poly n_PermNumber(const number z, const int *par_perm, const int OldPar, const ring src, const ring dst)3309 poly n_PermNumber(const number z, const int *par_perm, const int , const ring src, const ring dst) 3310 3310 { 3311 3311 #if 0 -
libpolys/polys/monomials/ring.cc
r1f2d3b r2d2e40 1604 1604 #ifdef HAVE_PLURAL 1605 1605 if (rIsPluralRing(r)) 1606 if( nc_rCopy(res, r, true) ) ;1606 if( nc_rCopy(res, r, true) ) {} 1607 1607 #endif 1608 1608 -
libpolys/polys/nc/ncSACache.h
r1f2d3b r2d2e40 88 88 }; 89 89 90 virtual void History(const EHistoryType t, const CExponent a, const CExponent b, const poly p = NULL)90 virtual void History(const EHistoryType , const CExponent a, const CExponent b, const poly p = NULL) 91 91 { 92 92 PrintS("CCacheHash::History(a, b, [p])!\n"); -
libpolys/polys/simpleideals.cc
r1f2d3b r2d2e40 1230 1230 if (cp>mod->rank) 1231 1231 { 1232 Print("## inv. rank %ld -> % d\n",mod->rank,cp);1232 Print("## inv. rank %ld -> %ld\n",mod->rank,cp); 1233 1233 int k,l,o=mod->rank; 1234 1234 mod->rank=cp; -
libpolys/polys/sparsmat.cc
r1f2d3b r2d2e40 528 528 poly sparse_mat::smDet() 529 529 { 530 int y;531 530 poly res = NULL; 532 531 … … 938 937 smpoly res, a, b; 939 938 poly ha, hr, x, y; 940 int e, ip, ir, ia , lev;939 int e, ip, ir, ia; 941 940 942 941 if ((c == NULL) || (r == NULL)) … … 1985 1984 static void sm_ExpMultDiv(poly t, const poly b, const poly c, const ring R) 1986 1985 { 1987 int i;1988 1986 p_Test(t,R); 1989 1987 p_LmTest(b,R); … … 2372 2370 { 2373 2371 sparse_number_mat *linsolv; 2374 ring origR;2375 2372 ring tmpR; 2376 2373 ideal rr;
Note: See TracChangeset
for help on using the changeset viewer.