include/borderbasix/basisutil.cc

Go to the documentation of this file.

#ifndef ALREADY_basisutil
#define ALREADY_basisutil

template<typename Base,typename typdump, typename monomial_server> 
int countpoint(const Base &b,const typdump & dump, monomial_server &serv)
{
  typedef typename typdump::value_type::pol_t pol;
  typedef typename pol::monom_t mon;
  int maxdeg=-1;
  list<mon> current;
  list<mon> stockmon;
  cout<<"countmon "<<endl;
  current.push_back(mon(1));
  stockmon.push_back(mon(1));
#if 0
  {
    typename typdump::const_iterator iter;
      for(iter=dump.begin();
          iter!=dump.end();iter++);
    maxdeg=(--iter)->k;
  }
#endif
  //on a le degre max
  //le quotient est connexe a 1 donc on par t 
  //de 1 et on decrit le reste en multipliant par les variables
  for(int i=-2;i!=maxdeg;i=maxdeg,maxdeg=stockmon.size())
    {
      
      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)))
          {
            serv.mon2int(*iter);//pour etre sur que l'on a la place 
                           //pour tous les monomes du quotient
            stockmon.push_back(*iter);
          }
      else
        {
          current.erase(iter--);
        }
    }
  return stockmon.size();
}

template<typename Base,typename typdump,typename typMk> 
void MonomialBase(const Base &b,const typdump & dump,typMk & res)
{
  typedef typename typdump::value_type::pol_t pol;
  typedef typename pol::monom_t mon;
  int maxdeg=0;
  list<mon> current;
  //  list<mon> stockmon;
  current.push_back(mon(1));
  res.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 par t 
  //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(res,*iter)))
          {
            res.push_back(*iter);
          }
      else
        {
          current.erase(iter--);
        }
    }
  return;
}

#ifdef DENSE

template<typename Base,typename typdump> 
int countpoint(const Base &b,const typdump & dump)
{
  typedef typename typdump::value_type::pol_t pol;
  typedef typename pol::monom_t mon;
  int maxdeg=-1;
  list<mon> current;
  list<mon> stockmon;
  cout<<"countmon "<<endl;
  current.push_back(mon(1));
  stockmon.push_back(mon(1));
#if 0
  {
    typename typdump::const_iterator iter;
      for(iter=dump.begin();
          iter!=dump.end();iter++);
    maxdeg=(--iter)->k;
  }
#endif
  //on a le degre max
  //le quotient est connexe a 1 donc on par t 
  //de 1 et on decrit le reste en multipliant par les variables
  for(int i=-2;i!=maxdeg;i=maxdeg,maxdeg=stockmon.size())
    {
      
      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)))
          {
            mon2int(*iter);//pour etre sur que l'on a la place 
                           //pour tous les monomes du quotient
            stockmon.push_back(*iter);
          }
      else
        {
          current.erase(iter--);
        }
    }
  return stockmon.size();
}

#endif

#endif //ALREADY_basisutil

---