Changeset dabe365 in git for kernel/shiftgb.cc

Timestamp:

Aug 7, 2008, 8:08:37 PM (15 years ago)

Author:

Viktor Levandovskyy <levandov@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')

Children:

5d97859f88aa52d68bbca5a456cd859d9492231a

Parents:

35ee9b7a58e79afeef7aebc85bd49c899533d499

Message:

*levandov: shiftbba prepared for release


git-svn-id: file:///usr/local/Singular/svn/trunk@10968 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• kernel/shiftgb.cc (modified) (3 diffs)

kernel/shiftgb.cc

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: shiftgb.cc,v 1.9 2008-07-26 14:28:03 motsak Exp $ */
+/* $Id: shiftgb.cc,v 1.10 2008-08-07 18:08:37 levandov Exp $ */
 /*
 * ABSTRACT: kernel: utils for shift GB and free GB
@@ -380 +380 @@
 {
   /* investigate only the leading monomial of p in currRing */
+  if ( pIsConstant(p) ) return(1);
   if (lV <= 0) return(0);
   /* returns 1 iff p is in V */
@@ -428 +429 @@
 }
 
+int poly_isInV(poly p, int lV)
+{
+  /* tests whether the whole polynomial p in in V */
+  poly q = p;
+  while (q!=NULL)
+  {
+    if ( !isInV(q,lV) )
+    {
+      return(0);
+    }
+    q = pNext(q);
+  }
+  return(1);
+}
+
+int ideal_isInV(ideal I, int lV)
+{
+  /* tests whether each polynomial of an ideal I lies in in V */
+  int i;
+  int s    = IDELEMS(I)-1;
+  for(i = 0; i <= s; i++)
+  {
+    if ( !poly_isInV(I->m[i],lV) )
+    {
+      return(0);
+    }
+  }
+  return(1);
+}
+
+
 int itoInsert(poly p, int uptodeg, int lV, const ring r)
 {