matmul3sdp.hpp

Go to the documentation of this file.

#ifndef ALREADY_matmul3
#define ALREADY_matmul3

template<typename typMk>
int indice(const typename typMk::value_type & m, const typMk &stockmon)
{
  int res=0;
  for(typename typMk::const_iterator iter=stockmon.begin();
      (iter->rep!=m.rep)&&(iter!=stockmon.end());iter++,res++);
  return res;
}

//on suppose stockmon vide
template<typename Base, typename typstock, typename typdump>
void computestockmon(typstock &stockmon, const Base &b,  const typdump &dump)
{
  //typedef typename typdump::value_type::pol_t pol;
  //typedef typename pol::monom_t mon; 
  typedef typename typstock::value_type mon;
  int maxdeg=0;
  //int taillequo=0,tmp=0;
  //  mon *who=NULL;
  list<mon> current;
  current.push_back(mon(1));
  stockmon.push_back(mon(1));
  {
    typename typdump::const_iterator iter;
      for(iter=dump.begin();
      iter!=dump.end();iter++);
    maxdeg=(--iter)->k;
  }
  //on a le degre max
  //le quotient est connexe a 1 donc on part 
  //de 1 et on decrit le reste en multipliant par les variables
  for(int i=0;i<maxdeg;i++)
    {
      list<mon> tmpcurrent=current;
      //my_merge(stockmon,current);
      current.erase(current.begin(),current.end());
      for(int i=0;i<b.nbvar();i++)
    {
      for(typename list<mon>::iterator iter=tmpcurrent.begin();
          iter!=tmpcurrent.end();iter++)
        current.push_back((*iter)*mon(i,1));
    }
      //maintenant on tri;
      for(typename list<mon>::iterator iter=current.begin();iter!=current.end();iter++)
    if((IsinB(*iter,b))&&(!member(stockmon,*iter)))
      {
        stockmon.push_back(*iter);
      }
      else
    {
      current.erase(iter--);
    }
    }
  return;
} 


//on suppose dqans un premier temps que le pol qui est donne
//en parametre est en fait une variable 
template<typename typmat,typename typdump,typename Base, typename typstock,
     typename monomial_server>
void matmul(typmat & m,const int p,const typdump &dump,const Base &b
        , const typstock &stockmon, monomial_server & serv)
{
  typedef typename typdump::value_type::pol_t pol;
  typedef typename pol::monom_t mon; 
  typedef typename pol::coeff_t coeff;
  typstock current;
  typedef typename typstock::value_type monstock;
  //dans stockmon on a maintenant les monomes du quotient; 
  //on le multiplis par la variable p
  current=stockmon;
  for(typename typstock::iterator iter=current.begin();iter!=current.end()
    ;iter++)
    {
      *iter*=monstock(p,1);
    }
  //maintenant on ecrit la matrice
  {
    int j=0;
    m=typmat(current.size(),current.size());
    for(typename typstock::iterator iter=current.begin()
      ;iter!=current.end();iter++,j++)
      {
    if(!IsinB(*iter,b))
    {
      pol tmp;
      int count=0;
      tmp.sizenf=-1;
      findcorresppol(*iter,dump,tmp);
      typename typstock::value_type tmpmon;
      //      cout<<invconv<Poly>(tmp)<<endl;
      for(int i=0;i<tmp.sizenf;i++)
        {
          if(tmp.nfind[i])
        for(int jj=0;jj<8;jj++)
          if((tmp.nfind[i]>>jj)&1)
            {
              serv.int2mon(8*i+jj,tmpmon);
              m(indice(tmpmon,stockmon),j,tmp.nf[count++]*(coeff)(-1));
            }
        }
    }
    else
      {
        //cout<<"indice "<<indice(*iter,current)<<endl;
        m(indice(*iter,stockmon),j,(coeff)(1));
      }
      }
  }
  return;
}
#endif //ALREADY_matmul3