gotzman.hpp

Go to the documentation of this file.

#include<iterator>
#include<set>
#include<list>
template<typename Base, typename typstock, typename typdump>
void enumeratemon_in_B(typstock &stockmon, int k, 
          const Base &b,  const typdump &dump)
{
  typedef typename typstock::value_type mon;
  //int maxdeg=0;
  std::set<mon> current;
  current.insert(mon(1));
  //
  //
  //on a le degre max : k
  // on part de 1 et on decrit le reste en multipliant par les variables
  //
  //
  std::set<mon> tmpcurrent=current;
  for(int i=0;i<k;i++)
    {
      //      cout<<"tour de boulce "<<i<<endl;
      
 
      current.erase(current.begin(),current.end());
      for(int i=0;i<b.nbvar();i++)
    {
      for(typename std::set<mon>::iterator iter=tmpcurrent.begin();
          iter!=tmpcurrent.end();iter++)
        {
          mon tmpmon=(*iter)*mon(i,1);
          tmpmon.SetCoeff(1);
          current.insert(tmpmon);
          //  cout<<"est insere "<<tmpmon<<endl;
        }
    }
      //maintenant on tri;
      tmpcurrent.erase(tmpcurrent.begin(),tmpcurrent.end());
      for(typename std::set<mon>::iterator iter=current.begin();
      iter!=current.end();iter++)
    {
      //  cout<<"j'examine "<<*iter<<" IsinB "<<IsinB(*iter,b)<<endl;
      if(IsinB(*iter,b))
      {
        tmpcurrent.insert(*iter);
      }
    }
    }
  for(typename std::set<mon>::iterator iter=tmpcurrent.begin();
      iter!=tmpcurrent.end();iter++)
    {
      //  cout<<"je rajoute "<<*iter<<endl;
      stockmon.push_back(*iter);
    }
}

template<typename Base, typename typdump, typename typserv>
void initial_mon(const Base &b,typdump & dump,typserv &serv)
{
  typedef typename typserv::monom_t mon;
  std::list<mon> stockmon;
  enumeratemon_in_B(stockmon,dump.front().k,b,dump);
  dump.back().moninB.erase(dump.back().moninB.begin(),
               dump.back().moninB.end());
  for(typename std::list<mon>::iterator iter=stockmon.begin()
    ;iter!=stockmon.end();iter++)
    dump.back().moninB.push_back(*iter);
  //  copy(stockmon.begin(),stockmon.end(),dump.back().moninB.begin());
  //cout<<"stockmon.k "<<stockmon.size()<<endl;
  //cout<<"dump.back().k "<<dump.back().k<<" "<<dump.back().moninB.size()<<endl;
}


template<typename Base,  typename typdump,typename typserv >
void nextmon(const Base &b, typdump &dump, typserv &serv)
{
  typedef typename typdump::value_type::mon mon;
  typename typdump::reverse_iterator ante=dump.rbegin();
  std::list<mon> stockmon;
  ante++;
  if(ante==dump.rend())
    {
      //on est en train de remplir 
      // le dump struct de plus bas degree donc pas moyende s'appuyer 
      //sur un truc avant
      initial_mon(b,dump,serv);
    }
  else
    {
      //cout<<"ante "<<ante->moninB.size()<<" "<<ante->k<<endl;
      // copy(ante->moninB.begin(),ante->moninB.end(),
      //       ostream_iterator<mon>(cout," "));
      std::set<mon> current;
      
      for(int i=0;i<b.nbvar();i++)
    {

      for(typename std::list<mon>::iterator iter=ante->moninB.begin();
          iter!=ante->moninB.end();iter++)
        {
          mon tmpmon=(*iter)*mon(i,1);
          tmpmon.SetCoeff(1);
          current.insert(tmpmon);
          //          cout<<"est insere "<<tmpmon<<" "<<*iter<<endl;
        }
    }
      dump.back().moninB.erase(dump.back().moninB.begin(),
                   dump.back().moninB.end());
     
      //maintenant on tri;
      for(typename std::set<mon>::iterator iter=current.begin();
      iter!=current.end();iter++)
    {
      //      cout<<"j'examine "<<*iter<<" IsinB "<<IsinB(*iter,b)<<endl;
      if(IsinB(*iter,b))
      {
        //current.erase(iter);
        dump.back().moninB.push_back(*iter);
      }
    }
      //      copy(stockmon.begin(),stockmon.end(),dump.back().moninB.begin());
    }
}
template<typename Base, typename typdump, typename typserv>
void initial_mon(int k,const Base &b,typdump & dump,typserv &serv)
{
  typedef typename typserv::monom_t mon;
  std::list<mon> stockmon;
  enumeratemon_in_B(stockmon,k,b,dump);
  dump.back().moninB.erase(dump.back().moninB.begin(),
      dump.back().moninB.end());
  for(typename std::list<mon>::iterator iter=stockmon.begin()
      ;iter!=stockmon.end();iter++)
    dump.back().moninB.push_back(*iter);
  //  copy(stockmon.begin(),stockmon.end(),dump.back().moninB.begin());
  //cout<<"stockmon.k "<<stockmon.size()<<endl;
  //cout<<"dump.back().k "<<dump.back().k<<" "<<dump.back().moninB.size()<<endl;
}

