include/borderbasix/placemon.cc File Reference

Go to the source code of this file.

Functions

• template<typename ptrfun > void setorder (ptrfun tmpord)
• int sizeplacemon ()
• template<typename mon > void putmon2 (const mon &m, const int poscurrent)
• template<typename mon > void putmon (const mon &m)
• template<typename mon > void removemon (const mon &m)
• template<typename mon > void affplace (const mon &m, int p)
• template<typename mon > void freeplace (int p)
• template<typename mon > void int2mon (const int &i, mon &res)
• template<typename mon > int mon2int (const mon &mm)
• template<typename typPk , typename typdump > void swap_all (int i, int j, typPk &Pk, typdump &dump)
• void freeint2mon (int k)
• void freemon (int j)
• void serveurcompress (int i)
• template<typename typPk , typename typdump > void Docompress (int i, typPk &Pk, typdump &dump)
• template<typename typdump , typename Base , typename typPk > void compress (typPk &Pk, typdump &dump, const Base &b, int k)
• template<typename typPk , typename typdump > void swap_all (int i, int j, typPk &Pk, typPk &redspol, typdump &dump)
• template<typename typPk , typename typdump > void Docompress (int i, typPk &Pk, typPk &redspol, typdump &dump)
• template<typename typdump , typename Base , typename typPk > void compress (typPk &Pk, typPk &redspol, typdump &dump, const Base &b, int k)
• void freeplacemon ()

---

Function Documentation

void affplace	(	const mon &	m,
		int	p
	)			[inline]

Definition at line 278 of file placemon.cc.

{
  int2mon_[p]=m;
}

void compress	(	typPk &	Pk,
		typPk &	redspol,
		typdump &	dump,
		const Base &	b,
		int	k
	)			[inline]

Definition at line 662 of file placemon.cc.

References Docompress(), int2mon(), serveurcompress(), sizeplacemon(), and swap_all().

{
  //return;
  typedef typename typPk::value_type pol;
  typedef typename pol::monom_t mon;
  mon tmpmon;
  int i=0;int j=sizeplacemon()-1;
  //cout<<"Docompress"<<endl;
  for(i=0;i<j;i++)
    {
      int2mon(i,tmpmon);
      if(!IsinB(tmpmon,b))
        //On peut le virer
        {
          for(;j>i;j--)
            {
              int2mon(j,tmpmon);
              if(IsinB(tmpmon,b))
                break;
            }
          if(i==j) break; //c fini on a plus rien a faire ici
          //      cout<<" swap "<<i<<" "<<int2mon_[i]<<" et "<<j<<" "<<int2mon_[j]<<endl;
          swap_all(i,j,Pk,redspol,dump);
        }

    }
  int2mon(i,tmpmon);
  for(;!IsinB(tmpmon,b);i--) 
    {
      int2mon(i,tmpmon);
      //cout<<"tmp mon "<<tmpmon<<endl;
    }
  Docompress(i+1,Pk,redspol,dump);
  serveurcompress(i);
}

void compress	(	typPk &	Pk,
		typdump &	dump,
		const Base &	b,
		int	k
	)			[inline]

Definition at line 497 of file placemon.cc.

References Docompress(), int2mon(), serveurcompress(), sizeplacemon(), and swap_all().

Referenced by algo(), NewCrochetchoix(), and newPkMkMatrixof().

{
  //return;
  typedef typename typPk::value_type pol;
  typedef typename pol::monom_t mon;
  mon tmpmon;
  int i=0;int j=sizeplacemon()-1;
  //cout<<"Docompress"<<endl;
  for(i=0;i<j;i++)
    {
      int2mon(i,tmpmon);
      if(!IsinB(tmpmon,b))
        //On peut le virer
        {
          for(;j>i;j--)
            {
              int2mon(j,tmpmon);
              if(IsinB(tmpmon,b))
                break;
            }
          if(i==j) break; //c fini on a plus rien a faire ici
          //      cout<<" swap "<<i<<" "<<int2mon_[i]<<" et "<<j<<" "<<int2mon_[j]<<endl;
          swap_all(i,j,Pk,dump);
        }

    }
  int2mon(i,tmpmon);
  for(;!IsinB(tmpmon,b);i--) 
    {
      int2mon(i,tmpmon);
      //cout<<"tmp mon "<<tmpmon<<endl;
    }
  Docompress(i+1,Pk,dump);
  serveurcompress(i);
}

