clapconv.cc File Reference

#include "misc/auxiliary.h"
#include "factory/factory.h"
#include "coeffs/coeffs.h"
#include "coeffs/longrat.h"
#include "polys/monomials/p_polys.h"
#include "polys/sbuckets.h"
#include "polys/clapconv.h"
#include "simpleideals.h"
#include "polys/ext_fields/transext.h"

Go to the source code of this file.

Macros
#define	TRANSEXT_PRIVATES
#define	MIN_CONV_LEN   7

Functions
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)

Macro Definition Documentation

MIN_CONV_LEN

#define MIN_CONV_LEN   7

Definition at line 103 of file clapconv.cc.

TRANSEXT_PRIVATES

#define TRANSEXT_PRIVATES

Definition at line 27 of file clapconv.cc.

Function Documentation

conv_RecPP()

void conv_RecPP ( const CanonicalForm & f, int * exp, sBucket_pt result, ring r )

static

Definition at line 54 of file clapconv.cc.

{
  // assume f!=0
  if (LIKELY(! f.inCoeffDomain()))
  {
    int l = f.level();
    for ( CFIterator i = f; i.hasTerms(); i++ )
    {
      exp[l] = i.exp();
      conv_RecPP( i.coeff(), exp, result, r );
    }
    exp[l] = 0;
  }
  else
  {
    coeffs cf=r->cf;
    number n=cf->convFactoryNSingN(f, cf);
    if (UNLIKELY( n_IsZero(n, cf) ))
    {
      n_Delete(&n,cf);
    }
    else
    {
      poly term = p_Init(r);
      //pNext( term ) = NULL; // done by p_Init
      pGetCoeff(term)=n;
      p_SetExpV(term,exp,r);
      sBucket_Merge_m(result,term);
    }
  }
}

convFactoryAPSingAP()

poly convFactoryAPSingAP	(	const CanonicalForm &	f,
		const ring	r )

Definition at line 207 of file clapconv.cc.

{
  return convFactoryAPSingAP_R(f,0,rPar(r),r);
}

convFactoryAPSingAP_R()

poly convFactoryAPSingAP_R	(	const CanonicalForm &	f,
		int	par_start,
		int	var_start,
		const ring	r )

Definition at line 196 of file clapconv.cc.

{
  if (f.isZero()) return NULL;
  int n = rVar(r)+rPar(r)+1;
  int * exp = (int *)omAlloc0(n*sizeof(int));
  poly result = NULL;
  convRecAP_R( f, exp, result,par_start, var_start, r );
  omFreeSize((ADDRESS)exp,n*sizeof(int));
  return result;
}

convFactoryASingA()

poly convFactoryASingA	(	const CanonicalForm &	f,
		const ring	r )

Definition at line 307 of file clapconv.cc.

{
  poly a=NULL;
  for( CFIterator i=f; i.hasTerms(); i++)
  {
    number n= convFactoryNSingAN( i.coeff(), r );
    if (n_IsZero(n,r->cf->extRing->cf))
    {
      n_Delete(&n,r->cf->extRing->cf);
    }
    else
    {
      poly t= p_Init (r->cf->extRing);
      pGetCoeff(t)=n;
      p_SetExp(t,1,i.exp(),r->cf->extRing);
      //p_Setm(t,r->cf->extRing);// not needed for rings with 1 variable
      a=p_Add_q(a,t,r->cf->extRing);
    }
  }
  if (a!=NULL)
  {
    if( r->cf->extRing != NULL )
      if (r->cf->extRing->qideal->m[0]!=NULL)
      {
        poly l=r->cf->extRing->qideal->m[0];
        if (p_GetExp(a,1,r->cf->extRing) >= p_GetExp(l,1,r->cf->extRing))
          a = p_PolyDiv (a, l, FALSE, r->cf->extRing); // ???
      }
  }
  return a;
}

convFactoryISingI()

int convFactoryISingI

(

const CanonicalForm &

f

)

Definition at line 165 of file clapconv.cc.

{
  if (!f.isImm()) WerrorS("int overflow in det");
  return f.intval();
}

convFactoryNSingAN()

number convFactoryNSingAN ( const CanonicalForm & f, const ring r )

static

Definition at line 298 of file clapconv.cc.

{
  assume (r != NULL);
  assume (r->cf != NULL);
  assume (r->cf->extRing != NULL);
  // r->cf->extRing->cf has to be Q or Z/p (the supported types of factory)
  return n_convFactoryNSingN( f, r->cf->extRing->cf );
}