template<typename Base,  typename typdump,typename typserv >
void nextmon(int k,const Base &b, typdump &dump, typserv &serv)
{
  typedef typename typdump::value_type::mon mon;
  typename typdump::reverse_iterator ante=dump.rbegin();
  std::list<mon> stockmon;
  ante++;
  if(ante==dump.rend())
  {
    //on est en train de remplir 
    // le dump struct de plus bas degree donc pas moyende s'appuyer 
    //sur un truc avant
    initial_mon(k,b,dump,serv);
  }
  else
  {
    //cout<<"ante "<<ante->moninB.size()<<" "<<ante->k<<endl;
    // copy(ante->moninB.begin(),ante->moninB.end(),
    //           ostream_iterator<mon>(cout," "));
    std::set<mon> current;

    for(int i=0;i<b.nbvar();i++)
    {

      for(typename std::list<mon>::iterator iter=ante->moninB.begin();
      iter!=ante->moninB.end();iter++)
      {
    mon tmpmon=(*iter)*mon(i,1);
    tmpmon.SetCoeff(1);
    current.insert(tmpmon);
    //              cout<<"est insere "<<tmpmon<<" "<<*iter<<endl;
      }
    }
    dump.back().moninB.erase(dump.back().moninB.begin(),
    dump.back().moninB.end());

    //maintenant on tri;
    for(typename std::set<mon>::iterator iter=current.begin();
    iter!=current.end();iter++)
    {
      //      cout<<"j'examine "<<*iter<<" IsinB "<<IsinB(*iter,b)<<endl;
      if(IsinB(*iter,b))
      {
    //current.erase(iter);
    dump.back().moninB.push_back(*iter);
      }
    }
    //      copy(stockmon.begin(),stockmon.end(),dump.back().moninB.begin());
  }
}

template<typename Base, typename typdump, typename typserv>
int critere_got(const Base &b,typdump &dump,typserv &serv)
{
  static int last=-1;//C'est une dimension ca peut jamais valoir -1
  //C 'est dc une bonne initialisation
  //copy(dump.back().moninB.begin(),dump.back().moninB.end(),ostream_iterator<mon>(cout," prout \n"));
  //cout<<"GOTZMANNN : j'attends "<<last<<" et j'ai : "<<dump.back().moninB.size()<<endl;
  if((int)dump.back().moninB.size()==last)
    return 1;
  else
    {
      std::vector<int> macdec;
      //     cout<<"Debut Macdev"<<endl;
      Macaulay_dec(macdec,dump.back().k,dump.back().moninB.size());



      //Macaulay_dec(macdec,b.nbvars-1,dump.back().moninB.size());
      //cout<<"Mac dec de "<<dump.back().moninB.size()<<" et k "<<dump.back().k<<endl;
      //  copy(macdec.begin(),macdec.end(),std::ostream_iterator<int>(cout," "));
      last=nextdim(macdec,dump.back().k);
      //      last=nextdim(macdec,b.nbvars-1);
      //cout<<endl<<"nouvelle dim attendue "<<last<<endl;
    }
  return 0;
}