void Docompress	(	int	i,
		typPk &	Pk,
		typPk &	redspol,
		typdump &	dump
	)			[inline]

Definition at line 611 of file placemon.cc.

References Iszero().

{
  typedef typename typPk::value_type::monom_t mon;
  typedef typename typPk::value_type::coeff_t coeff;
  typedef typename typdump::value_type dumpstruct;
  mon tmpmon;
  
  for(typename typPk::iterator iter=Pk.begin();iter!=Pk.end();iter++)
    if(i<iter->size)
      {
        int k;
        for(k=i;k>=0&&Iszero(iter->nf[k]);k--);
        //      cout<<" do compress K "<<k<<" "<<iter->nf[k]<<endl;
        iter->nf=(coeff*)MAC_REV_REALLOC<coeff>(iter->nf
                                                ,iter->size*sizeof(coeff)
                                                ,(k+1)*sizeof(coeff));
        //cout<<"I "<<i<<" et iter->size "<<iter->size<<endl;
        iter->size=k+1;
      }
  for(typename typPk::iterator iter=redspol.begin();iter!=redspol.end();iter++)
    if(i<iter->size)
      {
        int k;
        for(k=i;k>=0&&Iszero(iter->nf[k]);k--);
        //      cout<<" do compress K "<<k<<" "<<iter->nf[k]<<endl;
        iter->nf=(coeff*)MAC_REV_REALLOC<coeff>(iter->nf
                                                ,iter->size*sizeof(coeff)
                                                ,(k+1)*sizeof(coeff));
        //cout<<"I "<<i<<" et iter->size "<<iter->size<<endl;
        iter->size=k+1;
      }

  for(typename typdump::iterator iter=dump.begin();
      iter!=dump.end();iter++)
    //if(iter!=dump.rend())  
    {
      for(typename dumpstruct::pol_t *iterdump=iter->nf;
          iterdump!=iter->nf+iter->size;iterdump++)
        if(i<iterdump->size)
        {
          int k;
          for(k=i;k>=0&&Iszero(iterdump->nf[k]);k--);
          iterdump->nf=(coeff*)MAC_REV_REALLOC<coeff>(iterdump->nf
                                              ,iterdump->size*sizeof(coeff)
                                              ,(k+1)*sizeof(coeff));
          iterdump->size=k+1;
        }
    }
}

void Docompress	(	int	i,
		typPk &	Pk,
		typdump &	dump
	)			[inline]

Definition at line 458 of file placemon.cc.

References Iszero().

Referenced by compress().

{
  typedef typename typPk::value_type::monom_t mon;
  typedef typename typPk::value_type::coeff_t coeff;
  typedef typename typdump::value_type dumpstruct;
  mon tmpmon;
  
  for(typename typPk::iterator iter=Pk.begin();iter!=Pk.end();iter++)
    if(i<iter->size)
      {
        int k;
        for(k=i;k>=0&&Iszero(iter->nf[k]);k--);
        //      cout<<" do compress K "<<k<<" "<<iter->nf[k]<<endl;
        iter->nf=(coeff*)MAC_REV_REALLOC<coeff>(iter->nf
                                                ,iter->size*sizeof(coeff)
                                                ,(k+1)*sizeof(coeff));
        //cout<<"I "<<i<<" et iter->size "<<iter->size<<endl;
        iter->size=k+1;
      }
  
  for(typename typdump::iterator iter=dump.begin();
      iter!=dump.end();iter++)
    //if(iter!=dump.rend())  
    {
      for(typename dumpstruct::pol_t *iterdump=iter->nf;
          iterdump!=iter->nf+iter->size;iterdump++)
        if(i<iterdump->size)
        {
          int k;
          for(k=i;k>=0&&Iszero(iterdump->nf[k]);k--);
          iterdump->nf=(coeff*)MAC_REV_REALLOC<coeff>(iterdump->nf
                                              ,iterdump->size*sizeof(coeff)
                                              ,(k+1)*sizeof(coeff));
          iterdump->size=k+1;
        }
    }
}

void freeint2mon

(

int

k

)

Definition at line 407 of file placemon.cc.

References MAC_REV_REALLOC().

Referenced by serveurcompress().