convFactoryPSingP()

poly convFactoryPSingP	(	const CanonicalForm &	f,
		const ring	r )

Definition at line 40 of file clapconv.cc.

{
  if (f.isZero()) return NULL;
  int n = rVar(r)+1;
  /* ASSERT( level( f ) <= pVariables, "illegal number of variables" ); */
  int * exp = (int*)omAlloc0(n*sizeof(int));
  sBucket_pt result_bucket=sBucketCreate(r);
  conv_RecPP( f, exp, result_bucket, r );
  poly result; int dummy;
  sBucketDestroyMerge(result_bucket,&result,&dummy);
  omFreeSize((ADDRESS)exp,n*sizeof(int));
  return result;
}

convFactoryPSingTrP()

poly convFactoryPSingTrP	(	const CanonicalForm &	f,
		const ring	r )

Definition at line 389 of file clapconv.cc.

{
  if (f.isZero()) return NULL;
  int n = rVar(r)+1;
  int * exp = (int*)omAlloc0(n*sizeof(int));
  poly result = NULL;
  convRecTrP( f, exp, result , rPar(r), r );
  omFreeSize((ADDRESS)exp,n*sizeof(int));
  return result;
}

convPhalf()

void convPhalf ( poly p, int l, poly & p1, poly & p2 )

inlinestatic

Definition at line 86 of file clapconv.cc.

{
  p1=p;
  l=l/2;
  while(l>1) { p=pNext(p); l--; }
  p2=pNext(p);
  pNext(p)=NULL;
}

convPunhalf()

poly convPunhalf ( poly p1, poly p2 )

inlinestatic

Definition at line 95 of file clapconv.cc.

{
  poly p=p1;
  while(pNext(p1)!=NULL) { p1=pNext(p1);}
  pNext(p1)=p2;
  return p;
}

convRecAP_R()

void convRecAP_R ( const CanonicalForm & f, int * exp, poly & result, int par_start, int var_start, const ring r )

static

Definition at line 212 of file clapconv.cc.

{
  // assume f!=0
  if ( ! f.inCoeffDomain() )
  {
    int l = f.level();
    for ( CFIterator i = f; i.hasTerms(); i++ )
    {
      exp[l] = i.exp();
      convRecAP_R( i.coeff(), exp, result, par_start, var_start, r);
    }
    exp[l] = 0;
  }
  else
  {
    poly z=(poly)convFactoryASingA( f,r );
    if (z!=NULL)
    {
      poly term = p_Init(r);
      //pNext( term ) = NULL; // done by p_Init
      int i;
      for ( i = rVar(r); i>0 ; i-- )
        p_SetExp( term, i , exp[i+var_start],r);
      //if (rRing_has_Comp(currRing->extRing)) p_SetComp(term, 0, currRing->extRing); // done by pInit
      if (par_start==0)
      {
        for ( i = 1; i <= var_start; i++ )
        //z->e[i-1]+=exp[i];
          p_AddExp(z,i,exp[i],r->cf->extRing);
      }
      else
      {
        for ( i = par_start+1; i <= var_start+rPar(r); i++ )
        //z->e[i-1]+=exp[i];
          p_AddExp(z,i,exp[i-par_start],r->cf->extRing);
      }
      p_GetCoeff(term, r->cf->extRing)=(number) z;
      p_Setm( term,r );
      result = p_Add_q( result, term, r );
    }
  }
}

convRecTrP()

void convRecTrP ( const CanonicalForm & f, int * exp, poly & result, int offs, const ring r )

static

Definition at line 401 of file clapconv.cc.

{
  // assume f!= 0
  if ( f.level() > offs )
  {
    int l = f.level();
    for ( CFIterator i = f; i.hasTerms(); i++ )
    {
      exp[l-offs] = i.exp();
      convRecTrP( i.coeff(), exp, result, offs, r );
    }
    exp[l-offs] = 0;
  }
  else
  {
    poly term = p_Init(r);
    //pNext( term ) = NULL; // done by p_Init
    for ( int i = rVar(r); i>0; i-- )
      p_SetExp( term, i ,exp[i], r);
    //if (rRing_has_Comp(currRing)) p_SetComp(term, 0, currRing); // done by pInit
    pGetCoeff(term)=ntInit(convFactoryPSingP( f, r->cf->extRing ), r->cf);
    p_Setm( term,r );
    result = p_Add_q( result, term,r );
  }
}

convSingAFactoryA()

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

Definition at line 255 of file clapconv.cc.

