CMS 3D CMS Logo

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Pages
List of all members | Public Types | Public Member Functions | Static Public Member Functions | Private Member Functions | Private Attributes
edm::DetSetVector< T > Class Template Reference

#include <DetSetVector.h>

Inheritance diagram for edm::DetSetVector< T >:

Public Types

typedef std::vector< detsetcollection_type
 
typedef
collection_type::const_iterator 
const_iterator
 
typedef detset const & const_reference
 
typedef DetSet< Tdetset
 
typedef collection_type::iterator iterator
 
typedef detsetreference
 
typedef collection_type::size_type size_type
 
typedef detset value_type
 

Public Member Functions

iterator begin ()
 Return an iterator to the first DetSet. More...
 
const_iterator begin () const
 
 DetSetVector ()
 Create an empty DetSetVector. More...
 
 DetSetVector (std::vector< DetSet< T > > &input, bool alreadySorted=false)
 
bool empty () const
 Return true if we contain no DetSets. More...
 
iterator end ()
 Return the off-the-end iterator. More...
 
const_iterator end () const
 
void fillView (ProductID const &id, std::vector< void const * > &pointers, helper_vector &helpers) const
 
iterator find (det_id_type id)
 
const_iterator find (det_id_type id) const
 
reference find_or_insert (det_id_type id)
 
void getIds (std::vector< det_id_type > &result) const
 
void insert (detset const &s)
 Insert the given DetSet. More...
 
DetSetVectoroperator= (DetSetVector const &other)
 
reference operator[] (det_id_type i)
 
const_reference operator[] (det_id_type i) const
 
void post_insert ()
 
size_type size () const
 Return the number of contained DetSets. More...
 
void swap (DetSetVector &other)
 

Static Public Member Functions

static short Class_Version ()
 

Private Member Functions

void _sort ()
 Sort the DetSet in order of increasing DetId. More...
 
 BOOST_CLASS_REQUIRE (T, boost, LessThanComparableConcept)
 

Private Attributes

edm::BoolCache _alreadySorted
 
collection_type _sets
 

Detailed Description

template<class T>
class edm::DetSetVector< T >

Definition at line 62 of file DetSetVector.h.

Member Typedef Documentation

template<class T>
typedef std::vector<detset> edm::DetSetVector< T >::collection_type

Definition at line 100 of file DetSetVector.h.

template<class T>
typedef collection_type::const_iterator edm::DetSetVector< T >::const_iterator

Definition at line 106 of file DetSetVector.h.

template<class T>
typedef detset const& edm::DetSetVector< T >::const_reference

Definition at line 103 of file DetSetVector.h.

template<class T>
typedef DetSet<T> edm::DetSetVector< T >::detset

Definition at line 98 of file DetSetVector.h.

template<class T>
typedef collection_type::iterator edm::DetSetVector< T >::iterator

Definition at line 105 of file DetSetVector.h.

template<class T>
typedef detset& edm::DetSetVector< T >::reference

Definition at line 102 of file DetSetVector.h.

template<class T>
typedef collection_type::size_type edm::DetSetVector< T >::size_type

Definition at line 107 of file DetSetVector.h.

template<class T>
typedef detset edm::DetSetVector< T >::value_type

Definition at line 99 of file DetSetVector.h.

Constructor & Destructor Documentation

template<class T >
edm::DetSetVector< T >::DetSetVector ( )
inline

Create an empty DetSetVector.

Compiler-generated copy c'tor, d'tor and assignment are correct.

Definition at line 200 of file DetSetVector.h.

200  :
201  _sets()
202  { }
collection_type _sets
Definition: DetSetVector.h:190
template<class T>
edm::DetSetVector< T >::DetSetVector ( std::vector< DetSet< T > > &  input,
bool  alreadySorted = false 
)
inlineexplicit

