Functions
clapconv.h File Reference
#include "polys/monomials/ring.h"
#include "factory/factory.h"

Go to the source code of this file.

Functions

poly convFactoryPSingP (const CanonicalForm &f, 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)
 
poly convFactoryAPSingAP (const CanonicalForm &f, const ring r)
 
poly convFactoryAPSingAP_R (const CanonicalForm &f, int par_start, int var_start)
 
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)
 

Function Documentation

◆ convFactoryAPSingAP()

poly convFactoryAPSingAP ( const CanonicalForm f,
const ring  r 
)

Definition at line 151 of file clapconv.cc.

152 {
153  return convFactoryAPSingAP_R(f,0,rPar(r),r);
154 }
static int rPar(const ring r)
(r->cf->P)
Definition: ring.h:594
poly convFactoryAPSingAP_R(const CanonicalForm &f, int par_start, int var_start, const ring r)
Definition: clapconv.cc:141

◆ convFactoryAPSingAP_R()

poly convFactoryAPSingAP_R ( const CanonicalForm f,
int  par_start,
int  var_start 
)

◆ convFactoryASingA()

poly convFactoryASingA ( const CanonicalForm f,
const ring  r 
)

Definition at line 252 of file clapconv.cc.

253 {
254  poly a=NULL;
255  for( CFIterator i=f; i.hasTerms(); i++)
256  {
257  number n= convFactoryNSingAN( i.coeff(), r );
258  if (n_IsZero(n,r->cf->extRing->cf))
259  {
260  n_Delete(&n,r->cf->extRing->cf);
261  }
262  else
263  {
264  poly t= p_Init (r->cf->extRing);
265  pGetCoeff(t)=n;
266  p_SetExp(t,1,i.exp(),r->cf->extRing);
267  //p_Setm(t,r->cf->extRing);// not needed for rings with 1 variable
268  a=p_Add_q(a,t,r->cf->extRing);
269  }
270  }
271  if (a!=NULL)
272  {
273  if( r->cf->extRing != NULL )
274  if (r->cf->extRing->qideal->m[0]!=NULL)
275  {
276  poly l=r->cf->extRing->qideal->m[0];
277  if (p_GetExp(a,1,r->cf->extRing) >= p_GetExp(l,1,r->cf->extRing))
278  a = p_PolyDiv (a, l, FALSE, r->cf->extRing); // ???
279  }
280  }
281  return a;
282 }
#define FALSE
Definition: auxiliary.h:96
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
Definition: monomials.h:44
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent : the integer VarOffset encodes:
Definition: p_polys.h:468
int i
Definition: cfEzgcd.cc:125
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
Definition: coeffs.h:464
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...
Definition: p_polys.cc:1845
class to iterate through CanonicalForm's
Definition: cf_iter.h:44
static number convFactoryNSingAN(const CanonicalForm &f, const ring r)
Definition: clapconv.cc:243
static unsigned long p_SetExp(poly p, const unsigned long e, const unsigned long iBitmask, const int VarOffset)
set a single variable exponent : VarOffset encodes the position in p->exp
Definition: p_polys.h:487
#define NULL
Definition: omList.c:12
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
Definition: coeffs.h:455
static poly p_Add_q(poly p, poly q, const ring r)
Definition: p_polys.h:895
static poly p_Init(const ring r, omBin bin)
Definition: p_polys.h:1259
int l
Definition: cfEzgcd.cc:93

◆ convFactoryISingI()

int convFactoryISingI ( const CanonicalForm f)

Definition at line 110 of file clapconv.cc.

111 {
112  if (!f.isImm()) WerrorS("int overflow in det");
113  return f.intval();
114 }
long intval() const
conversion functions
bool isImm() const
void WerrorS(const char *s)
Definition: feFopen.cc:24

◆ convFactoryPSingP()

poly convFactoryPSingP ( const CanonicalForm f,
const ring  r 
)

Definition at line 40 of file clapconv.cc.