{
  CanonicalForm result = 0;
  int e;
 
  while ( p!=NULL )
  {
    CanonicalForm term;
    if ( rField_is_Zp_a(r) )
    {
      term = n_Int( p_GetCoeff( p, r->cf->extRing ), r->cf->extRing->cf );
    }
    else
    {
      if ( SR_HDL(p_GetCoeff( p, r->cf->extRing )) & SR_INT )
        term = SR_TO_INT(p_GetCoeff( p, r->cf->extRing )) ;
      else
      {
        if ( p_GetCoeff( p, r->cf->extRing )->s == 3 )
        {
          mpz_t dummy;
          mpz_init_set( dummy, (p_GetCoeff( p,r->cf->extRing )->z) );
          term = make_cf( dummy );
        }
        else
        {
          // assume s==0 or s==1
          mpz_t num, den;
          On(SW_RATIONAL);
          mpz_init_set( num, (p_GetCoeff( p, r->cf->extRing )->z) );
          mpz_init_set( den, (p_GetCoeff( p, r->cf->extRing )->n) );
          term = make_cf( num, den, ( p_GetCoeff( p, r->cf->extRing )->s != 1 ));
        }
      }
    }
    if ( (e = p_GetExp( p, 1, r->cf->extRing )) != 0 )
      term *= power( a , e );
    result += term;
    p = pNext( p );
  }
  return result;
}

convSingAPFactoryAP()

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

Definition at line 171 of file clapconv.cc.

{
  CanonicalForm result = 0;
  int e, n = r-> N;
  int off=rPar(r);
 
  if (!rField_is_Zp_a(r))
    On(SW_RATIONAL);
  while ( p!=NULL)
  {
    CanonicalForm term=convSingAFactoryA(((poly)p_GetCoeff(p, r->cf->extRing)),a, r);
    for ( int i = 1; i <= n; i++ )
    {
      if ( (e = p_GetExp( p, i, r )) != 0 )
        term *= CanonicalForm( Variable( i + off), e );
    }
    result += term;
    pIter( p );
  }
  return result;
}

convSingPFactoryP()

CanonicalForm convSingPFactoryP	(	poly	p,
		const ring	r )

Definition at line 138 of file clapconv.cc.

{
  if (rVar(r)>1)
  {
    BOOLEAN setChar=TRUE;
    return convSingPFactoryP_intern(p,pLength(p),setChar,r);
  }
  else
  {
    CanonicalForm result = 0;
    BOOLEAN setChar=TRUE;
    coeffs cf=r->cf;
    int e;
    while ( p!=NULL )
    {
      CanonicalForm term=cf->convSingNFactoryN(pGetCoeff( p ),setChar, cf);
      if (errorreported) break;
      setChar=FALSE;
      if (LIKELY( (e = p_GetExp( p, 1, r)) != 0 ))
        term *= CanonicalForm( Variable( 1 ), e );
      result += term;
      pIter( p );
    }
    return result;
  }
}

convSingPFactoryP_intern()

CanonicalForm convSingPFactoryP_intern ( poly p, int l, BOOLEAN & setChar, const ring r )

static

Definition at line 104 of file clapconv.cc.

{
  CanonicalForm result = 0;
  int e, n = rVar(r);
  assume(l==(int)pLength(p));
 
  if (l>MIN_CONV_LEN)
  {
    poly p1,p2;
    convPhalf(p,l,p1,p2);
    CanonicalForm P=convSingPFactoryP_intern(p1,l/2,setChar,r);
    P+=convSingPFactoryP_intern(p2,l-l/2,setChar,r);
    convPunhalf(p1,p2);
    return P;
  }
  BOOLEAN setChar_loc=setChar;
  setChar=FALSE;
  coeffs cf=r->cf;
  while ( p!=NULL )
  {
    CanonicalForm term=cf->convSingNFactoryN(pGetCoeff( p ),setChar_loc, cf);
    if (errorreported) break;
    setChar_loc=FALSE;
    for ( int i = 1; i <=n; i++ )
    {
      if (LIKELY( (e = p_GetExp( p, i, r)) != 0 ))
        term *= CanonicalForm( Variable( i ), e );
    }
    result += term;
    pIter( p );
 }
 return result;
}

convSingTrP()

BOOLEAN convSingTrP	(	poly	p,
		const ring	r )

Definition at line 375 of file clapconv.cc.

