edm::DetSetRefVector< T, C > Class Template Reference

#include <DetSetRefVector.h>

Public Types
typedef std::vector< ref_type >	collection_type
typedef boost::indirect_iterator< typename collection_type::const_iterator >	const_iterator
typedef detset const &	const_reference
typedef DetSet< T >	detset
typedef Ref< C, DetSet< T >, refhelper::FindDetSetForDetSetVector< T, C > >	ref_type
typedef collection_type::size_type	size_type
typedef detset	value_type

Public Member Functions
const_iterator	begin () const
	Return an iterator to the first DetSet. More...
	DetSetRefVector ()
	DetSetRefVector (const Handle< C > &iHandle, const std::vector< det_id_type > &iDets)
	DetSetRefVector (const OrphanHandle< C > &iHandle, const std::vector< det_id_type > &iDets)
	DetSetRefVector (const TestHandle< C > &iHandle, const std::vector< det_id_type > &iDets)
bool	empty () const
	Return true if we contain no DetSets. More...
const_iterator	end () const
	Return the off-the-end iterator. More...
const_iterator	find (det_id_type id) const
DetSetRefVector &	operator= (DetSetRefVector const &rhs)
const_reference	operator[] (det_id_type i) const
size_type	size () const
	Return the number of contained DetSets. More...
void	swap (DetSetRefVector &other)

Static Public Member Functions
static short	Class_Version ()

Private Member Functions
	BOOST_CLASS_REQUIRE (T, boost, LessThanComparableConcept)

Private Attributes
collection_type	sets_

Detailed Description

template<typename T, typename C = DetSetVector<T>>
class edm::DetSetRefVector< T, C >

Definition at line 49 of file DetSetRefVector.h.

Member Typedef Documentation

template<typename T, typename C = DetSetVector<T>>

typedef std::vector<ref_type> edm::DetSetRefVector< T, C >::collection_type

Definition at line 105 of file DetSetRefVector.h.

template<typename T, typename C = DetSetVector<T>>

typedef boost::indirect_iterator<typename collection_type::const_iterator> edm::DetSetRefVector< T, C >::const_iterator

Definition at line 110 of file DetSetRefVector.h.

template<typename T, typename C = DetSetVector<T>>

typedef detset const& edm::DetSetRefVector< T, C >::const_reference

Definition at line 107 of file DetSetRefVector.h.

template<typename T, typename C = DetSetVector<T>>

typedef DetSet<T> edm::DetSetRefVector< T, C >::detset

Definition at line 102 of file DetSetRefVector.h.

template<typename T, typename C = DetSetVector<T>>

typedef Ref<C, DetSet<T>, refhelper::FindDetSetForDetSetVector<T,C> > edm::DetSetRefVector< T, C >::ref_type

Definition at line 104 of file DetSetRefVector.h.

template<typename T, typename C = DetSetVector<T>>

typedef collection_type::size_type edm::DetSetRefVector< T, C >::size_type

Definition at line 111 of file DetSetRefVector.h.

template<typename T, typename C = DetSetVector<T>>

typedef detset edm::DetSetRefVector< T, C >::value_type

Definition at line 103 of file DetSetRefVector.h.

Constructor & Destructor Documentation

template<typename T, typename C = DetSetVector<T>>

edm::DetSetRefVector< T, C >::DetSetRefVector ( )

inline

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

Definition at line 120 of file DetSetRefVector.h.

{}

template<typename T, typename C = DetSetVector<T>>

edm::DetSetRefVector< T, C >::DetSetRefVector ( const Handle< C > &  iHandle, const std::vector< det_id_type > &  iDets  )

inline

Definition at line 122 of file DetSetRefVector.h.

                                                                                     : sets_() {
        sets_.reserve(iDets.size());
        det_id_type sanityCheck = 0;
        for(std::vector<det_id_type>::const_iterator itDetId = iDets.begin(),
            itDetIdEnd = iDets.end();
            itDetId != itDetIdEnd;
            ++itDetId) {
          assert(sanityCheck <= *itDetId && "vector of det_id_type was not ordered");
          sanityCheck = *itDetId;
          //the last 'false' says to not get the data right now
          sets_.push_back(ref_type(iHandle, *itDetId, false));
        }
      }

template<typename T, typename C = DetSetVector<T>>

edm::DetSetRefVector< T, C >::DetSetRefVector ( const OrphanHandle< C > &  iHandle, const std::vector< det_id_type > &  iDets  )

inline

Definition at line 136 of file DetSetRefVector.h.

                                                                                           : sets_() {
        sets_.reserve(iDets.size());
        det_id_type sanityCheck = 0;
        for(std::vector<det_id_type>::const_iterator itDetId = iDets.begin(),
            itDetIdEnd = iDets.end();
            itDetId != itDetIdEnd;
            ++itDetId) {
          assert(sanityCheck <= *itDetId && "vector of det_id_type was not ordered");
          sanityCheck = *itDetId;
          //the last 'false' says to not get the data right now
          sets_.push_back(ref_type(iHandle, *itDetId, false));
        }
      }

