|
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
|
#include "Utilities/General/interface/precomputed_value_sort.h"
#include "DataFormats/GeometrySurface/interface/Plane.h"
#include "DataFormats/GeometrySurface/interface/GeometricSorting.h"
#include <iostream>
#include <iterator>
using namespace std;
using namespace geomsort;
typedef Surface::PositionType PositionType;
typedef Surface::RotationType RotationType;
// A simple helper for printing the object
struct dump {
void operator()(const Surface& o) {
cout << o.position() << " R : " << o.position().perp() << " Phi: " << o.position().phi()
<< " Z : " << o.position().z() << endl;
}
void operator()(const std::unique_ptr<Surface>& o) { operator()(*o); }
void operator()(const Surface* o) { operator()(*o); }
};
int main() {
using Pointer = std::unique_ptr<Surface>;
//
// Example of sorting a vector of objects store by value.
//
// Fill the vector to be sorted
vector<Pointer> v;
v.push_back(Pointer(new Plane(PositionType(2, 1, 1), RotationType())));
v.push_back(Pointer(new Plane(PositionType(1, 1, 2), RotationType())));
v.push_back(Pointer(new Plane(PositionType(1, 2, 3), RotationType())));
v.push_back(Pointer(new Plane(PositionType(2, 2, 4), RotationType())));
cout << "Original vector: " << endl;
for_each(v.begin(), v.end(), dump());
/*
cout << "Sort in R : " << endl;
// Here we sort in R
precomputed_value_sort(v.begin(),v.end(),ExtractR<Surface>());
for_each(v.begin(),v.end(), dump());
cout << "Sort in phi : " << endl;
// Here we sort in phi
precomputed_value_sort(v.begin(),v.end(),ExtractPhi<Surface>());
for_each(v.begin(),v.end(), dump());
cout << "Sort in z : " << endl;
// Here we sort in Z
precomputed_value_sort(v.begin(),v.end(),ExtractZ<Surface>());
for_each(v.begin(),v.end(), dump());
*/
//
// Now do the same with a vector of pointers
//
cout << endl << "Again with pointers" << endl;
vector<const Surface*> vp;
for (auto i = v.begin(); i != v.end(); i++) {
vp.push_back(&(**i));
}
cout << "Sort in R : " << endl;
// Here we sort in R
precomputed_value_sort(vp.begin(), vp.end(), ExtractR<Surface>());
for_each(vp.begin(), vp.end(), dump());
cout << "Sort in phi : " << endl;
// Here we sort in phi
precomputed_value_sort(vp.begin(), vp.end(), ExtractPhi<Surface>());
for_each(vp.begin(), vp.end(), dump());
cout << "Sort in z : " << endl;
// Here we sort in Z
precomputed_value_sort(vp.begin(), vp.end(), ExtractZ<Surface>());
for_each(vp.begin(), vp.end(), dump());
return 0;
}
|