Changeset 009d80 in git for kernel/rmodulon.h

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/rmodulon.h (modified) (3 diffs)

kernel/rmodulon.h

@@ -4 +4 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: rmodulon.h,v 1.1 2007-05-03 16:12:48 wienand Exp $ */
+/* $Id: rmodulon.h,v 1.2 2007-05-10 08:12:44 wienand Exp $ */
 /*
 * ABSTRACT: numbers modulo n
@@ -33 +33 @@
 number  nrnInvers      (number c);
 BOOLEAN nrnGreater     (number a, number b);
+BOOLEAN nrnDivBy       (number a, number b);
 BOOLEAN nrnEqual       (number a, number b);
 number   nrnLcm         (number a,number b, ring r);
@@ -41 +42 @@
 char *  nrnName        (number n);
 #ifdef LDEBUG
-// BOOLEAN nrnDBTest      (number a, char *f, int l);
+BOOLEAN nrnDBTest      (number a, char *f, int l);
 #endif
 void    nrnSetExp(int c, ring r);