Go to the source code of this file.
|
void | out_cf (const char *s1, const CanonicalForm &f, const char *s2) |
|
static void | conv_RecPP (const CanonicalForm &f, int *exp, sBucket_pt result, ring r) |
|
static void | convRecTrP (const CanonicalForm &f, int *exp, poly &result, int offs, const ring r) |
|
static number | convFactoryNSingAN (const CanonicalForm &f, const ring r) |
|
poly | convFactoryPSingP (const CanonicalForm &f, const ring r) |
|
static void | convPhalf (poly p, int l, poly &p1, poly &p2) |
|
static poly | convPunhalf (poly p1, poly p2) |
|
static CanonicalForm | convSingPFactoryP_intern (poly p, int l, BOOLEAN &setChar, const ring r) |
|
CanonicalForm | convSingPFactoryP (poly p, const ring r) |
|
int | convFactoryISingI (const CanonicalForm &f) |
|
CanonicalForm | convSingAPFactoryAP (poly p, const Variable &a, const ring r) |
|
static void | convRecAP_R (const CanonicalForm &f, int *exp, poly &result, int par_start, int var_start, const ring r) |
|
poly | convFactoryAPSingAP_R (const CanonicalForm &f, int par_start, int var_start, const ring r) |
|
poly | convFactoryAPSingAP (const CanonicalForm &f, const ring r) |
|
CanonicalForm | convSingAFactoryA (poly p, const Variable &a, const ring r) |
|
poly | convFactoryASingA (const CanonicalForm &f, const ring r) |
|
CanonicalForm | convSingTrPFactoryP (poly p, const ring r) |
|
BOOLEAN | convSingTrP (poly p, const ring r) |
|
poly | convFactoryPSingTrP (const CanonicalForm &f, const ring r) |
|
◆ MIN_CONV_LEN
◆ TRANSEXT_PRIVATES
◆ conv_RecPP()
Definition at line 54 of file clapconv.cc.
55{
56
57 if ( !
f.inCoeffDomain() )
58 {
61 {
64 }
66 }
67 else
68 {
69 number n=r->cf->convFactoryNSingN(
f, r->cf);
71 {
73 }
74 else
75 {
77
81 }
82 }
83}
static void conv_RecPP(const CanonicalForm &f, int *exp, sBucket_pt result, ring r)
class to iterate through CanonicalForm's
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
gmp_float exp(const gmp_float &a)
static void p_SetExpV(poly p, int *ev, const ring r)
static poly p_Init(const ring r, omBin bin)
void sBucket_Merge_m(sBucket_pt bucket, poly p)
◆ convFactoryAPSingAP()
Definition at line 184 of file clapconv.cc.
185{
187}
poly convFactoryAPSingAP_R(const CanonicalForm &f, int par_start, int var_start, const ring r)
static int rPar(const ring r)
(r->cf->P)
◆ convFactoryAPSingAP_R()
Definition at line 173 of file clapconv.cc.
174{
175 if (
f.isZero())
return NULL;
182}
static void convRecAP_R(const CanonicalForm &f, int *exp, poly &result, int par_start, int var_start, const ring r)
#define omFreeSize(addr, size)
static short rVar(const ring r)
#define rVar(r) (r->N)
◆ convFactoryASingA()
Definition at line 284 of file clapconv.cc.
285{
288 {
291 {
293 }
294 else
295 {
296 poly t=
p_Init (r->cf->extRing);
299
301 }
302 }
304 {
305 if( r->cf->extRing !=
NULL )
306 if (r->cf->extRing->qideal->m[0]!=
NULL)
307 {
308 poly
l=r->cf->extRing->qideal->m[0];
311 }
312 }
313 return a;
314}
static number convFactoryNSingAN(const CanonicalForm &f, const ring r)
poly p_PolyDiv(poly &p, const poly divisor, const BOOLEAN needResult, const ring r)
assumes that p and divisor are univariate polynomials in r, mentioning the same variable; assumes div...
static poly p_Add_q(poly p, poly q, const ring r)
static unsigned long p_SetExp(poly p, const unsigned long e, const unsigned long iBitmask, const int VarOffset)
set a single variable exponent @Note: VarOffset encodes the position in p->exp
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
◆ convFactoryISingI()
Definition at line 142 of file clapconv.cc.
143{
144 if (!
f.isImm())
WerrorS(
"int overflow in det");
146}
void WerrorS(const char *s)
◆ convFactoryNSingAN()
Definition at line 275 of file clapconv.cc.
276{
280
282}
static FORCE_INLINE number n_convFactoryNSingN(const CanonicalForm n, const coeffs r)
◆ convFactoryPSingP()
Definition at line 40 of file clapconv.cc.
41{
42 if (
f.isZero())
return NULL;
44
52}
sBucket_pt sBucketCreate(const ring r)
void sBucketDestroyMerge(sBucket_pt bucket, poly *p, int *length)
◆ convFactoryPSingTrP()
Definition at line 366 of file clapconv.cc.
367{
368 if (
f.isZero())
return NULL;
375}
static void convRecTrP(const CanonicalForm &f, int *exp, poly &result, int offs, const ring r)
◆ convPhalf()
◆ convPunhalf()
static poly convPunhalf |
( |
poly |
p1, |
|
|
poly |
p2 |
|
) |
| |
|
inlinestatic |
◆ convRecAP_R()
Definition at line 189 of file clapconv.cc.
190{
191
192 if ( !
f.inCoeffDomain() )
193 {
196 {
199 }
201 }
202 else
203 {
206 {
208
212
214 {
216
218 }
219 else
220 {
222
224 }
228 }
229 }
230}
poly convFactoryASingA(const CanonicalForm &f, const ring r)
static long p_AddExp(poly p, int v, long ee, ring r)
static void p_Setm(poly p, const ring r)
◆ convRecTrP()
Definition at line 378 of file clapconv.cc.
379{
380
381 if (
f.level() >
offs )
382 {
385 {
388 }
390 }
391 else
392 {
394
395 for (
int i =
rVar(r);
i>0;
i-- )
397
401 }
402}
poly convFactoryPSingP(const CanonicalForm &f, const ring r)
number ntInit(long i, const coeffs cf)
◆ convSingAFactoryA()
Definition at line 232 of file clapconv.cc.
233{
235 int e;
236
238 {
241 {
243 }
244 else
245 {
248 else
249 {
251 {
255 }
256 else
257 {
258
264 }
265 }
266 }
267 if ( (e =
p_GetExp(
p, 1, r->cf->extRing )) != 0 )
271 }
273}
static const int SW_RATIONAL
set to 1 for computations over Q
static FORCE_INLINE long n_Int(number &n, const coeffs r)
conversion of n to an int; 0 if not possible in Z/pZ: the representing int lying in (-p/2 ....
CanonicalForm FACTORY_PUBLIC make_cf(const mpz_ptr n)
static BOOLEAN rField_is_Zp_a(const ring r)
◆ convSingAPFactoryAP()
Definition at line 148 of file clapconv.cc.
149{
153
157 {
159 for (
int i = 1;
i <= n;
i++ )
160 {
163 }
166 }
168}
const CanonicalForm CFMap CFMap & N
CanonicalForm convSingAFactoryA(poly p, const Variable &a, const ring r)
factory's class for variables
◆ convSingPFactoryP()
Definition at line 136 of file clapconv.cc.
137{
140}
static CanonicalForm convSingPFactoryP_intern(poly p, int l, BOOLEAN &setChar, const ring r)
static int pLength(poly a)
◆ convSingPFactoryP_intern()
Definition at line 103 of file clapconv.cc.
104{
108
110 {
111 poly p1,p2;
116 return P;
117 }
121 {
125 for (
int i = 1;
i <=n;
i++ )
126 {
129 }
132 }
134}
static void convPhalf(poly p, int l, poly &p1, poly &p2)
static poly convPunhalf(poly p1, poly p2)
◆ convSingTrP()
Definition at line 352 of file clapconv.cc.
353{
355 {
357
358
362 }
364}
static FORCE_INLINE void n_Normalize(number &n, const coeffs r)
inplace-normalization of n; produces some canonical representation of n;
static BOOLEAN p_IsConstant(const poly p, const ring r)
◆ convSingTrPFactoryP()
Definition at line 316 of file clapconv.cc.
317{
321
323 {
324
325
326
328 WerrorS(
"conversion error: denominator!= 1");
329
331
332
334 {
339 }
340
341 for (
int i = n;
i > 0;
i-- )
342 {
345 }
348 }
350}
CanonicalForm convSingPFactoryP(poly p, const ring r)
◆ out_cf()
Definition at line 103 of file cf_factor.cc.
104{
107
108 else if (!
f.inBaseDomain() )
109 {
112 {
114 if (
i.coeff().isOne())
115 {
118 else
119 {
121 if (e!=1)
printf(
"^%d",e);
122 }
123 }
124 else
125 {
127 if (e!=0)
128 {
130 if (e!=1)
printf(
"^%d",e);
131 }
132 }
133 }
134 }
135 else
136 {
138 {
140 {
144 else if ( a == 0L )
146 else if ( a == 1L )
148 else
149 {
152 }
153 }
154 else
155 {
159 }
160 }
161 else
162 {
163 #ifdef NOSTREAMIO
165 {
173 }
175 {
191 }
192 #else
194 #endif
195 }
196
197
198
199
200
201
202 if (
f.inExtension())
printf(
"E(%d)",
f.level());
203 }
205}
#define GaloisFieldDomain
void out_cf(const char *s1, const CanonicalForm &f, const char *s2)
cf_algorithm.cc - simple mathematical algorithms.
void FACTORY_PUBLIC gmp_numerator(const CanonicalForm &f, mpz_ptr result)
void FACTORY_PUBLIC gmp_denominator(const CanonicalForm &f, mpz_ptr result)
static long imm2int(const InternalCF *const imm)