Changeset f003a9 in git for Singular/polys.cc

Timestamp:

Mar 23, 1998, 11:51:10 PM (26 years ago)

Author:

Olaf Bachmann <obachman@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

427ba93431587575a0ada806631e26f2aa275abc

Parents:

469bce4cdf3d9ed6f4f24673a0ac2fca1836d944

Message:

	* polys-impl.cc, polys.cc: No COMP_FAST any more

	* Makefile.in: Introduced variable PERL, set by configure

	* kstdfac.cc (kStratCopy): kModW iv is not copied, but just the
	pointer is set
1998-03-18  Olaf Bachmann  <obachman@mathematik.uni-kl.de>

	* Makefile.in: added Singularb target for bprof

	* polys-impl.h, polys-comp.h: Cleaned up COMP_FAST and related
	#defines

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

	* polys-impl.h: no #define COMP_FAST

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


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

File:

• Singular/polys.cc (modified) (3 diffs)

Singular/polys.cc

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: polys.cc,v 1.18 1998-03-19 16:05:50 obachman Exp $ */
+/* $Id: polys.cc,v 1.19 1998-03-23 22:51:04 obachman Exp $ */
 
 /*
@@ -43 +43 @@
 int pVarLowIndex;   // lowest exponent index 
 int pVarHighIndex;  // highest exponent index 
+int pVarCompIndex;  // Location of component in exponent vector
 
 /* 1 for polynomial ring, -1 otherwise */
@@ -236 +237 @@
 
   if (d) Mreturn(d, pOrdSgn);
-  _pMonComp_otEXPCOMP_nwTWO(p1, p2, d, goto NotEqual, return 0);
-
+//   _pMonComp_otEXPCOMP_nwTWO(p1, p2, d, goto NotEqual, return 0);
+
+do                                                              
+{                                                               
+  const long* s1 = (long*) &(p1->exp[0]);                       
+  const long* s2 = (long*) &(p2->exp[0]);                       
+  d = *s1 - *s2;                                                
+  if (d) goto NotEqual;
+  d = *(s1 + 1) - *(s2 + 1);                                    
+  if (d)                                                        
+  {                                                             
+    if (((long) (pGetComp(p1) - pGetComp(p2))) == d)            
+      d = -d;                                                   
+    goto NotEqual;                                                    
+  }                                                             
+  return 0;                                                      
+}                                                               
+ while(0);
+ 
   NotEqual:
   Mreturn(d, pLexSgn);