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, FillViewHelperVector &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 ()
 
void reserve (size_t s)
 
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 60 of file DetSetVector.h.

Member Typedef Documentation

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

Definition at line 98 of file DetSetVector.h.

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

Definition at line 104 of file DetSetVector.h.

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

Definition at line 101 of file DetSetVector.h.

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

Definition at line 96 of file DetSetVector.h.

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

Definition at line 103 of file DetSetVector.h.

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

Definition at line 100 of file DetSetVector.h.

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

Definition at line 105 of file DetSetVector.h.

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

Definition at line 97 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 201 of file DetSetVector.h.

201  :
202  _sets()
203  { }
collection_type _sets
Definition: DetSetVector.h:191
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 207 of file DetSetVector.h.

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

207  :
208  _sets(), _alreadySorted(alreadySorted)
209  {
210  _sets.swap(input);
211  if (!alreadySorted) _sort();
212  }
collection_type _sets
Definition: DetSetVector.h:191
static std::string const input
Definition: EdmProvDump.cc:44
edm::BoolCache _alreadySorted
Definition: DetSetVector.h:192
void _sort()
Sort the DetSet in order of increasing DetId.
Definition: DetSetVector.h:403

Member Function Documentation

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

Sort the DetSet in order of increasing DetId.

Definition at line 403 of file DetSetVector.h.

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

403  {
404  std::sort(_sets.begin(), _sets.end());
405  }
collection_type _sets
Definition: DetSetVector.h:191
template<class T >
DetSetVector< T >::iterator edm::DetSetVector< T >::begin ( void  )
inline

Return an iterator to the first DetSet.

Definition at line 346 of file DetSetVector.h.

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

346  {
347  _alreadySorted = false; // it's non const
348  return _sets.begin();
349  }
collection_type _sets
Definition: DetSetVector.h:191
edm::BoolCache _alreadySorted
Definition: DetSetVector.h:192
template<class T >
DetSetVector< T >::const_iterator edm::DetSetVector< T >::begin ( void  ) const
inline

Definition at line 354 of file DetSetVector.h.

354  {
355  return _sets.begin();
356  }
collection_type _sets
Definition: DetSetVector.h:191
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 188 of file DetSetVector.h.

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

Return true if we contain no DetSets.

Definition at line 276 of file DetSetVector.h.

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

276  {
277  return _sets.empty();
278  }
collection_type _sets
Definition: DetSetVector.h:191
template<class T >
DetSetVector< T >::iterator edm::DetSetVector< T >::end ( void  )
inline

Return the off-the-end iterator.

Definition at line 361 of file DetSetVector.h.

Referenced by edm::DataMixingSiPixelWorker::addSiPixelPileups(), edm::DataMixingSiPixelMCDigiWorker::addSiPixelPileups(), edm::DataMixingSiStripWorker::addSiStripPileups(), edm::DataMixingSiStripMCDigiWorker::addSiStripPileups(), SiStripQualityHotStripIdentifier::algoAnalyze(), SiPixelDigiValid::analyze(), SiStripDigiValid::analyze(), MuonTruth::analyze(), SiStripBaselineValidator::analyze(), SiPixelHLTSource::analyze(), SiStripSpyMonitorModule::analyze(), SiStripBaselineAnalyzer::analyze(), CSCHitAssociator::associateCSCHitId(), CSCHitAssociator::associateHitId(), GEMHitAssociator::associateRecHit(), CTPPSDiamondRecHitProducerAlgorithm::build(), 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(), SiPixelCalibDigiProducer::fill(), SiPixelDigiModule::fill(), SiStripCommissioningSource::fillCablingHistos(), LaserAlignment::fillDataProfiles(), SiPixelRawDataErrorModule::fillFED(), LaserAlignmentT0ProducerDQM::FillFromProcessedDigis(), LaserAlignmentT0ProducerDQM::FillFromRawDigis(), SiStripCommissioningSource::fillHistos(), sistrip::FEDEmulator::fillNoises(), sistrip::FEDEmulator::fillPeds(), GlobalDigisProducer::fillTrk(), GlobalDigisAnalyzer::fillTrk(), RPCHitAssociator::findRPCDigiSimLink(), SiStripZeroSuppression::formatRawDigis(), RawDataConverter::GetDigis(), sistrip::SpyUtilities::getMajorityHeader(), SiPixelTrackResidualSource::getrococcupancy(), SiPixelClusterSource::getrococcupancy(), 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(), SiPixelClusterProducer::run(), SiStripMeanCMExtractor::StoreMean(), sistrip::FEDEmulator::subtractPedestals(), SiStripProcessedRawDigiProducer::vr_process(), and SiStripProcessedRawDigiProducer::zs_process().

361  {
362  _alreadySorted = false; // it's non const
363  return _sets.end();
364  }
collection_type _sets
Definition: DetSetVector.h:191
edm::BoolCache _alreadySorted
Definition: DetSetVector.h:192
template<class T >
DetSetVector< T >::const_iterator edm::DetSetVector< T >::end ( void  ) const
inline

Definition at line 369 of file DetSetVector.h.

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

369  {
370  return _sets.end();
371  }
collection_type _sets
Definition: DetSetVector.h:191
template<class T >
void edm::DetSetVector< T >::fillView ( ProductID const &  id,
std::vector< void const * > &  pointers,
FillViewHelperVector helpers 
) const

