Changeset aec5c9 in git for libpolys/coeffs/coeffs.h

Timestamp:

Apr 29, 2011, 2:51:47 PM (13 years ago)

Author:

Frank Seelisch <seelisch@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

bfa04ee2a025a85b141d50d577c0438ec69e4233

Parents:

760a78f4333abdcf36c17059f611fa15a34c2dac

git-author:

Frank Seelisch <seelisch@mathematik.uni-kl.de>2011-04-29 14:51:47+02:00

git-committer:

Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 12:31:31+01:00

Message:

minpoly replaced by minideal->m[0]; prep for longalg/longtrans

File:

• libpolys/coeffs/coeffs.h (modified) (1 diff)

libpolys/coeffs/coeffs.h

@@ -165 +165 @@
   ring          algring; //< implementation of extensions needs polynomials...
   /// for Q_a/Zp_a, rInit
-  number     minpoly;  //< make it a number! (needed for ring.cc) must be set by n???InitChar
+  ///number     minpoly;  //< no longer needed: replaced by
+                          //  algring->minideal->[0]
 
 
 //-------------------------------------------
-  char* compex_parameter; //< the name of sqrt(-1), i.e. 'i' or 'j' etc...?
+  char* complex_parameter; //< the name of sqrt(-1), i.e. 'i' or 'j' etc...?
 
 #ifdef HAVE_RINGS
   /* The following members are for representing the ring Z/n,
-     where n is not a prime. We distinguish three cases:
+     where n is not a prime. We distinguish four cases:
      1.) n has at least two distinct prime factors. Then
          modBase stores n, modExponent stores 1, modNumber