41 {
42  int n = rVar(r)+1;
43  /* ASSERT( level( f ) <= pVariables, "illegal number of variables" ); */
44  int * exp = (int*)omAlloc0(n*sizeof(int));
45  sBucket_pt result_bucket=sBucketCreate(r);
46  conv_RecPP( f, exp, result_bucket, r );
47  poly result; int dummy;
48  sBucketDestroyMerge(result_bucket,&result,&dummy);
49  omFreeSize((ADDRESS)exp,n*sizeof(int));
50  return result;
51 }
gmp_float exp(const gmp_float &a)
Definition: mpr_complex.cc:357
void sBucketDestroyMerge(sBucket_pt bucket, poly *p, int *length)
Definition: sbuckets.h:61
#define omFreeSize(addr, size)
Definition: omAllocDecl.h:260
static short rVar(const ring r)
#define rVar(r) (r->N)
Definition: ring.h:587
void * ADDRESS
Definition: auxiliary.h:135
static void conv_RecPP(const CanonicalForm &f, int *exp, sBucket_pt result, ring r)
Definition: clapconv.cc:53
sBucket_pt sBucketCreate(const ring r)
Definition: sbuckets.cc:96
#define omAlloc0(size)
Definition: omAllocDecl.h:211
return result
Definition: facAbsBiFact.cc:76

◆ convFactoryPSingTrP()

poly convFactoryPSingTrP ( const CanonicalForm f,
const ring  r 
)

Definition at line 334 of file clapconv.cc.

335 {
336  int n = rVar(r)+1;
337  int * exp = (int*)omAlloc0(n*sizeof(int));
338  poly result = NULL;
339  convRecTrP( f, exp, result , rPar(r), r );
340  omFreeSize((ADDRESS)exp,n*sizeof(int));
341  return result;
342 }
gmp_float exp(const gmp_float &a)
Definition: mpr_complex.cc:357
static int rPar(const ring r)
(r->cf->P)
Definition: ring.h:594
#define omFreeSize(addr, size)
Definition: omAllocDecl.h:260
static short rVar(const ring r)
#define rVar(r) (r->N)
Definition: ring.h:587
void * ADDRESS
Definition: auxiliary.h:135
static void convRecTrP(const CanonicalForm &f, int *exp, poly &result, int offs, const ring r)
Definition: clapconv.cc:345
#define NULL
Definition: omList.c:12
#define omAlloc0(size)
Definition: omAllocDecl.h:211
return result
Definition: facAbsBiFact.cc:76

◆ convSingAFactoryA()

CanonicalForm convSingAFactoryA ( poly  p,
const Variable a,
const ring  r 
)

Definition at line 200 of file clapconv.cc.

201 {
202  CanonicalForm result = 0;
203  int e;
204 
205  while ( p!=NULL )
206  {
208  if ( rField_is_Zp_a(r) )
209  {
210  term = n_Int( p_GetCoeff( p, r->cf->extRing ), r->cf->extRing->cf );
211  }
212  else
213  {
214  if ( SR_HDL(p_GetCoeff( p, r->cf->extRing )) & SR_INT )
215  term = SR_TO_INT(p_GetCoeff( p, r->cf->extRing )) ;
216  else
217  {
218  if ( p_GetCoeff( p, r->cf->extRing )->s == 3 )
219  {
220  mpz_t dummy;
221  mpz_init_set( dummy, (p_GetCoeff( p,r->cf->extRing )->z) );
222  term = make_cf( dummy );
223  }
224  else
225  {
226  // assume s==0 or s==1
227  mpz_t num, den;
228  On(SW_RATIONAL);
229  mpz_init_set( num, (p_GetCoeff( p, r->cf->extRing )->z) );
230  mpz_init_set( den, (p_GetCoeff( p, r->cf->extRing )->n) );
231  term = make_cf( num, den, ( p_GetCoeff( p, r->cf->extRing )->s != 1 ));
232  }
233  }
234  }
235  if ( (e = p_GetExp( p, 1, r->cf->extRing )) != 0 )
236  term *= power( a , e );
237  result += term;
238  p = pNext( p );
239  }
240  return result;
241 }
CanonicalForm power(const CanonicalForm &f, int n)
exponentiation
static BOOLEAN rField_is_Zp_a(const ring r)
Definition: ring.h:524
CanonicalForm num(const CanonicalForm &f)
Definition: int_poly.h:33
factory&#39;s main class
Definition: canonicalform.h:77
CanonicalForm make_cf(const mpz_ptr n)
Definition: singext.cc:66
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 ...
Definition: coeffs.h:547
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent : the integer VarOffset encodes:
Definition: p_polys.h:468
static const int SW_RATIONAL
set to 1 for computations over Q
Definition: cf_defs.h:29
void On(int sw)
switches
#define SR_TO_INT(SR)
Definition: longrat.h:68
#define NULL
Definition: omList.c:12
CanonicalForm den(const CanonicalForm &f)
#define SR_INT
Definition: longrat.h:66
#define pNext(p)
Definition: monomials.h:36
#define p_GetCoeff(p, r)
Definition: monomials.h:50
#define SR_HDL(A)
Definition: tgb.cc:35
int p
Definition: cfModGcd.cc:4019
return result
Definition: facAbsBiFact.cc:76