Create a DetSetVector by copying swapping in the given vector, and then sorting the contents. N.B.: Swapping in the vector destructively modifies the input. Using swap here allows us to avoid copying the data. N.B. 2: if you set alreadySorted to true, data must be sorted, (the vector<DetSet<T>> must be ordered by detid, and each DetSet must be ordered according to the natural "strict weak ordering" of Ts. You must not modify the contents after this DSV after creation, or you might get an undefined behavior / a core dump. (there are some checks to assure alreadySorted is resetted if you try to modify the DSV, but you should not count on them)

Definition at line 206 of file DetSetVector.h.

References edm::DetSetVector< T >::_sets, edm::DetSetVector< T >::_sort(), and LaserDQM_cfg::input.

206  :
207  _sets(), _alreadySorted(alreadySorted)
208  {
209  _sets.swap(input);
210  if (!alreadySorted) _sort();
211  }
collection_type _sets
Definition: DetSetVector.h:190
edm::BoolCache _alreadySorted
Definition: DetSetVector.h:191
void _sort()
Sort the DetSet in order of increasing DetId.
Definition: DetSetVector.h:396

Member Function Documentation

template<class T >
void edm::DetSetVector< T >::_sort ( )
inlineprivate

Sort the DetSet in order of increasing DetId.

Definition at line 396 of file DetSetVector.h.

References python.multivaluedict::sort().

Referenced by edm::DetSetVector< T >::DetSetVector().

396  {
397  std::sort(_sets.begin(), _sets.end());
398  }
collection_type _sets
Definition: DetSetVector.h:190
template<class T >
DetSetVector< T >::iterator edm::DetSetVector< T >::begin ( void  )
inline

Return an iterator to the first DetSet.

Definition at line 341 of file DetSetVector.h.

Referenced by edm::DataMixingSiPixelWorker::addSiPixelPileups(), edm::DataMixingSiStripWorker::addSiStripPileups(), SiStripQualityHotStripIdentifier::algoAnalyze(), SiPixelDigiValid::analyze(), SiStripDigiValid::analyze(), SiStripBaselineValidator::analyze(), SiPixelHLTSource::analyze(), SiStripBaselineAnalyzer::analyze(), FWSiStripDigiProxyBuilder::build(), FWSiPixelDigiProxyBuilder::build(), SiStripFineDelayHit::closestCluster(), SiStripMeanCMExtractor::CMExtractorFromPedestals(), APVShotFinder::computeShots(), SiStripAPVRestorer::CreateCMMapCMstored(), SiStripAPVRestorer::CreateCMMapRealPed(), sistrip::SpyDigiConverter::extractPayloadDigis(), SiPixelRawDataErrorModule::fill(), SiPixelDigiModule::fill(), SiPixelCalibDigiProducer::fill(), LaserAlignment::fillDataProfiles(), SiPixelRawDataErrorModule::fillFED(), LaserAlignmentT0ProducerDQM::FillFromProcessedDigis(), LaserAlignmentT0ProducerDQM::FillFromRawDigis(), sistrip::FEDEmulator::fillNoises(), sistrip::FEDEmulator::fillPeds(), GlobalDigisProducer::fillTrk(), GlobalDigisAnalyzer::fillTrk(), cms::MTCCHLTrigger::filter(), ClusterMultiplicityFilter::filter(), RPCHitAssociator::findRPCDigiSimLink(), SiStripZeroSuppression::formatRawDigis(), RawDataConverter::GetDigis(), sistrip::SpyUtilities::getMajorityHeader(), RBCProcessRPCSimDigis::next(), SiStripProcessedRawDigiProducer::pr_process(), SiStripZeroSuppression::processRaw(), sistrip::FEDEmulatorModule::produce(), edm::DataMixingSiStripRawWorker::putSiStrip(), sistrip::SpyDigiConverter::reorderDigis(), cms::SiPixelClusterProducer::run(), SiStripMeanCMExtractor::StoreMean(), sistrip::FEDEmulator::subtractPedestals(), SiStripProcessedRawDigiProducer::vr_process(), and SiStripProcessedRawDigiProducer::zs_process().

341  {
342  _alreadySorted = false; // it's non const
343  return _sets.begin();
344  }
collection_type _sets
Definition: DetSetVector.h:190
edm::BoolCache _alreadySorted
Definition: DetSetVector.h:191
template<class T >
DetSetVector< T >::const_iterator edm::DetSetVector< T >::begin ( void  ) const
inline

Definition at line 349 of file DetSetVector.h.

349  {
350  return _sets.begin();
351  }
collection_type _sets
Definition: DetSetVector.h:190
template<class T>
edm::DetSetVector< T >::BOOST_CLASS_REQUIRE ( T  ,
boost  ,
LessThanComparableConcept   
)
private

DetSetVector requires that T objects can be compared with operator<.

template<class T>
static short edm::DetSetVector< T >::Class_Version ( )
inlinestatic

Definition at line 187 of file DetSetVector.h.

189 :
collection_type _sets
Definition: DetSetVector.h:190
std::vector< detset > collection_type
Definition: DetSetVector.h:100
template<class T >
bool edm::DetSetVector< T >::empty ( ) const
inline

Return true if we contain no DetSets.

Definition at line 271 of file DetSetVector.h.

Referenced by Vispa.Gui.VispaWidget.TextField::setAutosizeFont(), and Vispa.Gui.VispaWidget.TextField::setAutotruncate().

271  {
272  return _sets.empty();
273  }
collection_type _sets
Definition: DetSetVector.h:190
template<class T >
DetSetVector< T >::iterator edm::DetSetVector< T >::end ( void  )
inline

Return the off-the-end iterator.

Definition at line 356 of file DetSetVector.h.

Referenced by edm::DataMixingSiPixelWorker::addSiPixelPileups(), edm::DataMixingSiStripWorker::addSiStripPileups(), SiStripQualityHotStripIdentifier::algoAnalyze(), SiPixelDigiValid::analyze(), SiStripDigiValid::analyze(), MuonTruth::analyze(), SiStripBaselineValidator::analyze(), SiPixelHLTSource::analyze(), SiStripSpyMonitorModule::analyze(), SiStripBaselineAnalyzer::analyze(), MuonTruth::associateCSCHitId(), MuonTruth::associateHitId(), FWSiStripDigiProxyBuilder::build(), FWSiPixelDigiProxyBuilder::build(), SiStripFineDelayHit::closestCluster(), SiStripMeanCMExtractor::CMExtractorFromPedestals(), APVShotFinder::computeShots(), Types.LuminosityBlockRange::cppID(), Types.EventRange::cppID(), SiStripAPVRestorer::CreateCMMapCMstored(), SiStripAPVRestorer::CreateCMMapRealPed(), sistrip::SpyDigiConverter::extractPayloadDigis(), SiPixelRawDataErrorModule::fill(), SiPixelDigiModule::fill(), SiPixelCalibDigiProducer::fill(), SiStripCommissioningSource::fillCablingHistos(), LaserAlignment::fillDataProfiles(), SiPixelRawDataErrorModule::fillFED(), LaserAlignmentT0ProducerDQM::FillFromProcessedDigis(), LaserAlignmentT0ProducerDQM::FillFromRawDigis(), SiStripCommissioningSource::fillHistos(), sistrip::FEDEmulator::fillNoises(), sistrip::FEDEmulator::fillPeds(), GlobalDigisProducer::fillTrk(), GlobalDigisAnalyzer::fillTrk(), ClusterMultiplicityFilter::filter(), RPCHitAssociator::findRPCDigiSimLink(), SiStripZeroSuppression::formatRawDigis(), RawDataConverter::GetDigis(), sistrip::SpyUtilities::getMajorityHeader(), sistrip::SpyEventMatcher::mergeMatchingData(), sistrip::SpyDigiConverter::mergeModuleChannels(), ShallowClustersProducer::NearDigis::NearDigis(), RBCProcessRPCSimDigis::next(), SiStripProcessedRawDigiProducer::pr_process(), SiStripZeroSuppression::processRaw(), sistrip::FEDEmulatorModule::produce(), edm::DataMixingSiStripRawWorker::putSiStrip(), sistrip::SpyDigiConverter::reorderDigis(), cms::SiPixelClusterProducer::run(), SiStripMeanCMExtractor::StoreMean(), sistrip::FEDEmulator::subtractPedestals(), SiStripProcessedRawDigiProducer::vr_process(), and SiStripProcessedRawDigiProducer::zs_process().

356  {
357  _alreadySorted = false; // it's non const
358  return _sets.end();
359  }
collection_type _sets
Definition: DetSetVector.h:190
edm::BoolCache _alreadySorted
Definition: DetSetVector.h:191
template<class T >
DetSetVector< T >::const_iterator edm::DetSetVector< T >::end ( void  ) const
inline

Definition at line 364 of file DetSetVector.h.

Referenced by Types.LuminosityBlockRange::cppID(), and Types.EventRange::cppID().

364  {
365  return _sets.end();
366  }
collection_type _sets
Definition: DetSetVector.h:190
template<class T >
void edm::DetSetVector< T >::fillView ( ProductID const &  id,
std::vector< void const * > &  pointers,
helper_vector helpers 
) const

Definition at line 401 of file DetSetVector.h.

References edm::detail::reallyFillView().

404  {
405  detail::reallyFillView(*this, id, pointers, helpers);
406  }
void reallyFillView(COLLECTION const &coll, ProductID const &id, std::vector< void const * > &ptrs, helper_vector &helpers)
Definition: FillView.h:49
template<class T >
DetSetVector< T >::iterator edm::DetSetVector< T >::find ( det_id_type  id)
inline

Return an iterator to the DetSet with the given id, or end() if there is no such DetSet.

Definition at line 285 of file DetSetVector.h.

References errorMatrix2Lands_multiChannel::id, and AlCaHLTBitMon_ParallelJobs::p.

Referenced by BeautifulSoup.Tag::__getattr__(), MuonTruth::analyze(), SiStripSpyMonitorModule::analyze(), MuonTruth::associateCSCHitId(), MuonTruth::associateHitId(), SiPixelRawDataErrorModule::fill(), SiPixelDigiModule::fill(), SiStripCommissioningSource::fillCablingHistos(), SiPixelRawDataErrorModule::fillFED(), LaserAlignmentT0ProducerDQM::FillFromProcessedDigis(), LaserAlignmentT0ProducerDQM::FillFromRawDigis(), SiStripCommissioningSource::fillHistos(), BeautifulSoup.Tag::firstText(), sistrip::SpyEventMatcher::mergeMatchingData(), sistrip::SpyDigiConverter::mergeModuleChannels(), and ShallowClustersProducer::NearDigis::NearDigis().

285  {
286  _alreadySorted = false; // it's non const
287  std::pair<iterator,iterator> p =
288  std::equal_range(_sets.begin(), _sets.end(), id);
289  if (p.first == p.second) return _sets.end();
290 
291  // The range indicated by [p.first, p.second) should be exactly of
292  // length 1. It seems likely we don't want to take the time hit of
293  // checking this, but here is the appropriate test... We can turn
294  // it on if we need the debugging aid.
295  #if 0
296  assert(std::distance(p.first, p.second) == 1);
297  #endif
298 
299  return p.first;
300  }
collection_type _sets
Definition: DetSetVector.h:190
edm::BoolCache _alreadySorted
Definition: DetSetVector.h:191
template<class T >
DetSetVector< T >::const_iterator edm::DetSetVector< T >::find ( det_id_type  id) const
inline

Definition at line 305 of file DetSetVector.h.

References errorMatrix2Lands_multiChannel::id, and AlCaHLTBitMon_ParallelJobs::p.

Referenced by BeautifulSoup.Tag::__getattr__(), and BeautifulSoup.Tag::firstText().

305  {
306  std::pair<const_iterator,const_iterator> p =
307  std::equal_range(_sets.begin(), _sets.end(), id);
308  if (p.first == p.second) return _sets.end();
309  // The range indicated by [p.first, p.second) should be exactly of
310  // length 1.
311  assert(std::distance(p.first, p.second) == 1);
312  return p.first;
313  }
collection_type _sets
Definition: DetSetVector.h:190
template<class T >
DetSetVector< T >::reference edm::DetSetVector< T >::find_or_insert ( det_id_type  id)
inline

Find the DetSet with the given DetId, and return a reference to it. If there is none, create one with the right DetId, and an empty vector, and return a reference to the new one.

Definition at line 253 of file DetSetVector.h.

References errorMatrix2Lands_multiChannel::id, and AlCaHLTBitMon_ParallelJobs::p.

253  {
254  // NOTE: we don't have to clear _alreadySorted: the new DS is empty,
255  // and gets inserted in the correct place
256  std::pair<iterator,iterator> p =
257  std::equal_range(_sets.begin(), _sets.end(), id);
258 
259  // If the range isn't empty, we already have the right thing;
260  // return a reference to it...
261  if (p.first != p.second) return *p.first;
262 
263  // Insert the right thing, in the right place, and return a
264  // reference to the newly inserted thing.
265  return *(_sets.insert(p.first, detset(id)));
266  }
collection_type _sets
Definition: DetSetVector.h:190
DetSet< T > detset
Definition: DetSetVector.h:98
template<class T >
void edm::DetSetVector< T >::getIds ( std::vector< det_id_type > &  result) const
inline

Push all the id for each DetSet stored in this DetSetVector into the given vector 'result'.

Definition at line 372 of file DetSetVector.h.

References begin, end, and create_public_pileup_plots::transform.

373  {
374  std::transform(this->begin(), this->end(),
375  std::back_inserter(result),
376  boost::bind(&DetSet<T>::id,_1));
377  }
tuple result
Definition: query.py:137
iterator end()
Return the off-the-end iterator.
Definition: DetSetVector.h:356
iterator begin()
Return an iterator to the first DetSet.
Definition: DetSetVector.h:341
template<class T >
void edm::DetSetVector< T >::insert ( detset const &  s)
inline

Insert the given DetSet.

Definition at line 234 of file DetSetVector.h.

References lumiQTWidget::t.

Referenced by BeautifulSoup.PageElement::_invert(), edm::DataMixingSiStripWorker::addSiStripPileups(), edm::DataMixingSiStripWorker::addSiStripSignals(), SiStripProcessedRawDigiProducer::common_process(), RPCDigitizer::doAction(), CSCDigitizer::doAction(), and edm::DataMixingSiStripRawWorker::putSiStrip().

234  {
235  _alreadySorted = false; // we don't know if the DetSet we're adding is already sorted
236  // Implementation provided by the Performance Task Force.
237  _sets.insert(std::lower_bound(_sets.begin(),
238  _sets.end(),
239  t),
240  t);
241 #if 0
242  // It seems we have to sort on each insertion, because we may
243  // perform lookups during construction.
244  _sets.push_back(t);
245 
246  _sort();
247 #endif
248  }
collection_type _sets
Definition: DetSetVector.h:190
edm::BoolCache _alreadySorted
Definition: DetSetVector.h:191
void _sort()
Sort the DetSet in order of increasing DetId.
Definition: DetSetVector.h:396
template<class T>
DetSetVector< T > & edm::DetSetVector< T >::operator= ( DetSetVector< T > const &  other)
inline

Definition at line 224 of file DetSetVector.h.

References edm::swap(), and groupFilesInBlocks::temp.

225  {
226  DetSetVector<T> temp(other);
227  swap(temp);
228  return *this;
229  }
void swap(DetSetVector &other)
template<class T >
DetSetVector< T >::reference edm::DetSetVector< T >::operator[] ( det_id_type  i)
inline

Return a reference to the DetSet with the given detector ID. If there is no such DetSet, we throw an edm::Exception. DO NOT MODIFY THE id DATA MEMBER OF THE REFERENCED DetSet!

Definition at line 318 of file DetSetVector.h.

References edm::detail::_throw_range(), end, and spr::find().

318  {
319  _alreadySorted = false; // it's non const
320  // Find the right DetSet, and return a reference to it. Throw if
321  // there is none.
322  iterator it = this->find(i);
323  if (it == this->end()) detail::_throw_range(i);
324  return *it;
325  }
int i
Definition: DBlmapReader.cc:9
void _throw_range(det_id_type i)
Definition: DetSetVector.h:71
iterator find(det_id_type id)
Definition: DetSetVector.h:285
collection_type::iterator iterator
Definition: DetSetVector.h:105
iterator end()
Return the off-the-end iterator.
Definition: DetSetVector.h:356
edm::BoolCache _alreadySorted
Definition: DetSetVector.h:191
template<class T >
DetSetVector< T >::const_reference edm::DetSetVector< T >::operator[] ( det_id_type  i) const
inline

Definition at line 330 of file DetSetVector.h.

References edm::detail::_throw_range(), end, and spr::find().

330  {
331  // Find the right DetSet, and return a reference to it. Throw if
332  // there is none.
333  const_iterator it = this->find(i);
334  if (it == this->end()) detail::_throw_range(i);
335  return *it;
336  }
int i
Definition: DBlmapReader.cc:9
void _throw_range(det_id_type i)
Definition: DetSetVector.h:71
iterator find(det_id_type id)
Definition: DetSetVector.h:285
iterator end()
Return the off-the-end iterator.
Definition: DetSetVector.h:356
collection_type::const_iterator const_iterator
Definition: DetSetVector.h:106
template<class T >
void edm::DetSetVector< T >::post_insert ( )
inline

This function will be called by the edm::Event after the DetSetVector has been inserted into the Event.

Definition at line 382 of file DetSetVector.h.

References alignCSCRings::e, i, and python.multivaluedict::sort().

382  {
383  if (_alreadySorted) return;
384  typename collection_type::iterator i = _sets.begin();
385  typename collection_type::iterator e = _sets.end();
386  // For each DetSet...
387  for (; i != e; ++i) {
388  // sort the Detset pointed to by
389  std::sort(i->data.begin(), i->data.end());
390  }
391  }
collection_type _sets
Definition: DetSetVector.h:190
int i
Definition: DBlmapReader.cc:9
edm::BoolCache _alreadySorted
Definition: DetSetVector.h:191
template<class T >
DetSetVector< T >::size_type edm::DetSetVector< T >::size ( void  ) const
inline
template<class T>
void edm::DetSetVector< T >::swap ( DetSetVector< T > &  other)

Member Data Documentation

template<class T>
edm::BoolCache edm::DetSetVector< T >::_alreadySorted
private

Definition at line 191 of file DetSetVector.h.

template<class T>
collection_type edm::DetSetVector< T >::_sets
private

Definition at line 190 of file DetSetVector.h.

Referenced by edm::DetSetVector< T >::DetSetVector().