isdivisible.hpp

Go to the documentation of this file.

#ifndef ALREADY_isdivisible
#define ALREADY_isdivisible
//retourne 1 si m1|m2 0 sinon
template<typename mon>
int isdivisible(const mon &m1, const mon &m2, int nbvar)
{
  int res=1;
  for(int i=0;i<nbvar;i++)
    {
      //cout<<"    isdivisble  "<<m2.GetDegree(i)<<" "<<m1.GetDegree(i)<<endl;
      if(m2.GetDegree(i)<m1.GetDegree(i))
    { res=0;break;};
    }
  return res;  
}

template<typename mon, typename mon2, typename Base>
int isdivisible(const mon & m1,const mon2 & m2,const Base & b)
{
  const int nbvar=b.nbvar();
  int res=1;
  for(int i=0;i<nbvar;i++)
    {
      //cout<<"    isdivisble  "<<m2.GetDegree(i)<<" "<<m1.GetDegree(i)<<endl;
      if(m2.GetDegree(i)<m1.GetDegree(i))
      { res=0;break;};
    }
  return res;
}

template<typename mon, typename mon2, typename Base>
int isdivisible2(const mon & m1,const mon2 & m2,const Base & b,mon &coc)
{
  const int nbvar=b.nbvar();
  int res=1;
  //mon coc=mon(1);
  cout<<"m1"<<m1 <<"m2"<<m2<<endl;
  for(int i=0;i<nbvar;i++)
    {
      cout<<"    isdivisble  "<<(int)m2.GetDegree(i)<<" "<<(int)m1.GetDegree(i)<<endl;
      if(m2.GetDegree(i)<m1.GetDegree(i))
      { res=0;break;};
    }
  cout<<"res"<<res<<endl;
  if (res)
  {
      for(int i=0;i<nbvar;i++)
        {

          coc*=mon(i,m2.GetDegree(i)-m1.GetDegree(i));
          cout<<"coc"<<coc<<endl;
        }
  }
  return res;
}

template<template<typename T,typename toto> class mon,typename typcoeff,
     char X,int d,typename T,typename Base>
int isdivisible(const mon<typcoeff,numexp<X,d,T> > & m1
        ,const mon<typcoeff,numexp<X,d,T> > & m2,const Base & b)
{
  static int initmask=0;
  const int nbvar=b.nbvar();
  int res=1;
  T mask;
  
  if(initmask==0)
    {
      for(int i=0;i<d;i++) initmask=(initmask<<1)+1;
    }
  mask=initmask;
  for(int i=0;i<nbvar;i++)
    {

      if((m2.rep.ind&(mask))<(m1.rep.ind&(mask)))
    { res=0;break;};
      mask=mask<<d;
    }
  return res;
}
#endif //ALREADY_isdivisible