DataFormats/GeometrySurface/test/testGeometricSort.cpp - master - githubmirror/cmssw

DataFormats/GeometrySurface/test/testGeometricSort.cpp
82 строки3 KB
Cms Build
Clang-Format
11 июн 2019, 11:30
11 июн 2019, 11:30044a211
#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;
}