{
  //memmove(int2mon_+k,int2mon_+j+1,(size-j-1)*sizeof(mon));
  int2mon_=(mon*)MAC_REV_REALLOC<mon>(int2mon_,sizeplace*sizeof(mon)
                                      ,(k)*sizeof(mon));
#ifdef unimul
  for(int i=0;i<nbvars;i++)
    multiple[i]=(int *)realloc(multiple[i],k*sizeof(int));
#endif 
#ifdef uninf
  for(int i=0;i<nbvars;i++)
    ((pol<mon,COEFF>**)nfmul)[i]=(pol<mon,COEFF>*)
      MAC_REV_REALLOC<pol<mon,COEFF> >(
      ((pol<mon,COEFF>**)nfmul)[i],sizeplace*sizeof(pol<mon,COEFF>),
      k*sizeof(pol<mon,COEFF>));


#endif
}

void freemon

(

int

j

)

Definition at line 426 of file placemon.cc.

Referenced by serveurcompress().

{
  int k;
  //memmove(int2mon_+j,int2mon_+j+1,(size-j-1)*sizeof(mon));
  //int2mon_=(mon*)MAC_REV_REALLOC<mon>(int2mon_,size*sizeof(mon)
  //                          ,(size-1)*sizeof(mon));
  for(k=0;mon2intint[k]!=j;k++);
  //cout<<"k "<<k<<" et size "<<size<<endl;
  memmove(mon2intint+k,mon2intint+k+1,(sizeplace-k-1)*sizeof(int));
  for(int i=k;i<sizeplace-1;i++)
    mon2intmon[i]=mon2intmon[i+1];
  mon2intmon[sizeplace-1]=mon(0);
  //memmove(mon2intmon+k,mon2intmon+k+1,(size-k-1)*sizeof(mon));
  mon2intint=(int*)MAC_REV_REALLOC<int>(mon2intint,sizeplace*sizeof(int)
                                   ,(sizeplace-1)*sizeof(int));
  mon2intmon=(mon*)MAC_REV_REALLOC<mon>(mon2intmon,sizeplace*sizeof(mon)
                                        ,(sizeplace-1)*sizeof(mon));
  sizeplace--;
}  

void freeplace

(

int

p

)

[inline]

Definition at line 283 of file placemon.cc.

{
  int2mon_[p]=mon(-1);
}

void freeplacemon

(

)

Definition at line 697 of file placemon.cc.

{
  MAC_REV_FREE<mon>(int2mon_,sizeplace*sizeof(mon));
  MAC_REV_FREE<mon>(mon2intmon,sizeplace*sizeof(mon));
  free(mon2intint);
  sizeplace=0;

}

void int2mon	(	const int &	i,
		mon &	res
	)			[inline]

Definition at line 288 of file placemon.cc.

Referenced by choice_dlex(), choice_fall(), choice_grevlex(), choice_mac(), choice_mpq(), choice_naif(), compress(), Degree(), halfred(), indice2(), invconv(), mindeg(), monofindex(), mult(), nf(), OLD_ReduceSpol(), proj(), putingoodshape(), sparsify(), and swap_all().

{
  res=mon(1,(int2mon_+i)->rep);
}

int mon2int

(

const mon &

mm

)

[inline]

Definition at line 294 of file placemon.cc.

References putmon(), and putmon2().

Referenced by conv_merge(), convert(), Crochetchoix(), densify(), halfred(), hasmonom(), indice2(), NewCrochetchoix(), newPkMkMatrixof(), OLD_ReduceSpol(), and putingoodshape().

{
  typedef typename mon::coeff_t coeff;
  //mon2intmon et mon2intint doivent etre trie 
  //par aordre (ord) croissant
  //
  int inf=0,sup=sizeplace,poscurrent;
  mon m=mm;
  m.SetCoeff(1);
  // cout<<"rentre mon2int"<<endl;
  //cout<<"size "<<size<<endl;
  if(sizeplace==0) {mon2intmon=NULL;mon2intint=NULL;
  int2mon_=NULL;putmon(m);
  //cout<<"transition mon2int"<<endl;
  };
  //cout<<"sup "<<sup<<" inf "<<inf<<endl;
  for(poscurrent=sizeplace/2;(sup-inf>1)&&
        (mon2intmon[poscurrent].rep!=m.rep);)
    {
      //  cout<<"poscurrent "<<poscurrent<<endl;
      if(ord(mon2intmon[poscurrent],m)>0)
        {
          sup=poscurrent;
          poscurrent=(inf+sup)/2;
        }
      else
        {
          inf=poscurrent;
          poscurrent=(inf+sup)/2;
        }
    }
  //cout<<"sortie for mon2int "<<poscurrent<<endl;
  //cout<<"les monome "<<mon2intmon[poscurrent]<<" "<<m<<endl;
  if (mon2intmon[poscurrent].rep!=m.rep) 
    {
      if (ord(mon2intmon[poscurrent],m)<0) poscurrent++;
      //if(poscurrent<size)
        //cout<<"ord(mon2intmon[poscurrent],m) "
        //  <<ord(mon2intmon[poscurrent],m)<<endl;
      //cout<<"appel putmon2 "<<endl;
      putmon2(m,poscurrent);
    }
  //cout<<"sorti mon2int"<<endl;
  return mon2intint[poscurrent];
}

