dump3.hpp

Go to the documentation of this file.

#ifndef ALREADY_dump3
#define  ALREADY_dump3
template<typename pol>
struct dumpstruct 
{
  typedef pol pol_t;
  typedef typename pol::monom_t mon;
  int k;
  int size;
  pol * nf;
#ifdef GOTZMANN
  std::list<mon> moninB;
#endif
};

template<typename typPk, typename typdump>
void Dump(const typPk & Pk ,typdump &dump)
{
  typedef typename typdump::value_type dumpstruct;
  int i=0;
  dumpstruct next;
  if(!Pk.empty())
    {
      next.k=Pk.front().ind.GetDegree();
      next.size=Pk.size();
      //      cout<<"le malloc dans dump"<<endl;
      next.nf=(typename dumpstruct::pol_t *)MAC_REV_MALLOC
    <typename dumpstruct::pol_t>(Pk.size()*
                 sizeof(typename dumpstruct::pol_t));
      // cout<<"fin du malloc"<<endl;
      for(typename typPk::const_iterator iter=Pk.begin()
        ;iter!=Pk.end();iter++,i++)
    {
      next.nf[i]=*iter;
      next.nf[i].ind.SetCoeff(1);
    }
      dump.push_back(next);
    }
  return;
}

template<typename Base,typename typdump,typename typrecall>
void forget(Base &b,typdump &dump,int k,typrecall & recall)

  //template<typename Base,typename typdump>
  //void forget(Base &b,typdump &dump,const int &k)
{
  typedef typename Base::mon mon;
  typedef typename mon::coeff_t coeff;
  typedef typename typdump::value_type::pol_t pol;
  typename typdump::iterator iterdump=dump.begin(),stockiter=dump.end();
  for(typename typrecall::iterator iter=recall.begin()
    ;iter!=recall.end();iter++)
    {
      MAC_REV_FREE<coeff>(iter->nf,iter->size*sizeof(coeff));
      MAC_REV_FREE<char>(iter->nfind,iter->sizenf);
    }
  recall.erase(recall.begin(),recall.end());
  //cout<<"destruction dans B"<<endl;
  for(typename Base::iterator iter=b.begin();iter!=b.end();iter++)
    {
      mon *tmp=(mon*)MAC_REV_MALLOC<mon>(iter->taille1*sizeof(mon));
      int tmptaille=0;
      for(int i=0;i<iter->taille1;i++)
    if(iter->accept[i].GetDegree()<=k)
      //27/08/2001(iter->refuse[i].GetDegree()<=k)
      {
        tmp[tmptaille++]=iter->accept[i];
      }
      //on suppose que le monomes se detruisent tout seuls
      //rajouter un destroy mon sinon
      if(tmptaille==0) 
    {
      MAC_REV_FREE<mon>(tmp,iter->taille1*sizeof(mon));
      MAC_REV_FREE<mon>(iter->accept,iter->taille1*sizeof(mon));
      MAC_REV_FREE<mon>(iter->refuse,iter->taille2*sizeof(mon));
      b.erase(iter--);
      continue;
      //tmp[tmptaille++]=mon(1);
    }
      MAC_REV_FREE<mon>(iter->accept,iter->taille1*sizeof(mon));
      iter->accept=(mon*)MAC_REV_REALLOC<mon>((void*)tmp
                    ,iter->taille1*sizeof(mon)
                     ,tmptaille*sizeof(mon));
      iter->taille1=tmptaille;
      //pour les refuses
      tmp=(mon*)MAC_REV_MALLOC<mon>(iter->taille2*sizeof(mon));
      tmptaille=0;
      for(int i=0;i<iter->taille2;i++)
    //#ifdef BONRAJOUT
    if (1)
      //#else
      if((iter->refuse[i].GetDegree()<=k))
        //#endif
        //27/08/2001(iter->refuse[i].GetDegree()<=k)
      {
        tmp[tmptaille++]=iter->refuse[i];
      }
      //on suppose que les monomes se detruisent tout seuls
      //rajouter un destroy mon sinon
      MAC_REV_FREE<mon>(iter->refuse,iter->taille2*sizeof(mon));
      //iter->taille2=tmptaille;
      //if(tmptaille==0) 
      //{
      /*free(iter->refuse);*/
      //  iter->refuse=NULL;
      //}
      //else
    {
      iter->refuse=(mon*)MAC_REV_REALLOC<mon>((void*)tmp
                          ,iter->taille2*sizeof(mon)
                         ,tmptaille*sizeof(mon));
    }
      iter->taille2=tmptaille;
    }
  //on vire des differentes composantes B les monomes de degre>k
  //ca ralentit l'algo mais c coherent sinon on cherche des nf 
  //que l'on ne connait pas
  //ya un opti a faire ici

  for(iterdump=dump.begin();iterdump!=stockiter/*dump.end()*/ && iterdump->k<k;iterdump++);
  // cout<<"je detruit tout a partir du degre "<<k<<endl;
  if(iterdump!=stockiter)
    stockiter=iterdump++;//on suppose qu'on a fait
  if(stockiter!=dump.end())
    free(stockiter->nf);
  //un recover avant du meme degre sinon il y a fuite de memoire
  
  if(k==0) {cout<<"pas de sol"<<endl;exit(0);}
  //cout<<"iter!=dump.end()"<<(iter!=dump.end())<<endl;
#if 0
  if(0&&iterdump!=dump.end())
    {
      for(int i=0;i<iterdump->size;i++)
    recall.push_back(iterdump->nf[i]);
        iterdump++;
    }
#endif
  for(;iterdump!=dump.end();iterdump++)
    {
      //destruction de pol de cette couche
      //for(int i=0;i<iterdump->size;i++)
      //    recall.push_back(iterdump->nf[i]);
    //recall.push_back(invconv<typename typP::value_type>(iterdump->nf[i]));
    {
      
      // cout<<"le pointeur "<<(double*)iterdump->nf[i].nf<<endl;
      //Tue Dec 4
      //for(int ii=0;ii<(iterdump->size);ii++)
      //  MAC_REV_FREE<mon>(iterdump->nf[ii].nf
      //            ,iterdump->nf[ii].size*sizeof(mon));
      //Tue Dec 4
      for(int ii=0;ii<(iterdump->size);ii++)
            {
          MAC_REV_FREE<coeff>(iterdump->nf[ii].nf
                ,iterdump->nf[ii].size*sizeof(coeff));
          MAC_REV_FREE<char>(iterdump->nf[ii].nfind
                ,iterdump->nf[ii].sizenf);
        }
      MAC_REV_FREE<pol>(iterdump->nf,iterdump->size*sizeof(pol));
    }
    //free(iterdump->nf);
    }
  //cout<<"au tour de B "<<endl;
  dump.erase(stockiter,dump.end());

}

