Changeset 260672 in git for libpolys

Timestamp:

Feb 22, 2012, 9:52:58 PM (12 years ago)

Author:

Oleksandr Motsak <motsak@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

dd156fc3fe4ce7e785c8c6aa066f73f3c887f9bb

Parents:

7729907f549543f553ed6efd161b1abbfd835b3c

git-author:

Oleksandr Motsak <motsak@mathematik.uni-kl.de>2012-02-22 21:52:58+01:00

git-committer:

Oleksandr Motsak <motsak@mathematik.uni-kl.de>2012-02-23 20:35:09+01:00

Message:

minor cleanup

chg: better indentation
chg: converted comments into doxygen documentation for some declaration

Location:

libpolys/polys/monomials

Files:

• p_polys.h (modified) (2 diffs)
• ring.cc (modified) (1 diff)

libpolys/polys/monomials/p_polys.h

@@ -81 +81 @@
 unsigned long p_GetShortExpVector(poly a, const ring r);
 
-/* divisibility check over ground ring (which may contain zero divisors);
+#ifdef HAVE_RINGS
+/*! divisibility check over ground ring (which may contain zero divisors);
    TRUE iff LT(f) divides LT(g), i.e., LT(f)*c*m = LT(g), for some
    coefficient c and some monomial m;
-   does not take components into account */
-#ifdef HAVE_RINGS
+   does not take components into account
+ */
 BOOLEAN p_DivisibleByRingCase(poly f, poly g, const ring r);
 #endif
@@ -101 +102 @@
 long p_DegW(poly p, const short *w, const ring R);
 
-// return TRUE if all monoms have the same component
+/// return TRUE if all monoms have the same component
 BOOLEAN   p_OneComp(poly p, const ring r);
 
-// return i, if head depends only on var(i)
+/// return i, if head depends only on var(i)
 int       p_IsPurePower(const poly p, const ring r);
 
-// return i, if poly depends only on var(i)
+/// return i, if poly depends only on var(i)
 int       p_IsUnivariate(poly p, const ring r);
 
-// set entry e[i] to 1 if var(i) occurs in p, ignore var(j) if e[j]>0
-// return #(e[i]>0)
+/// set entry e[i] to 1 if var(i) occurs in p, ignore var(j) if e[j]>0
+/// return #(e[i]>0)
 int      p_GetVariables(poly p, int * e, const ring r);
 
-// returns the poly representing the integer i
+/// returns the poly representing the integer i
 poly      p_ISet(int i, const ring r);
 
-// returns the poly representing the number n, destroys n
+/// returns the poly representing the number n, destroys n
 poly      p_NSet(number n, const ring r);
 

libpolys/polys/monomials/ring.cc

@@ -362 +362 @@
       for (i = 1; i<r->N; i++)
       {
-        for (j = i+1; j<=r->N; j++)
-        {
-          nl = n_IsOne(p_GetCoeff(MATELEM(r->GetNC()->C,i,j),r), r->cf);
-          if ( (MATELEM(r->GetNC()->D,i,j)!=NULL) || (!nl) )
-          {
+        for (j = i+1; j<=r->N; j++)
+        {
+          nl = n_IsOne(p_GetCoeff(MATELEM(r->GetNC()->C,i,j),r), r->cf);
+          if ( (MATELEM(r->GetNC()->D,i,j)!=NULL) || (!nl) )
+          {
             Print("\n//    %s%s=",r->names[j-1],r->names[i-1]);
             pl = MATELEM(r->GetNC()->MT[UPMATELEM(i,j,r->N)],1,1);