Changeset aec5c9 in git for libpolys/coeffs/coeffs.h
- Timestamp:
- Apr 29, 2011, 2:51:47 PM (12 years ago)
- Branches:
- (u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')
- 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
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
libpolys/coeffs/coeffs.h
r760a78f raec5c9 165 165 ring algring; //< implementation of extensions needs polynomials... 166 166 /// for Q_a/Zp_a, rInit 167 number minpoly; //< make it a number! (needed for ring.cc) must be set by n???InitChar 167 ///number minpoly; //< no longer needed: replaced by 168 // algring->minideal->[0] 168 169 169 170 170 171 //------------------------------------------- 171 char* comp ex_parameter; //< the name of sqrt(-1), i.e. 'i' or 'j' etc...?172 char* complex_parameter; //< the name of sqrt(-1), i.e. 'i' or 'j' etc...? 172 173 173 174 #ifdef HAVE_RINGS 174 175 /* The following members are for representing the ring Z/n, 175 where n is not a prime. We distinguish threecases:176 where n is not a prime. We distinguish four cases: 176 177 1.) n has at least two distinct prime factors. Then 177 178 modBase stores n, modExponent stores 1, modNumber
Note: See TracChangeset
for help on using the changeset viewer.