◆ convSingAPFactoryAP()

CanonicalForm convSingAPFactoryAP ( poly  p,
const Variable a,
const ring  r 
)

Definition at line 116 of file clapconv.cc.

117 {
118  CanonicalForm result = 0;
119  int e, n = r-> N;
120  int off=rPar(r);
121 
122  if (!rField_is_Zp_a(r))
123  On(SW_RATIONAL);
124  while ( p!=NULL)
125  {
126  CanonicalForm term=convSingAFactoryA(((poly)p_GetCoeff(p, r->cf->extRing)),a, r);
127  for ( int i = 1; i <= n; i++ )
128  {
129  if ( (e = p_GetExp( p, i, r )) != 0 )
130  term *= CanonicalForm( Variable( i + off), e );
131  }
132  result += term;
133  pIter( p );
134  }
135  return result;
136 }
static BOOLEAN rField_is_Zp_a(const ring r)
Definition: ring.h:524
Definition: int_poly.h:33
static int rPar(const ring r)
(r->cf->P)
Definition: ring.h:594
factory&#39;s class for variables
Definition: factory.h:117
factory&#39;s main class
Definition: canonicalform.h:77
CanonicalForm convSingAFactoryA(poly p, const Variable &a, const ring r)
Definition: clapconv.cc:200
#define pIter(p)
Definition: monomials.h:37
const CanonicalForm CFMap CFMap & N
Definition: cfEzgcd.cc:48
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent : the integer VarOffset encodes:
Definition: p_polys.h:468
static const int SW_RATIONAL
set to 1 for computations over Q
Definition: cf_defs.h:29
void On(int sw)
switches
int i
Definition: cfEzgcd.cc:125
#define NULL
Definition: omList.c:12
#define p_GetCoeff(p, r)
Definition: monomials.h:50
int p
Definition: cfModGcd.cc:4019
return result
Definition: facAbsBiFact.cc:76

◆ convSingPFactoryP()

CanonicalForm convSingPFactoryP ( poly  p,
const ring  r 
)

Definition at line 85 of file clapconv.cc.

86 {
88  int e, n = rVar(r);
89  BOOLEAN setChar=TRUE;
90 
91 // p=pReverse(p);
92  poly op=p;
93  while ( p!=NULL )
94  {
95  CanonicalForm term=r->cf->convSingNFactoryN(pGetCoeff( p ),setChar, r->cf);
96  if (errorreported) break;
97  setChar=FALSE;
98  for ( int i = 1; i <=n; i++ )
99  {
100  if ( (e = p_GetExp( p, i, r)) != 0 )
101  term *= CanonicalForm( Variable( i ), e );
102  }
103  result += term;
104  pIter( p );
105  }
106 // op=pReverse(op);
107  return result;
108 }
VAR short errorreported
Definition: feFopen.cc:23
Definition: int_poly.h:33
#define FALSE
Definition: auxiliary.h:96
factory&#39;s class for variables
Definition: factory.h:117
static short rVar(const ring r)
#define rVar(r) (r->N)
Definition: ring.h:587
factory&#39;s main class
Definition: canonicalform.h:77
#define TRUE
Definition: auxiliary.h:100
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
Definition: monomials.h:44
#define pIter(p)
Definition: monomials.h:37
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent : the integer VarOffset encodes:
Definition: p_polys.h:468
int i
Definition: cfEzgcd.cc:125
#define NULL
Definition: omList.c:12
int p
Definition: cfModGcd.cc:4019
int BOOLEAN
Definition: auxiliary.h:87
return result
Definition: facAbsBiFact.cc:76

