|
|
|
#include <iostream>#include <utility>#include <vector>#include <algorithm>#include <cmath>#include <boost/bind.hpp>Go to the source code of this file.
Classes | |
| struct | details::PhiSortElement< Object, Scalar > |
Namespaces | |
| namespace | details |
Functions | |
| template<typename RandomAccessIterator , typename Extractor > | |
| void | TrackerStablePhiSort (RandomAccessIterator begin, RandomAccessIterator end, const Extractor &extr) |
| void TrackerStablePhiSort | ( | RandomAccessIterator | begin, |
| RandomAccessIterator | end, | ||
| const Extractor & | extr | ||
| ) |
Definition at line 45 of file TrackerStablePhiSort.h.
References begin, filterCSVwithJSON::copy, M_PI, VarParsing::obj, L1TEmulatorMonitor_cff::p, jptDQMConfig_cff::phiMax, jptDQMConfig_cff::phiMin, python::multivaluedict::sort(), svgfig::template(), and relativeConstraints::value.
Referenced by CmsTrackerDiskBuilder::sortNS(), CmsTrackerRingBuilder::sortNS(), CmsTrackerWheelBuilder::sortNS(), and CmsTrackerLayerBuilder::sortNS().
{
typedef typename Extractor::result_type Scalar;
typedef typename std::iterator_traits<RandomAccessIterator>::value_type value_type;
typedef details::PhiSortElement<value_type, Scalar> Element;
std::vector<Element> tmpvec(end-begin);
std::transform(begin,end,tmpvec.begin(),
boost::bind(Element::template build<Extractor>,_1, boost::cref(extr))
);
std::vector<Element> tmpcop(end-begin);
std::sort(tmpvec.begin(), tmpvec.end());
const unsigned int vecSize = tmpvec.size();
// special tratment of the TEC modules of rings in petals near phi=0
// there are at most 5 modules, no other structure has less than ~10 elements to order in phi
// hence the special case in phi~0 if the size of the elements to order is <=5
const unsigned int nMaxModulesPerRing = 5;
bool phiZeroCase = true;
//
const double phiMin = M_PI_4;
const double phiMax = 2*M_PI-phiMin;
//
if( vecSize > nMaxModulesPerRing ) {
//stability check
// check if the last element is too near to zero --> probably it is zero
double tolerance = 0.000001;
if( fabs(tmpvec.back().value - 0) < tolerance // near 0
||
fabs(tmpvec.back().value - 2*M_PI) < tolerance ) { // near 2pi
// move it to front
tmpvec.insert(tmpvec.begin(),tmpvec.back());
tmpvec.pop_back();
}
}
else {
// check if all the elements have phi<phiMin or phi>phiMax to be sure we are near phi~0 (angles are in [0,2pi) range)
// if a phi goes out from [0,phiMin]U[phiMax,2pi) it is not the case
// sorted. if first > phiMax all other will also...
typename std::vector<Element>::iterator p =
std::find_if(tmpvec.begin(),tmpvec.end(), boost::bind(&Element::value,_1) > phiMin);
phiZeroCase = !(p!=tmpvec.end() && (*p).value<phiMax);
// go on if this is the petal phi~0 case, restricted to the case where all the |phi| are in range [0,phiMin]
if(phiZeroCase) {
// in this case the ordering must be: ('negative' values, >) and then ('positive' values, >) in (-pi,pi] mapping
// already sorted, just swap ranges
if(p!=tmpvec.end()) {
tmpvec.insert(tmpvec.begin(),p,tmpvec.end());
tmpvec.resize(vecSize);
}
}
}
// overwrite the input range with the sorted values
// copy of input container not necessary, but tricky to avoid
std::vector<value_type> tmpvecy(vecSize);
std::transform(tmpvec.begin(),tmpvec.end(),tmpvecy.begin(),boost::bind(&Element::obj,_1));
std::copy(tmpvecy.begin(),tmpvecy.end(),begin);
}
1.7.3