template<typename T, typename C = DetSetVector<T>>

edm::DetSetRefVector< T, C >::DetSetRefVector ( const TestHandle< C > &  iHandle, const std::vector< det_id_type > &  iDets  )

inline

Definition at line 150 of file DetSetRefVector.h.

                                                                                         : sets_() {
        sets_.reserve(iDets.size());
        det_id_type sanityCheck = 0;
        for(std::vector<det_id_type>::const_iterator itDetId = iDets.begin(),
            itDetIdEnd = iDets.end();
            itDetId != itDetIdEnd;
            ++itDetId) {
          assert(sanityCheck <= *itDetId && "vector of det_id_type was not ordered");
          sanityCheck = *itDetId;
          //the last 'false' says to not get the data right now
          sets_.push_back(ref_type(iHandle, *itDetId, false));
        }
      }

Member Function Documentation

template<typename T , typename C >

DetSetRefVector< T, C >::const_iterator edm::DetSetRefVector< T, C >::begin ( void  ) const

inline

Return an iterator to the first DetSet.

Definition at line 269 of file DetSetRefVector.h.

  {
    return sets_.begin();
  }

template<typename T, typename C = DetSetVector<T>>

edm::DetSetRefVector< T, C >::BOOST_CLASS_REQUIRE ( T  , boost  , LessThanComparableConcept    )

private

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

template<typename T, typename C = DetSetVector<T>>

static short edm::DetSetRefVector< T, C >::Class_Version ( )

inlinestatic

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

Definition at line 198 of file DetSetRefVector.h.

:
    collection_type   sets_;

template<typename T , typename C >

bool edm::DetSetRefVector< T, C >::empty ( ) const

inline

Return true if we contain no DetSets.

Definition at line 224 of file DetSetRefVector.h.

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

  {
    return sets_.empty();
  }

template<typename T , typename C >

DetSetRefVector< T, C >::const_iterator edm::DetSetRefVector< T, C >::end ( void  ) const

inline

Return the off-the-end iterator.

Definition at line 277 of file DetSetRefVector.h.

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

  {
    return sets_.end();
  }

template<typename T , typename C >

DetSetRefVector< T, C >::const_iterator edm::DetSetRefVector< T, C >::find ( det_id_type  id ) const

inline

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

Definition at line 240 of file DetSetRefVector.h.

References SoftLeptonByDistance_cfi::distance, relativeConstraints::empty, triggerObjects_cff::id, and AlCaHLTBitMon_ParallelJobs::p.

Referenced by BeautifulSoup.Tag::__getattr__(), BeautifulSoup.Tag::firstText(), and edm::refhelper::FindForDetSetRefVector< T, C >::operator()().

  {
    if(empty()) {
      return sets_.end();
    }
    std::pair<typename collection_type::const_iterator,typename collection_type::const_iterator> p = 
    std::equal_range(sets_.begin(), sets_.end(), id, CompareRefDetSet<T,C>());
    if (p.first == p.second) return sets_.end();
    // The range indicated by [p.first, p.second) should be exactly of
    // length 1.
    assert(std::distance(p.first, p.second) == 1);
    return p.first;
  }

template<typename T, typename C = DetSetVector<T>>

DetSetRefVector< T,C > & edm::DetSetRefVector< T, C >::operator= ( DetSetRefVector< T, C > const &  rhs )

inline

Definition at line 215 of file DetSetRefVector.h.

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

                                                                  {
    DetSetRefVector<T, C> temp(rhs);
    this->swap(temp);
    return *this;
  }

template<typename T , typename C >

DetSetRefVector< T, C >::const_reference edm::DetSetRefVector< T, C >::operator[] ( det_id_type  i ) const

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 257 of file DetSetRefVector.h.

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

  {
    // Find the right DetSet, and return a reference to it.  Throw if
    // there is none.
    const_iterator it = this->find(i);
    if (it == this->end()) dsrvdetail::_throw_range(i);
    return *it;
  }

template<typename T , typename C >

DetSetRefVector< T, C >::size_type edm::DetSetRefVector< T, C >::size ( void  ) const

inline

Return the number of contained DetSets.

Definition at line 232 of file DetSetRefVector.h.

Referenced by ntupleDataFormat._Collection::__iter__(), and ntupleDataFormat._Collection::__len__().

  {
    return sets_.size();
  }

template<typename T, typename C = DetSetVector<T>>

void edm::DetSetRefVector< T, C >::swap ( DetSetRefVector< T, C > &  other )

inline

Definition at line 208 of file DetSetRefVector.h.

Referenced by edm::swap().

                                                        {
    sets_.swap(other.sets_);
  }

Member Data Documentation

template<typename T, typename C = DetSetVector<T>>

collection_type edm::DetSetRefVector< T, C >::sets_

private

Definition at line 201 of file DetSetRefVector.h.