Changeset c462b55 in git for libpolys/polys/monomials

Timestamp:

Mar 22, 2011, 11:04:13 AM (13 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', '2a584933abf2a2d3082034c7586d38bb6de1a30a')

Children:

494884581702ad06eefdf632a5e1abb42bd90f4d

Parents:

ba0fc3d4dcb089fc5523e7af222a8f52d7cb44b8

git-author:

Hans Schoenemann <hannes@mathematik.uni-kl.de>2011-03-22 11:04:13+01:00

git-committer:

Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 12:04:09+01:00

Message:

 p_MinComp, p_MaxComp

File:

• libpolys/polys/monomials/p_polys.h (modified) (1 diff)

libpolys/polys/monomials/p_polys.h

@@ -332 +332 @@
 static inline   void p_SetCompP(poly a, int i, ring r);
 static inline   void p_SetCompP(poly a, int i, ring lmRing, ring tailRing);
-static inline   long p_MaxComp(poly p, ring lmRing, ring tailRing);
-inline long p_MaxComp(poly p,ring lmRing) {return p_MaxComp(p,lmRing,lmRing);}
-static inline   long p_MinComp(poly p, ring lmRing, ring tailRing);
-inline long p_MinComp(poly p,ring lmRing) {return p_MinComp(p,lmRing,lmRing);}
+
+// returns maximal column number in the modul element a (or 0)
+static inline long p_MaxComp(poly p, ring lmRing, ring tailRing)
+{
+  long result,i;
+
+  if(p==NULL) return 0;
+  result = p_GetComp(p, lmRing);
+  if (result != 0)
+  {
+    loop
+    {
+      pIter(p);
+      if(p==NULL) break;
+      i = p_GetComp(p, tailRing);
+      if (i>result) result = i;
+    }
+  }
+  return result;
+}
+
+static inline long p_MaxComp(poly p,ring lmRing) {return p_MaxComp(p,lmRing,lmRing);}
+
+static inline   long p_MinComp(poly p, ring lmRing, ring tailRing)
+{
+  long result,i;
+
+  if(p==NULL) return 0;
+  result = p_GetComp(p,lmRing);
+  if (result != 0)
+  {
+    loop
+    {
+      pIter(p);
+      if(p==NULL) break;
+      i = p_GetComp(p,tailRing);
+      if (i<result) result = i;
+    }
+  }
+  return result;
+}
+
+static inline long p_MinComp(poly p,ring lmRing) {return p_MinComp(p,lmRing,lmRing);}
 
 /***************************************************************