{
  while ( p!=NULL )
  {
    n_Normalize(p_GetCoeff(p, r), r->cf);
 
    // test if denominator is constant
    if (!p_IsConstant(DEN ((fraction)p_GetCoeff (p,r)),r->cf->extRing))
      return FALSE;
    pIter(p);
  }
  return TRUE;
}

convSingTrPFactoryP()

CanonicalForm convSingTrPFactoryP	(	poly	p,
		const ring	r )

Definition at line 339 of file clapconv.cc.

{
  CanonicalForm result = 0;
  int e, n = rVar(r);
  int offs = rPar(r);
 
  while ( p!=NULL )
  {
    //n_Normalize(p_GetCoeff(p, r), r->cf);
 
    // test if denominator is constant
    if (!errorreported && !p_IsConstant(DEN ((fraction)p_GetCoeff (p,r)),r->cf->extRing))
      WerrorS("conversion error: denominator!= 1");
 
    CanonicalForm term=convSingPFactoryP(NUM ((fraction)p_GetCoeff(p, r)),r->cf->extRing);
 
    // if denominator is not NULL it should be a constant at this point
    if (DEN ((fraction)p_GetCoeff(p,r)) != NULL)
    {
      CanonicalForm den= convSingPFactoryP(DEN ((fraction)p_GetCoeff(p, r)),r->cf->extRing);
      if (rChar (r) == 0)
        On (SW_RATIONAL);
      term /= den;
    }
 
    for ( int i = n; i > 0; i-- )
    {
      if ( (e = p_GetExp( p, i,r )) != 0 )
        term = term * power( Variable( i + offs ), e );
    }
    result += term;
    p = pNext( p );
  }
  return result;
}

out_cf()

void out_cf	(	const char *	s1,
		const CanonicalForm &	f,
		const char *	s2 )

Definition at line 105 of file cf_factor.cc.

{
  printf("%s",s1);
  if (f.isZero()) printf("+0");
  //else if (! f.inCoeffDomain() )
  else if (! f.inBaseDomain() )
  {
    int l = f.level();
    for ( CFIterator i = f; i.hasTerms(); i++ )
    {
      int e=i.exp();
      if (i.coeff().isOne())
      {
        printf("+");
        if (e==0) printf("1");
        else
        {
          printf("%c",'a'+l-1);
          if (e!=1) printf("^%d",e);
        }
      }
      else
      {
        out_cf("+(",i.coeff(),")");
        if (e!=0)
        {
          printf("*%c",'a'+l-1);
          if (e!=1) printf("^%d",e);
        }
      }
    }
  }
  else
  {
    if ( f.isImm() )
    {
      if (CFFactory::gettype()==GaloisFieldDomain)
      {
         long a= imm2int (f.getval());
         if ( a == gf_q )
           printf ("+%ld", a);
         else  if ( a == 0L )
           printf ("+1");
         else  if ( a == 1L )
           printf ("+%c",gf_name);
         else
         {
           printf ("+%c",gf_name);
           printf ("^%ld",a);
         }
      }
      else
      {
        long l=f.intval();
        if (l<0) printf("%ld",l);
        else     printf("+%ld",l);
      }
    }
    else
    {
    #ifdef NOSTREAMIO
      if (f.inZ())
      {
        mpz_t m;
        gmp_numerator(f,m);
        char * str = new char[mpz_sizeinbase( m, 10 ) + 2];
        str = mpz_get_str( str, 10, m );
        puts(str);
        delete[] str;
        mpz_clear(m);
      }
      else if (f.inQ())
      {
        mpz_t m;
        gmp_numerator(f,m);
        char * str = new char[mpz_sizeinbase( m, 10 ) + 2];
        str = mpz_get_str( str, 10, m );
        while(str[strlen(str)]<' ') { str[strlen(str)]='\0'; }
        puts(str);putchar('/');
        delete[] str;
        mpz_clear(m);
        gmp_denominator(f,m);
        str = new char[mpz_sizeinbase( m, 10 ) + 2];
        str = mpz_get_str( str, 10, m );
        while(str[strlen(str)]<' ') { str[strlen(str)]='\0'; }
        puts(str);
        delete[] str;
        mpz_clear(m);
      }
    #else
       std::cout << f;
    #endif
    }
    //if (f.inZ()) printf("(Z)");
    //else if (f.inQ()) printf("(Q)");
    //else if (f.inFF()) printf("(FF)");
    //else if (f.inPP()) printf("(PP)");
    //else if (f.inGF()) printf("(PP)");
    //else
    if (f.inExtension()) printf("E(%d)",f.level());
  }
  printf("%s",s2);
}