void putmon

(

const mon &

m

)

[inline]

Definition at line 210 of file placemon.cc.

References putmon2().

Referenced by mon2int().

{
  int inf=0,sup=sizeplace,poscurrent=0;
  //on commence par localiser l'endroit dans mon2int*
  //ou on va rajouter le monom
  if(sizeplace!=0)
    for(poscurrent=sizeplace/2;ord(mon2intmon[poscurrent+1],
                              m)&&
          ord(m,mon2intmon[poscurrent-1]);)
      {
        if(ord(mon2intmon[poscurrent],m)>0)
          {
            sup=poscurrent;
            poscurrent=(inf+sup)/2;
          }
        else
          {
            inf=poscurrent;
            poscurrent=(inf+sup)/2;
          }
      }
  putmon2(m,poscurrent);
  return ;
}

void putmon2	(	const mon &	m,
		const int	poscurrent
	)			[inline]

Definition at line 141 of file placemon.cc.

References MAC_REV_REALLOC().

Referenced by mon2int(), and putmon().

{
  int i;
  //si le monome est deja introduit on y touche pas
  //cout<<"putmon2 atteint"<<endl;
  //cout<<"poscurrent "<<poscurrent<<endl;
  //cout<<"mon2intmon==NULL?? "<<(mon2intmon==NULL)<<" m "<<m<<endl;
  //if (poscurrent<size)
  //  cout<<((mon2intmon==NULL)||(mon2intmon[poscurrent]==m))<<endl;
  if((mon2intmon==NULL)||(poscurrent==sizeplace)||
     (mon2intmon[poscurrent].rep!=m.rep))
    {
      //  cout<<"moncurent etc passe etc vaut "<<endl;
      sizeplace++;


      mon2intmon=(mon*)MAC_REV_REALLOC<mon>(mon2intmon,(sizeplace-1)*sizeof(mon)
                                            ,(sizeplace)*sizeof(mon));
      mon2intint=(int*)realloc(mon2intint,sizeplace*sizeof(int));
      
      //int2mon=(mon*)realloc(int2mon,size*sizeof(mon));
      //on vient d'agrandir les tableaux
      for(int k=sizeplace-1;k>poscurrent;k--)
        mon2intmon[k]=mon2intmon[k-1];

      //memmove((mon2intmon+poscurrent+1),(mon2intmon+poscurrent),
      //              (size-1-poscurrent)*sizeof(mon));
      memmove((mon2intint+poscurrent+1),(mon2intint+poscurrent),
              (sizeplace-1-poscurrent)*sizeof(int));
      //on cherche s'il y a un indice dans int2mon libre
      for(i=0;i<sizeplace-1;i++)
        if (int2mon_[i]==mon(-1)) break;
      if (i==sizeplace-1)
        {
          int2mon_=(mon*)MAC_REV_REALLOC<mon>(int2mon_,(sizeplace-1)*sizeof(mon)
                                         ,sizeplace*sizeof(mon));
#ifdef unimul
          for(int k=0;k<nbvars;k++)
            {
              //cout<<"j'ai fait un realloc "<<endl;
              multiple[k]=(int*)realloc(multiple[k],sizeplace*sizeof(int));
              multiple[k][sizeplace-1]=-2;
            }
#endif 
#ifdef uninf
          for(int k=0;k<nbvars;k++)
            {
              //cout<<"j'ai fait un realloc "<<endl;
              *((pol<mon,COEFF>**)nfmul+k)=(pol<mon,COEFF>*)
                               MAC_REV_REALLOC<pol<mon,COEFF> >
                ((void*)*((pol<mon,COEFF>**)nfmul+k)
                 ,(sizeplace-1)*sizeof(pol<mon,COEFF>)
                 ,sizeplace*sizeof(pol<mon,COEFF>));
              ((pol<mon,COEFF>**)nfmul)[k][sizeplace-1].size=-1;
            }
#endif 
        
        }
      int2mon_[i]=m;
      //cout<<"int2mon_["<<i<<"] vaut "<<m<<endl;
      mon2intint[poscurrent]=i;
      mon2intmon[poscurrent]=m;
      //cout<<"mon2intmon["<<poscurrent<<"] vaut"<<mon2intmon[poscurrent]
      //          <<" et est sense valoir "<<m<<endl;
    }
  return;
}

