Changeset 5efbf9 in git for libpolys

Timestamp:

May 21, 2016, 1:18:14 AM (8 years ago)

Author:

Adi Popescu <adi_popescum@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

bdebb84b7e5e44a3f0d26a19f9d7ad9a6470e0d6

Parents:

d3963ac9165e16e5233bba73e3dfc49b9c87640e

git-author:

Adi Popescu <adi_popescum@yahoo.de>2016-05-21 01:18:14+02:00

git-committer:

Hans Schoenemann <hannes@mathematik.uni-kl.de>2016-05-23 16:43:26+02:00

Message:

add: posInL and T orderings for Ring case
added tests
Q: Is there a possibility to activate PreIntegerCheck from interpretor?

File:

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

libpolys/polys/monomials/p_polys.h

@@ -1524 +1524 @@
 }
 
+// This is the equivalent of pLmCmp(p,q) != -currRing->OrdSgn for rings
+// It is used in posInLRing and posInTRing
+static inline int p_LtCmpOrdSgnDiffM(poly p, poly q, const ring r)
+{
+  if(r->OrdSgn == 1)
+  {
+    return(p_LtCmp(p,q,r) != -1);
+  }
+  else
+  {
+    return((p_LmCmp(p,q,r) == -1) || ((p_LmCmp(p,q,r) == 0) && (p_LmCmp(p,q,r) == 1)));
+  }
+}
+
+// This is the equivalent of pLmCmp(p,q) != currRing->OrdSgn for rings
+// It is used in posInLRing and posInTRing
+static inline int p_LtCmpOrdSgnDiffP(poly p, poly q, const ring r)
+{
+  if(r->OrdSgn == 1)
+  {
+    return((p_LmCmp(p,q,r) == -1) || ((p_LmCmp(p,q,r) == 0) && (p_LmCmp(p,q,r) == 1)));
+  }
+  else
+  {
+    return(p_LtCmp(p,q,r) != -1);
+  }
+}
+
+// This is the equivalent of pLmCmp(p,q) == -currRing->OrdSgn for rings
+// It is used in posInLRing and posInTRing
+static inline int p_LtCmpOrdSgnEqM(poly p, poly q, const ring r)
+{
+  return(p_LtCmp(p,q,r) == -r->OrdSgn);
+}
+
+// This is the equivalent of pLmCmp(p,q) == currRing->OrdSgn for rings
+// It is used in posInLRing and posInTRing
+static inline int p_LtCmpOrdSgnEqP(poly p, poly q, const ring r)
+{
+  return(p_LtCmp(p,q,r) == r->OrdSgn);
+}
+
 /// returns TRUE if p1 is a skalar multiple of p2
 /// assume p1 != NULL and p2 != NULL