Changeset 009d80 in git for kernel/numbers.cc

Timestamp:

May 10, 2007, 10:12:44 AM (17 years ago)

Author:

Oliver Wienand <wienand@…>

Branches:

(u'spielwiese', '2a584933abf2a2d3082034c7586d38bb6de1a30a')

Children:

4cd2f891f36b9e1d58f0aeaa4683254f54088298

Parents:

4bebba7353438f052b4ad581ede34fa6f31e5a71

Message:

new compile switch: HAVE_RINGS
at total there are now: HAVE_RINGS, HAVE_RING2TOM, HAVE_RINGMODN

kspoly.cc, kstd1.cc, kstd2.cc, kutil.cc, kspoly.cc, polys.cc, ring.*:
adaption of new switches and rField_is_Ring method

numbers.*:
introduced new operation:
  nDivBy(a, b) = Is a divisible by b?

pDebig.cc, pInline1.h:
use of new nDivBy method

p_Mult_q:
new routine for rings

p_*, pp_*:
template switch HAVE_ZERODIVISOR

polys1.cc:
poly exponentation, switches

rmodulo*:
nDivBy implementation, DBTest

structs.h:
nDivBy, ringtype, ringflaga, ringflagb


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

File:

• kernel/numbers.cc (modified) (7 diffs)

kernel/numbers.cc

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR      *
 *****************************************/
-/* $Id: numbers.cc,v 1.7 2007-05-07 16:23:04 Singular Exp $ */
+/* $Id: numbers.cc,v 1.8 2007-05-10 08:12:42 wienand Exp $ */
 
 /*
@@ -46 +46 @@
 number (*nRePart)(number a);
 number (*nImPart)(number a);
+#ifdef HAVE_RINGS
+BOOLEAN (*nDivBy)(number a,number b);
+#endif
 BOOLEAN (*nGreater)(number a,number b);
 BOOLEAN (*nEqual)(number a,number b);
@@ -99 +102 @@
 number ndCopy(number a) { return a; }
 number nd_Copy(number a,const ring r) { return r->cf->nCopy(a); }
+
+#ifdef HAVE_RINGS
+BOOLEAN ndDivBy(number a, number b) { return TRUE; }
+#endif
 
 /*2
@@ -173 +180 @@
   nInvers= r->cf->nInvers;
   nCopy  = r->cf->nCopy;
+#ifdef HAVE_RINGS
+  nDivBy = r->cf->nDivBy;
+#endif
   nGreater = r->cf->nGreater;
   nEqual = r->cf->nEqual;
@@ -251 +261 @@
   n->nGcd  = ndGcd;
   n->nLcm  = ndGcd; /* tricky, isn't it ?*/
+#ifdef HAVE_RINGS
+  n->nDivBy = ndDivBy;
+#endif
   if (rField_is_Extension(r))
   {
@@ -306 +319 @@
      n->nNeg   = nr2mNeg;
      n->nInvers= nr2mInvers;
+     n->nDivBy = nr2mDivBy;
      n->nGreater = nr2mGreater;
      n->nEqual = nr2mEqual;
@@ -342 +356 @@
      n->nNeg   = nrnNeg;
      n->nInvers= nrnInvers;
+     n->nDivBy = nrnDivBy;
      n->nGreater = nrnGreater;
      n->nEqual = nrnEqual;