void removemon

(

const mon &

m

)

[inline]

Definition at line 237 of file placemon.cc.

{
  int inf=0,sup,poscurrent,i;
  //on commence par localiser l'endroit dans mon2int*
  //ou on va rajouter le monom
  for(poscurrent=sizeplace/2;ord(mon2intmon[poscurrent+1],
                                m)&&
        ord(m,
            mon2intmon[poscurrent-1]);)
    {
      if(ord(mon2intmon[poscurrent],m)>0)
        {
          sup=poscurrent;
          poscurrent=(inf+sup)/2;
        }
      else
        {
          inf=poscurrent;
          poscurrent=(inf+sup)/2;
        }
    }
  //si le monome n'est PAS deja introduit on  touche a rien
  if(mon2intmon[poscurrent]!=m)
    {
      //on libere l'endroit ou se trouve ce monome
      int2mon_[poscurrent]=mon(-1);
      //on recopier apres dans les mon2int pour enlever le monome
      memmove((mon2intmon+poscurrent),(mon2intmon+poscurrent+1),
              (sizeplace-poscurrent-2)*sizeof(mon));
      memmove((mon2intint+poscurrent),(mon2intint+poscurrent+1),
              (sizeplace-poscurrent-2)*sizeof(int));
      //on retrecit les mon2int*
       sizeplace--;
       mon2intmon=(mon*)realloc(mon2intmon,sizeplace*sizeof(mon));
       mon2intint=(int*)realloc(mon2intint,sizeplace*sizeof(int));
    }
  return;
}

void serveurcompress

(

int

i

)

Definition at line 446 of file placemon.cc.

References freeint2mon(), and freemon().

Referenced by compress().

{
  int tmpsize=sizeplace;
  freeint2mon(i+2);
  for(int k=i+2;k<tmpsize;k++)
    freemon(k);
  //for(int j=0;j<size;j++)
  //  cout<<j<<" les pos possibles "<<mon2intint[j]<<" "<<mon2intmon[j]<<" int2mon "<<int2mon_[mon2intint[j]]<<endl;
  // size=i+2;
}

void setorder

(

ptrfun

tmpord

)

[inline]

Definition at line 132 of file placemon.cc.

Referenced by init_algo().

{
  ord=(int (*)(const mon &,const mon &))(tmpord);
}

int sizeplacemon

(

)

Definition at line 136 of file placemon.cc.

Referenced by compress().

{
  return sizeplace;
}

void swap_all	(	int	i,
		int	j,
		typPk &	Pk,
		typPk &	redspol,
		typdump &	dump
	)			[inline]

Definition at line 536 of file placemon.cc.

References int2mon(), and Iszero().

