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
|
#include <iostream>
#include <list>
#include <vector>
#include <iterator>
#include <functional>
#include <boost/bind.hpp>
#include <boost/iterator/counting_iterator.hpp>
#include <time.h>
template<template<class,class > class Conteneur, class T, class A, class Fonction >
void Tester(const std::string &NomConteneur, const std::string &NomFonction, Conteneur<T,A> & Objet, Fonction P_f)
{
clock_t L_t0;
clock_t L_tTotal;
size_t L_NbrElements = Objet.size();
std::cout<<"Temps "<<NomFonction<<" "<<NomConteneur<<" : ";
L_t0 = clock();
P_f(Objet);
L_tTotal = clock()-L_t0;
std::cout<<L_tTotal<< " ( "<<L_NbrElements<<" ), "<<(double)L_tTotal/(double)L_NbrElements<<" (1)\n";
}
template<class T>
void Detruire(T &Element)
{
delete ∈
}
template<class T>
void RemoveAll(T &Element)
{
while(!Element.empty()){
Element.pop_back();
}
}
template<class T>
void EraseFirst(T &Element)
{
while(!Element.empty()){
Element.erase(Element.begin());
}
}
template<class T>
void EraseLast(T &Element)
{
while(!Element.empty()){
typename T::iterator L_fin;
L_fin = Element.end();
--L_fin;
Element.erase(L_fin);
}
}
template<class T>
void Inserer1Debut(T&Element)
{
Element.insert(Element.begin(),1);
}
template<class T>
void Inserer1Fin(T&Element)
{
Element.insert(Element.begin(),1);
}
template<class T>
void InsererNMilieu(T&Element, int NbrElements, typename T::iterator Milieu)
{
Element.template insert<boost::counting_iterator<int> >(
Milieu
,boost::counting_iterator<int>(0)
,boost::counting_iterator<int>(NbrElements)
);
}
template<template<class, class > class Conteneur>
void BatterieTest(const std::string &NomConteneur, const int &P_iNbrElement)
{
typedef Conteneur<int, std::allocator<int> > TypeConteneur;
TypeConteneur *L_pConteneur;
L_pConteneur = new TypeConteneur;
std::cout<<"Taille "<<NomConteneur<<" : "<<P_iNbrElement<<"\n";
Tester(NomConteneur,"resize",*L_pConteneur,boost::bind(&TypeConteneur::resize,_1,P_iNbrElement,0));
Tester(NomConteneur,"removeAll/pop_back",*L_pConteneur,boost::bind(RemoveAll<TypeConteneur > ,_1));
(*L_pConteneur).resize(P_iNbrElement);
Tester(NomConteneur,"erase(begin)",*L_pConteneur,boost::bind(EraseFirst<TypeConteneur > ,_1));
(*L_pConteneur).resize(P_iNbrElement);
Tester(NomConteneur,"erase(end)",*L_pConteneur,boost::bind(EraseLast<TypeConteneur > ,_1));
(*L_pConteneur).resize(P_iNbrElement);
Tester(NomConteneur,"push_back",*L_pConteneur,boost::bind(&TypeConteneur::push_back ,_1,1));
(*L_pConteneur).resize(P_iNbrElement);
Tester(NomConteneur,"clear",*L_pConteneur,boost::bind(&TypeConteneur::clear,_1));
(*L_pConteneur).resize(P_iNbrElement);
Tester(NomConteneur,"insert(1,begin)",*L_pConteneur,boost::bind(Inserer1Debut<TypeConteneur > ,_1));
Tester(NomConteneur,"insert(1,end)",*L_pConteneur,boost::bind(Inserer1Fin<TypeConteneur > ,_1));
typename TypeConteneur::iterator L_iMilieu;
L_iMilieu = L_pConteneur->begin();
int L_iTaille = L_pConteneur->size()/2;
while(L_iTaille>0){
++L_iMilieu;--L_iTaille;
}
Tester(NomConteneur,"insert(100000,milieu)",*L_pConteneur,boost::bind(InsererNMilieu<TypeConteneur > ,_1,100000,L_iMilieu));
Tester(NomConteneur,"delete",*L_pConteneur,boost::bind(Detruire<TypeConteneur > ,_1));
std::cout<<std::endl;
}
int main()
{
static const int L_ciNbrElements = 100000;
BatterieTest<std::vector>("Vecteur",L_ciNbrElements);
BatterieTest<std::list>("Liste",L_ciNbrElements);
std::cout<<"Fin test"<<std::endl;
return getchar();
} |
Tri rapide d'une CListCtrl
Répondre avec citation
Envoyé par vanitom
Partager