◆ convSingTrP()

BOOLEAN convSingTrP ( poly  p,
const ring  r 
)

Definition at line 320 of file clapconv.cc.

321 {
322  while ( p!=NULL )
323  {
324  n_Normalize(p_GetCoeff(p, r), r->cf);
325 
326  // test if denominator is constant
327  if (!p_IsConstantPoly(DEN ((fraction)p_GetCoeff (p,r)),r->cf->extRing))
328  return FALSE;
329  pIter(p);
330  }
331  return TRUE;
332 }
#define FALSE
Definition: auxiliary.h:96
#define TRUE
Definition: auxiliary.h:100
static FORCE_INLINE void n_Normalize(number &n, const coeffs r)
inplace-normalization of n; produces some canonical representation of n;
Definition: coeffs.h:578
#define pIter(p)
Definition: monomials.h:37
#define NULL
Definition: omList.c:12
static BOOLEAN p_IsConstantPoly(const poly p, const ring r)
Definition: p_polys.h:1945
#define p_GetCoeff(p, r)
Definition: monomials.h:50
int p
Definition: cfModGcd.cc:4019

◆ convSingTrPFactoryP()

CanonicalForm convSingTrPFactoryP ( poly  p,
const ring  r 
)

Definition at line 284 of file clapconv.cc.

285 {
286  CanonicalForm result = 0;
287  int e, n = rVar(r);
288  int offs = rPar(r);
289 
290  while ( p!=NULL )
291  {
292  //n_Normalize(p_GetCoeff(p, r), r->cf);
293 
294  // test if denominator is constant
295  if (!errorreported && !p_IsConstantPoly(DEN ((fraction)p_GetCoeff (p,r)),r->cf->extRing))
296  WerrorS("conversion error: denominator!= 1");
297 
298  CanonicalForm term=convSingPFactoryP(NUM ((fraction)p_GetCoeff(p, r)),r->cf->extRing);
299 
300  // if denominator is not NULL it should be a constant at this point
301  if (DEN ((fraction)p_GetCoeff(p,r)) != NULL)
302  {
303  CanonicalForm den= convSingPFactoryP(DEN ((fraction)p_GetCoeff(p, r)),r->cf->extRing);
304  if (rChar (r) == 0)
305  On (SW_RATIONAL);
306  term /= den;
307  }
308 
309  for ( int i = n; i > 0; i-- )
310  {
311  if ( (e = p_GetExp( p, i,r )) != 0 )
312  term = term * power( Variable( i + offs ), e );
313  }
314  result += term;
315  p = pNext( p );
316  }
317  return result;
318 }
CanonicalForm power(const CanonicalForm &f, int n)
exponentiation
VAR short errorreported
Definition: feFopen.cc:23
Definition: int_poly.h:33
static int rPar(const ring r)
(r->cf->P)
Definition: ring.h:594
factory&#39;s class for variables
Definition: factory.h:117
int rChar(ring r)
Definition: ring.cc:713
static short rVar(const ring r)
#define rVar(r) (r->N)
Definition: ring.h:587
factory&#39;s main class
Definition: canonicalform.h:77
void WerrorS(const char *s)
Definition: feFopen.cc:24
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent : the integer VarOffset encodes:
Definition: p_polys.h:468
static const int SW_RATIONAL
set to 1 for computations over Q
Definition: cf_defs.h:29
void On(int sw)
switches
int i
Definition: cfEzgcd.cc:125
#define NULL
Definition: omList.c:12
CanonicalForm convSingPFactoryP(poly p, const ring r)
Definition: clapconv.cc:85
CanonicalForm den(const CanonicalForm &f)
static BOOLEAN p_IsConstantPoly(const poly p, const ring r)
Definition: p_polys.h:1945
#define pNext(p)
Definition: monomials.h:36
#define p_GetCoeff(p, r)
Definition: monomials.h:50
int p
Definition: cfModGcd.cc:4019
return result
Definition: facAbsBiFact.cc:76