{
  typedef typename typPk::value_type::monom_t mon;
  typedef typename typdump::value_type dumpstruct;
  mon tmpmon;
  int deg,pos1,pos2;
  int2mon(j,tmpmon);
  deg=tmpmon.GetDegree();
  //  for(typename typPk::iterator iter=Pk.begin();iter!=Pk.end();iter++)
  //  cout<<"swap "<<invconv<Poly>(*iter)<<endl;
  for(typename typPk::iterator iter=Pk.begin();iter!=Pk.end();iter++)
    if(j<iter->size&&!Iszero(iter->nf[j]))
      {
        //cout<<"swapall "<<i<<" "<<j<<" iter->nf[j] "<<iter->nf[j]<<endl;
        iter->nf[i]=iter->nf[j];
        iter->nf[j]=0;
      }
  for(typename typPk::iterator iter=redspol.begin();iter!=redspol.end();iter++)
    if(j<iter->size&&!Iszero(iter->nf[j]))
      {
        //cout<<"swapall "<<i<<" "<<j<<" iter->nf[j] "<<iter->nf[j]<<endl;
        iter->nf[i]=iter->nf[j];
        iter->nf[j]=0;
      }
  
  for(typename typdump::iterator iter=dump.begin();iter!=dump.end();iter++)
    {
      //if(iter->k<=deg)
        {
          for(typename dumpstruct::pol_t *iterdump=iter->nf;
              iterdump!=iter->nf+iter->size;iterdump++)
            {
              if(j<iterdump->size&&!Iszero(iterdump->nf[j]))
                {
                  iterdump->nf[i]=iterdump->nf[j];
                  iterdump->nf[j]=0;
                }
            }
        }
    }
  tmpmon=int2mon_[i];
  int2mon_[i]=int2mon_[j];
  int2mon_[j]=tmpmon;
  for(pos1=0;mon2intint[pos1]!=j;pos1++);
  for(pos2=0;mon2intint[pos2]!=i;pos2++);
  mon2intint[pos1]=i;
  mon2intint[pos2]=j;

#ifdef unimul
  for(int k=0;k<nbvars;k++)
    {
      for(int l=0;l<sizeplace;l++)
        {
          if(multiple[k][l]==i)
            multiple[k][l]=j;
          else if(multiple[k][l]==j)
            multiple[k][l]=i;
        }
      int stock=multiple[k][i];
      multiple[k][i]=multiple[k][j];
      multiple[k][j]=stock;
    }
#endif
#ifdef uninf
  for(int k=0;k<nbvars;k++)
    {
      pol<mon,COEFF> stock=(*((pol<mon,COEFF>**)nfmul+k))[i];
      (*((pol<mon,COEFF>**)nfmul+k))[i]=(*((pol<mon,COEFF>**)nfmul+k))[j];
      (*((pol<mon,COEFF>**)nfmul+k))[j]=stock;
    }
#endif

}

void swap_all	(	int	i,
		int	j,
		typPk &	Pk,
		typdump &	dump
	)			[inline]

Definition at line 341 of file placemon.cc.

References int2mon(), and Iszero().

Referenced by compress().

{
  typedef typename typPk::value_type::monom_t mon;
  typedef typename typdump::value_type dumpstruct;
  mon tmpmon;
  int deg,pos1,pos2;
  int2mon(j,tmpmon);
  deg=tmpmon.GetDegree();
  //  for(typename typPk::iterator iter=Pk.begin();iter!=Pk.end();iter++)
  //  cout<<"swap "<<invconv<Poly>(*iter)<<endl;
  for(typename typPk::iterator iter=Pk.begin();iter!=Pk.end();iter++)
    if(j<iter->size&&!Iszero(iter->nf[j]))
      {
        //cout<<"swapall "<<i<<" "<<j<<" iter->nf[j] "<<iter->nf[j]<<endl;
        iter->nf[i]=iter->nf[j];
        iter->nf[j]=0;
      }
  for(typename typdump::iterator iter=dump.begin();iter!=dump.end();iter++)
    {
      //if(iter->k<=deg)
        {
          for(typename dumpstruct::pol_t *iterdump=iter->nf;
              iterdump!=iter->nf+iter->size;iterdump++)
            {
              if(j<iterdump->size&&!Iszero(iterdump->nf[j]))
                {
                  iterdump->nf[i]=iterdump->nf[j];
                  iterdump->nf[j]=0;
                }
            }
        }
    }
  tmpmon=int2mon_[i];
  int2mon_[i]=int2mon_[j];
  int2mon_[j]=tmpmon;
  for(pos1=0;mon2intint[pos1]!=j;pos1++);
  for(pos2=0;mon2intint[pos2]!=i;pos2++);
  mon2intint[pos1]=i;
  mon2intint[pos2]=j;

#ifdef unimul
  for(int k=0;k<nbvars;k++)
    {
      for(int l=0;l<sizeplace;l++)
        {
          if(multiple[k][l]==i)
            multiple[k][l]=j;
          else if(multiple[k][l]==j)
            multiple[k][l]=i;
        }
      int stock=multiple[k][i];
      multiple[k][i]=multiple[k][j];
      multiple[k][j]=stock;
    }
#endif
#ifdef uninf
  for(int k=0;k<nbvars;k++)
    {
      pol<mon,COEFF> stock=(*((pol<mon,COEFF>**)nfmul+k))[i];
      (*((pol<mon,COEFF>**)nfmul+k))[i]=(*((pol<mon,COEFF>**)nfmul+k))[j];
      (*((pol<mon,COEFF>**)nfmul+k))[j]=stock;
    }
#endif

}