Changeset 260672 in git
 Timestamp:
 Feb 22, 2012, 9:52:58 PM (11 years ago)
 Branches:
 (u'jengelhdatetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
 Children:
 dd156fc3fe4ce7e785c8c6aa066f73f3c887f9bb
 Parents:
 7729907f549543f553ed6efd161b1abbfd835b3c
 gitauthor:
 Oleksandr Motsak <motsak@mathematik.unikl.de>20120222 21:52:58+01:00
 gitcommitter:
 Oleksandr Motsak <motsak@mathematik.unikl.de>20120223 20:35:09+01:00
 Location:
 libpolys/polys/monomials
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

libpolys/polys/monomials/p_polys.h
r772990 r260672 81 81 unsigned long p_GetShortExpVector(poly a, const ring r); 82 82 83 /* divisibility check over ground ring (which may contain zero divisors); 83 #ifdef HAVE_RINGS 84 /*! divisibility check over ground ring (which may contain zero divisors); 84 85 TRUE iff LT(f) divides LT(g), i.e., LT(f)*c*m = LT(g), for some 85 86 coefficient c and some monomial m; 86 does not take components into account */87 #ifdef HAVE_RINGS 87 does not take components into account 88 */ 88 89 BOOLEAN p_DivisibleByRingCase(poly f, poly g, const ring r); 89 90 #endif … … 101 102 long p_DegW(poly p, const short *w, const ring R); 102 103 103 // return TRUE if all monoms have the same component104 /// return TRUE if all monoms have the same component 104 105 BOOLEAN p_OneComp(poly p, const ring r); 105 106 106 // return i, if head depends only on var(i)107 /// return i, if head depends only on var(i) 107 108 int p_IsPurePower(const poly p, const ring r); 108 109 109 // return i, if poly depends only on var(i)110 /// return i, if poly depends only on var(i) 110 111 int p_IsUnivariate(poly p, const ring r); 111 112 112 // set entry e[i] to 1 if var(i) occurs in p, ignore var(j) if e[j]>0113 // return #(e[i]>0)113 /// set entry e[i] to 1 if var(i) occurs in p, ignore var(j) if e[j]>0 114 /// return #(e[i]>0) 114 115 int p_GetVariables(poly p, int * e, const ring r); 115 116 116 // returns the poly representing the integer i117 /// returns the poly representing the integer i 117 118 poly p_ISet(int i, const ring r); 118 119 119 // returns the poly representing the number n, destroys n120 /// returns the poly representing the number n, destroys n 120 121 poly p_NSet(number n, const ring r); 121 122 
libpolys/polys/monomials/ring.cc
r772990 r260672 362 362 for (i = 1; i<r>N; i++) 363 363 { 364 365 366 367 368 364 for (j = i+1; j<=r>N; j++) 365 { 366 nl = n_IsOne(p_GetCoeff(MATELEM(r>GetNC()>C,i,j),r), r>cf); 367 if ( (MATELEM(r>GetNC()>D,i,j)!=NULL)  (!nl) ) 368 { 369 369 Print("\n// %s%s=",r>names[j1],r>names[i1]); 370 370 pl = MATELEM(r>GetNC()>MT[UPMATELEM(i,j,r>N)],1,1);
Note: See TracChangeset
for help on using the changeset viewer.