Definition at line 408 of file DetSetVector.h.

References edm::detail::reallyFillView().

411  {
412  detail::reallyFillView(*this, id, pointers, helpers);
413  }
void reallyFillView(COLLECTION const &coll, ProductID const &id, std::vector< void const * > &ptrs, FillViewHelperVector &helpers)
Definition: FillView.h:27
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 290 of file DetSetVector.h.

References assert(), HLT_25ns10e33_v2_cff::distance, and AlCaHLTBitMon_ParallelJobs::p.

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

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

Definition at line 310 of file DetSetVector.h.

References assert(), HLT_25ns10e33_v2_cff::distance, and AlCaHLTBitMon_ParallelJobs::p.

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

310  {
311  std::pair<const_iterator,const_iterator> p =
312  std::equal_range(_sets.begin(), _sets.end(), id);
313  if (p.first == p.second) return _sets.end();
314  // The range indicated by [p.first, p.second) should be exactly of
315  // length 1.
316  assert(std::distance(p.first, p.second) == 1);
317  return p.first;
318  }
collection_type _sets
Definition: DetSetVector.h:191
assert(m_qm.get())
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 254 of file DetSetVector.h.

References AlCaHLTBitMon_ParallelJobs::p.

Referenced by TotemRPUVPattern::addHit(), CTPPSDiamondRecHitProducerAlgorithm::build(), PixelDataFormatter::interpretRawData(), TotemRPRecHitProducer::produce(), TotemRPLocalTrackFitter::produce(), TotemRPUVPatternFinder::produce(), RawToDigiConverter::Run(), and TotemRPClusterProducer::run().

254  {
255  // NOTE: we don't have to clear _alreadySorted: the new DS is empty,
256  // and gets inserted in the correct place
257  std::pair<iterator,iterator> p =
258  std::equal_range(_sets.begin(), _sets.end(), id);
259 
260  // If the range isn't empty, we already have the right thing;
261  // return a reference to it...
262  if (p.first != p.second) return *p.first;
263 
264  // Insert the right thing, in the right place, and return a
265  // reference to the newly inserted thing.
266 #if defined( __GXX_EXPERIMENTAL_CXX0X__)
267  return *(_sets.emplace(p.first, id));
268 #else
269  return *(_sets.insert(p.first, detset(id)));
270 #endif
271  }
collection_type _sets
Definition: DetSetVector.h:191
DetSet< T > detset
Definition: DetSetVector.h:96
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 377 of file DetSetVector.h.

References begin, end, and create_public_lumi_plots::transform.

378  {
379  std::transform(this->begin(), this->end(),
380  std::back_inserter(result),
381  std::bind(&DetSet<T>::id,std::placeholders::_1));
382  }
tuple result
Definition: mps_fire.py:84
iterator end()
Return the off-the-end iterator.
Definition: DetSetVector.h:361
iterator begin()
Return an iterator to the first DetSet.
Definition: DetSetVector.h:346
template<class T >
void edm::DetSetVector< T >::insert ( detset const &  s)
inline

Insert the given DetSet.

Definition at line 235 of file DetSetVector.h.

References lumiQTWidget::t.

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

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

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

323  {
324  _alreadySorted = false; // it's non const
325  // Find the right DetSet, and return a reference to it. Throw if
326  // there is none.
327  iterator it = this->find(i);
328  if (it == this->end()) detail::_throw_range(i);
329  return *it;
330  }
int i
Definition: DBlmapReader.cc:9
void _throw_range(det_id_type i)
Definition: DetSetVector.h:69
iterator find(det_id_type id)
Definition: DetSetVector.h:290
collection_type::iterator iterator
Definition: DetSetVector.h:103
iterator end()
Return the off-the-end iterator.
Definition: DetSetVector.h:361
edm::BoolCache _alreadySorted
Definition: DetSetVector.h:192
template<class T >
DetSetVector< T >::const_reference edm::DetSetVector< T >::operator[] ( det_id_type  i) const
inline

Definition at line 335 of file DetSetVector.h.

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

335  {
336  // Find the right DetSet, and return a reference to it. Throw if
337  // there is none.
338  const_iterator it = this->find(i);
339  if (it == this->end()) detail::_throw_range(i);
340  return *it;
341  }
int i
Definition: DBlmapReader.cc:9
void _throw_range(det_id_type i)
Definition: DetSetVector.h:69
iterator find(det_id_type id)
Definition: DetSetVector.h:290
iterator end()
Return the off-the-end iterator.
Definition: DetSetVector.h:361
collection_type::const_iterator const_iterator
Definition: DetSetVector.h:104
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 387 of file DetSetVector.h.

References alignCSCRings::e, and i.

387  {
388  _sets.shrink_to_fit();
389  if (_alreadySorted) return;
390  typename collection_type::iterator i = _sets.begin();
391  typename collection_type::iterator e = _sets.end();
392  // For each DetSet...
393  for (; i != e; ++i) {
394  i->data.shrink_to_fit();
395  // sort the Detset pointed to by
396  std::sort(i->data.begin(), i->data.end());
397  }
398  }
collection_type _sets
Definition: DetSetVector.h:191
int i
Definition: DBlmapReader.cc:9
edm::BoolCache _alreadySorted
Definition: DetSetVector.h:192
template<class T>
void edm::DetSetVector< T >::reserve ( size_t  s)
inline
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 192 of file DetSetVector.h.

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