28 DDsvalues_type::const_iterator sit = sv.begin();
29 DDsvalues_type::const_iterator sed = sv.end();
31 if (target.back()<sv.front()) {
33 target.insert(target.end(),sit,sed);
36 if (sv.back()<target.front()) {
38 target.insert(target.begin(),sit,sed);
42 DDsvalues_type::iterator it = std::lower_bound(target.begin(),target.end(),sv.front());
43 if (it == std::lower_bound(target.begin(),target.end(),sv.back())) {
45 target.insert(it,sit,sed);
51 target.reserve(target.size()+sv.size());
52 DDsvalues_type::const_iterator ted = target.end();
53 for (; sit != sed; ++sit) {
54 DDsvalues_type::const_iterator it =
find(target.begin(),ted, (*sit).first);
56 else target.push_back(*sit);
58 if (sortit)
std::sort(target.begin(),target.end());
64 DDsvalues_type::const_iterator it = s.begin();
65 for(; it != s.end(); ++it) {
79 std::ostream & operator<<(std::ostream & os , const std::vector<const DDsvalues_type*> &
v)
81 for (
unsigned int i=0;
i<
v.size() ; ++
i) {
105 DDsvalues_type::const_iterator it =
find(*p, v);
106 if (it != p->end()) {
114 unsigned int DDfetch(
const std::vector<const DDsvalues_type *> & sp,
DDValue & toFetch, std::vector<DDValue> &
result)
116 unsigned int count = 0;
117 std::vector<const DDsvalues_type *>::const_iterator it(sp.begin()), ed(sp.end());
118 for (; it != ed; ++it) {
120 result.push_back(toFetch);
std::ostream & operator<<(std::ostream &out, const ALILine &li)
void find(edm::Handle< EcalRecHitCollection > &hits, DetId thisDet, std::vector< EcalRecHitCollection::const_iterator > &hit, bool debug=false)
bool DDfetch(const DDsvalues_type *, DDValue &)
helper for retrieving DDValues from DDsvalues_type *.
unsigned int(* Counter)(align::ID, const TrackerTopology *)
std::vector< std::pair< unsigned int, DDValue > > DDsvalues_type
std::maps an index to a DDValue. The index corresponds to the index assigned to the name of the std::...
static std::atomic< unsigned int > counter
DDsvalues_type::value_type DDsvalues_Content_type