proj3.hpp

Go to the documentation of this file.

#ifndef ALREADY_proj3
#define ALREADY_proj3
#include<algorithm>
template<typename typPk,typename typdump,typename Base, 
     typename monomial_server> 
void rewrite(typPk &Pk,const typdump &dump,const Base &b, 
         monomial_server &serv)
{
  typedef typename typPk::value_type polyalp;
  typedef typename polyalp::monom_t mon;
  typedef typename typdump::value_type dumpstruct;
  typedef typename dumpstruct::pol_t pol;
  typename typPk::iterator iter=Pk.begin();
  //cout<<"Pk.size dans rewrite "<<Pk.size()<<endl;
  for(;iter!=Pk.end();iter++)
    //pour chaque poly de Pk
    { 
      polyalp tmp(mon(0));
      for(typename polyalp::iterator itermon=iter->begin();
      itermon!=iter->end();itermon++)
      //pour chaque mon du polynome *iter
      {
      if (!IsinB(*itermon,b))
        {
          pol ttmp;
          ttmp.size=-1;
          ttmp.nf=NULL;
          //cout<<"findcorresppol "<<*itermon<<endl;
          findcorresppol(*itermon,dump,ttmp);
          //cout<<"invconv"<<endl;
          //fincorresppol ne touche pas son parametre de sortie qd 
          //le monome recherche n'existe pas
          //il existe ce monome?
          if(ttmp.size!=-1)
        {
          //  cout<<"trouve "<<endl;
          //tmp*=mon(ttmp.ind.GetCoeff());
          tmp+=invconv<polyalp>(ttmp,serv)*mon(itermon->GetCoeff()/ttmp.ind.GetCoeff());
        }
        }
    
            }
      //      cout<<"le pol que je vais enlever"<<endl;
      // cout<<tmp<<endl;
      //cout<<"fin du pol"<<endl;
      // cout<<"le poly avant reecriture "<<*iter<<endl;
      (*iter)-=tmp;
      //cout<<"poly apres reecriture!!\n"<<(*iter)<<endl;
    }
  return;
}
#ifdef uninf
//void reinit_multiple();
#endif
template<typename T,typename typdump,typename Base, typename monomial_server> 
void proj(T &Crochet,const typdump &dump, const Base &b, 
      monomial_server &serv)
{
  typedef typename typdump::value_type::pol_t pol;
  typedef typename T::value_type polyalp;
  typedef typename polyalp::monom_t mon;
  typedef typename mon::coeff_t coeff;
  typename T::iterator iter=Crochet.begin();
#ifdef unimul 
  serv.reinit_multiple();
#endif
#ifdef uninf
  serv.reinit_nf();
#endif
  //  int degiter=Degree(*iter);
  for(;iter!=Crochet.end();iter++)
    {
      //    cout<<"le pol que je vais reduire"<<endl;
      //cout<<*iter<<endl;

      list<mon> monared;
#ifdef LAMBDA 

      std::copy_if(iter->begin(), iter->end(), monared.begin(),
          [&b](mon &m) { return !IsinB(m,b);});
      
#else 
     for(typename polyalp::iterator iterpol=iter->begin();
     iterpol!=iter->end();iterpol++)
    {
      if (!IsinB(*iterpol,b))
        monared.push_back(*iterpol);
      //cout<<"mon dans proj "<<*iterpol<<" b? "<<IsinB(*iterpol,b)<<endl;
    }
#endif

      for(typename list<mon>::iterator itermon=monared.begin();itermon!=monared.end();itermon++)
    {
      //  cout<<"dans le for sur monared "<<b.nbvar()<<endl;
#ifdef projfast
      polyalp result(0);
      pol accumul;
      mon *exce;
      int sizeex;
      accumul.size=1;
      accumul.nf=(coeff*)MAC_REV_MALLOC<coeff>(sizeof(coeff));
      accumul.nf[0]=1;
      for(int i=0;i<b.nbvar();i++)
        for(int j=0;j<itermon->GetDegree(i);j++)
          {
        pol tmp;
        //if(result.size()!=0)
        result*=mon(i,1);
        tmp=mult(i,accumul,dump,b,&exce,sizeex);
        MAC_REV_FREE<coeff>(accumul.nf,accumul.size*sizeof(coeff));
        accumul=tmp;
        for(int k=0;k<sizeex-1;k++)
          result+=exce[k];
        MAC_REV_FREE<mon>(exce,sizeex*sizeof(mon));
          }
      for(int k=0;k<accumul.size;k++)
        if(!Iszero(accumul.nf[k]))
          {
        mon tmpmon;
        serv.int2mon(k,tmpmon);
        //  cout<<"tmpmon "<<tmpmon<<endl;
        result+=tmpmon*accumul.nf[k];
          }
      MAC_REV_FREE<coeff>(accumul.nf,accumul.size*sizeof(coeff));
#else
      polyalp result(1);
      for(int i=0;i<b.nbvar();i++)
        for(int j=0;j<itermon->GetDegree(i);j++)
          {
        result*=mon(i,1);
        //      int flag=0;
        //cout<<"nbtour dans la boucle "<<itermon->GetDegree(i)<<"J"<<j<<endl;
        for (typename polyalp::iterator iterres=result.begin();
             iterres!=result.end();iterres++)
         {
           if (!IsinB(*iterres,b)) 
             {
               T tmp;
               tmp.push_back(result);
               //cout<<"rewrite"<<endl;
               rewrite(tmp,dump,b,serv);
               //cout<<"sortie rewrite"<<endl;
               result=tmp.front();
               break;
             }
         }
          }
#endif
      coeff Coeff;
      for(typename polyalp::iterator iterpol=iter->begin();
          iterpol!=iter->end();iterpol++)
        if ((itermon->rep)==(iterpol->rep))
          {
        Coeff=iterpol->GetCoeff();
        break;
          }
      //  cout<<"iter avant reecriture "<<*iter<<" Coeff "<<Coeff<<endl;
      *iter+=result*mon(Coeff);
      // cout<<"result "<<endl<<result<<endl;
      *iter-=polyalp(mon((*itermon)*(coeff)(Coeff/itermon->GetCoeff())));
      //  cout<<"iter apres reecriture dans proj "<<*iter<<endl<<endl;
     }
    }
  //stab(Crochet);
  return;
    
    }
#endif //ALREADY_proj3