Changeset f92fa13 in git for Singular/polys-impl.h

Timestamp:

Mar 16, 1998, 3:56:48 PM (26 years ago)

Author:

Olaf Bachmann <obachman@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

5c8eae0ee4adf297d4ee70c4eb367499625899d8

Parents:

057fd3b14dfe97c1070a5e6e9ea465fb317ae57f

Message:

1998-03-16  Olaf Bachmann  <obachman@mathematik.uni-kl.de>

	* polys-impl.h: #define COMP_FAST

	* configure.in,Makefile.in: check for flex -P; increased version
	number to 1.1.7

1998-03-04  Olaf Bachmann  <obachman@mathematik.uni-kl.de>

	* febase.h: added macro assume()

	* spSpolyLoop.cc: Automatic generation of SpolyLoops using
	spSpolyLoop.pl

	* kstd*.cc: New calling interface to get SpolyLoop

	* ring.h: Introduced rOrderType_t


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

File:

• Singular/polys-impl.h (modified) (4 diffs)

Singular/polys-impl.h

@@ -4 +4 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: polys-impl.h,v 1.17 1998-01-28 22:11:22 Singular Exp $ */
+/* $Id: polys-impl.h,v 1.18 1998-03-16 14:56:38 obachman Exp $ */
 
 /***************************************************************
@@ -74 +74 @@
     monomial operations, i.e. does everything exponent-wise.
  ***************************************************************/
-// #define COMP_FAST
+#define COMP_FAST
 // #define COMP_DEBUG
 // #define COMP_NO_EXP_VECTOR_OPS
@@ -400 +400 @@
 #else
 #define _pNew()         (poly) mmAllocSpecialized()
-#endif
 // #define _pNew() _pInit()
+#endif
 
 #include <string.h>
@@ -624 +624 @@
 DECLARE(BOOLEAN, __pDivisibleBy(poly a, poly b))
 {
-  const unsigned long* s1;
-  const unsigned long* s2;
-  const unsigned long* lb;
-
 #ifdef WORDS_BIGENDIAN
-  lb = (unsigned long*) &(a->exp[0]);
-  if (pVariables & ((SIZEOF_LONG / SIZEOF_EXPONENT) - 1))
-  {
-    // now pVariables == pVariables1W, i.e. there are exponents in the
-    // "first" word of exponentvector
-    s1 = ((unsigned long*) a) + pMonomSizeW -1;
-    s2 = ((unsigned long*) b) + pMonomSizeW -1;
-  }
-  else
-  {
-    // first exponent word has only component as significant field --
-    // Hence, do not bother
-    s1 = ((unsigned long*) a) + pMonomSizeW -2;
-    s2 = ((unsigned long*) b) + pMonomSizeW -2;
-  }
-#else // !WORDS_BIGENDIAN
-  lb = ((unsigned long*) a) + pMonomSizeW;
-  if (pVariables & ((SIZEOF_LONG / SIZEOF_EXPONENT) - 1))
-  {
-    s1 = (unsigned long*) &(a->exp[0]);
-    s2 = (unsigned long*) &(b->exp[0]);
-  }
-  else
-  {
-    s1 = (unsigned long*) &(a->exp[0]) + 1;
-    s2 = (unsigned long*) &(b->exp[0]) + 1;
-  }
-#endif
+  const unsigned long* const lb = (unsigned long*) &(a->exp[0]);;
+  const unsigned long* s1 = ((unsigned long*) a) + pMonomSizeW -1;
+  const unsigned long* s2 = ((unsigned long*) b) + pMonomSizeW -1;
+#else
+  const unsigned long* const lb = ((unsigned long*) a) + pMonomSizeW;
+  const unsigned long* s1 = (unsigned long*) &(a->exp[0]);
+  const unsigned long* s2 = (unsigned long*) &(b->exp[0]);
+#endif
+  
   for (;;)
   {
-// O.K. -- and now comes a bit of magic. The following _really_
-// works. Think about it! If you can prove it, please tell me, for I
-// did not bother to prove it formally (Hint: We can assume that our
-// exponents are always positive).
+    // Yes, the following is correct, provided that the exponents do
+    // not have their first bit set
     if ((*s2 - *s1) & P_DIV_MASK) return FALSE;
 #ifdef WORDS_BIGENDIAN