template<typename typPk, typename typMk, typename typdump>
void recover(typPk &Pk,typMk &Mk, const typdump & dump, int k)
{
  typedef typename typPk::value_type pol;
  typename typdump::const_iterator iter;
  typedef typename pol::coeff_t coeff;
  //if (k!=Pk.front().GetDegree())
    {
      //les mecs dans Pk ont ete dumpes normalment donc ne pas les detruire
      //sinon on est embette par forget qui va chercher a le faire aussi
      Pk.erase(Pk.begin(),Pk.end());
      Mk.erase(Mk.begin(),Mk.end());
      for(iter=dump.begin();(iter!=dump.end())&&(iter->k<k);iter++);
      //    if (iter!=dump.end()) cout<<"iter->k "<<iter->k<<endl;
      if ((iter!=dump.end())&&(iter->k==k))
    for(int i=0;i<iter->size;i++)
      {
        //Tue Dec  4 16:12:10 MET 2001
        //      pol tmppol;
        //densify(iter->nf[i],tmppol);
        //Pk.push_back(tmppol);
        //Tue Dec  4 16:12:10 MET 2001
        Pk.push_back(iter->nf[i]);
        Mk.push_back(Pk.rbegin()->ind);
      }
    }
  return;
}

#endif // ALREADY_dump3