Changeset 63d199 in git
 Timestamp:
 Jul 6, 2015, 1:30:39 PM (8 years ago)
 Branches:
 (u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')
 Children:
 3d2cb9e83ceb74b520ab757ffac6abe4eed415f9
 Parents:
 ddc1937b20b15407322fe606d93ad53240f5b367
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

libpolys/polys/monomials/p_polys.cc
rddc193 r63d199 4531 4531 { 4532 4532 assume(p != NULL); 4533 if (p == NULL) return 0;4534 4533 unsigned long ev = 0; // short exponent vector 4535 4534 unsigned int n = BIT_SIZEOF_LONG / r>N; // number of bits per exp 4536 4535 unsigned int m1; // highest bit which is filled with (n+1) 4537 unsigned int i = 0,j=1;4536 int i=0,j=1; 4538 4537 4539 4538 if (n == 0) … … 4546 4545 else 4547 4546 { 4548 for (; j<= (unsigned long)r>N; j++)4547 for (; j<=r>N; j++) 4549 4548 { 4550 4549 if (p_GetExp(p,j,r) > 0) i++; … … 4552 4551 } 4553 4552 if (i>0) 4554 ev = ~( (unsigned long)0) >> ((unsigned long) (BIT_SIZEOF_LONG  i));4553 ev = ~(0UL) >> (BIT_SIZEOF_LONG  i); 4555 4554 return ev; 4556 4555 } … … 4580 4579 4581 4580 4581 /// p_GetShortExpVector of p * pp 4582 4582 unsigned long p_GetShortExpVector(const poly p, const poly pp, const ring r) 4583 4583 { 4584 4584 assume(p != NULL); 4585 4585 assume(pp != NULL); 4586 if (p == NULL  pp == NULL) return 0;4587 4586 4588 4587 unsigned long ev = 0; // short exponent vector 4589 4588 unsigned int n = BIT_SIZEOF_LONG / r>N; // number of bits per exp 4590 4589 unsigned int m1; // highest bit which is filled with (n+1) 4591 unsigned int i = 0, j=1; 4590 int j=1; 4591 unsigned long i = 0L; 4592 4592 4593 4593 if (n == 0) … … 4600 4600 else 4601 4601 { 4602 for (; j<= (unsigned long)r>N; j++)4602 for (; j<=r>N; j++) 4603 4603 { 4604 4604 if (p_GetExp(p,j,r) > 0  p_GetExp(pp,j,r) > 0) i++; … … 4606 4606 } 4607 4607 if (i>0) 4608 ev = ~( (unsigned long)0) >> ((unsigned long) (BIT_SIZEOF_LONG  i));4608 ev = ~(0UL) >> (BIT_SIZEOF_LONG  i); 4609 4609 return ev; 4610 4610 }
Note: See TracChangeset
for help on using the changeset viewer.