1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172
|
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
//**********************************************************************
//**********************************************************************
class C{
friend class SacH;
long lPosO;
};
//**********************************************************************
//**********************************************************************
template <class gen>
class D{
friend class SacH;
gen objet;
};
//**********************************************************************
//**********************************************************************
template <class gen>
class E{
friend class SacH;
std::vector< D<gen> > ptrO;
};
//**********************************************************************
//**********************************************************************
template <class gen>
class SacH{
E<gen> * TabPob;
long lposSac;
long lposDsc;
long mxSac;
long mxTsac;
long nbajout;
//**********************************************************************
//**********************************************************************
public:
SacH(long longueurtable,long tailledunsac)
{
std::vector< D<gen> >SacOb(tailledunsac);
this->TabPob = new E<gen>[30];
this->TabPob[0].ptrO = SacOb;
lposSac = 0;
nbajout = 0;
lposDsc = 0;
mxSac = ( longueurtable / tailledunsac ) - 1;
mxTsac = tailledunsac - 1;
}
//**********************************************************************
//**********************************************************************
void ajouter(gen objet)
{
if (this->lposDsc == this->mxTsac)
{
if (this->lposSac == this->mxSac)
{
std::cout << "debut agrandissement " << std::endl;
this->TabPob[this->lposSac].ptrO[this->lposDsc].objet = objet;
std::vector< D<gen> >oo(this->mxTsac+1);
this->lposSac++;
this->TabPob[this->lposSac].ptrO = oo;
std::cout << "fin agrandissement " << std::endl;
std::cout << "sac actuel : " << this->lposSac<< std::endl;
this->lposDsc=0;
this->mxSac = this->mxSac + 2;
}
else
{
this->TabPob[this->lposSac].ptrO[this->lposDsc].objet = objet;
std::vector< D<gen> >oo(this->mxTsac+1);
this->lposSac++;
this->TabPob[this->lposSac].ptrO = oo;
std::cout << "nb ajout: " << this->nbajout<< std::endl;
// system("pause");
std::cout << "sac actuel : " << this->lposSac<< std::endl;
this->lposDsc=0;
}
}
else
{
this->TabPob[this->lposSac].ptrO[this->lposDsc].objet = objet;
this->lposDsc++;
}
nbajout++;
}
//**********************************************************************
//**********************************************************************
gen& renvoi( long indice )
{
if ( indice < this->mxTsac + 1 )
{
return this->TabPob[0].ptrO[indice].objet;
}
else
{
long i = indice / ( this->mxTsac + 1 );
long ii = indice % ( this->mxTsac + 1 );
return this->TabPob[i].ptrO[ii].objet;
}
}
SacH(){}
//**********************************************************************
//**********************************************************************
long indP2()
{
return nbajout;
}
void delsac()
{
for(int i=0;i<30;i++)
{
// if(!TabPob.empty())
// {
this->TabPob[i].ptrO.clear();
std::cout << "effacement du sac : " <<i << std::endl;
// }
}
std::cout << "2 " << std::endl;
// delete [] this->TabPob;
std::cout << "sacs effacees " << std::endl;
}
}; |
Partager