CaloRecHitMetaCollection Class Reference

#include <CaloRecHitMetaCollection.h>

Inheritance diagram for CaloRecHitMetaCollection:

Public Types
typedef CaloRecHitMetaCollectionV::Iterator	const_iterator
Public Types inherited from CaloRecHitMetaCollectionV
typedef Iterator	const_iterator

Public Member Functions
void	add (const HBHERecHitCollection *hbhe)
void	add (const HORecHitCollection *ho)
void	add (const HFRecHitCollection *hf)
void	add (const EcalRecHitCollection *ecal)
virtual const CaloRecHit *	at (const_iterator::offset_type i) const
	get an item by index More...
virtual const_iterator	find (const DetId &id) const
	find by id (default version is very slow unsorted find) More...
virtual	~CaloRecHitMetaCollection ()
Public Member Functions inherited from CaloRecHitMetaCollectionV
const_iterator	begin () const
	get the starting iterator More...
const_iterator	end () const
	get the ending iterator More...
unsigned int	size () const
	get the size of the collection More...
virtual	~CaloRecHitMetaCollectionV ()

Private Member Functions
int	findIndex (const DetId &id) const

Private Attributes
std::multimap< int, CaloRecHitMetaCollectionItem * >	m_findTool
std::map< int, CaloRecHitMetaCollectionItem * >	m_items

Additional Inherited Members
Protected Member Functions inherited from CaloRecHitMetaCollectionV
	CaloRecHitMetaCollectionV ()
Protected Attributes inherited from CaloRecHitMetaCollectionV
unsigned int	size_

Detailed Description

Date:

2006/01/17 19:51:48

Revision:

1.2

Author

J. Mans - Minnesota

Definition at line 17 of file CaloRecHitMetaCollection.h.

Member Typedef Documentation

typedef CaloRecHitMetaCollectionV::Iterator CaloRecHitMetaCollection::const_iterator

Definition at line 19 of file CaloRecHitMetaCollection.h.

Constructor & Destructor Documentation

CaloRecHitMetaCollection::~CaloRecHitMetaCollection ( )

virtual

Definition at line 49 of file CaloRecHitMetaCollection.cc.

References i, and m_items.

                                                    {
  for (std::map<int, CaloRecHitMetaCollectionItem*>::iterator i=m_items.begin(); i!=m_items.end(); i++)
    delete i->second;
}

Member Function Documentation

void CaloRecHitMetaCollection::add

(

const HBHERecHitCollection *

hbhe

)

Definition at line 55 of file CaloRecHitMetaCollection.cc.

References findIndex(), DetId::Hcal, HcalBarrel, HcalEndcap, i, m_findTool, m_items, edm::SortedCollection< T, SORT >::size(), and CaloRecHitMetaCollectionV::size_.

Referenced by HoECalculator::getHoE().

                                                                   {
  if (hbhe->size()==0) return; // do not add empty collections (can cause problems)
  CaloRecHitMetaCollectionItem* i=new CaloRecHitMetaCollectionItemT<HBHERecHitCollection>(hbhe,size_);
  size_+=hbhe->size();
  m_items.insert(std::pair<int,CaloRecHitMetaCollectionItem*>(size_-1,i));
  m_findTool.insert(std::pair<int,CaloRecHitMetaCollectionItem*>(findIndex(DetId(DetId::Hcal,HcalBarrel)),i));
  m_findTool.insert(std::pair<int,CaloRecHitMetaCollectionItem*>(findIndex(DetId(DetId::Hcal,HcalEndcap)),i));
}

void CaloRecHitMetaCollection::add

(

const HORecHitCollection *

ho

)

Definition at line 64 of file CaloRecHitMetaCollection.cc.

References findIndex(), DetId::Hcal, HcalOuter, i, m_findTool, m_items, edm::SortedCollection< T, SORT >::size(), and CaloRecHitMetaCollectionV::size_.

                                                               {
  if (ho->size()==0) return; // do not add empty collections (can cause problems)
  CaloRecHitMetaCollectionItem* i=new CaloRecHitMetaCollectionItemT<HORecHitCollection>(ho,size_);
  size_+=ho->size();
  m_items.insert(std::pair<int,CaloRecHitMetaCollectionItem*>(size_-1,i));
  m_findTool.insert(std::pair<int,CaloRecHitMetaCollectionItem*>(findIndex(DetId(DetId::Hcal,HcalOuter)),i));
}

void CaloRecHitMetaCollection::add

(

const HFRecHitCollection *

hf

)

Definition at line 72 of file CaloRecHitMetaCollection.cc.

References findIndex(), DetId::Hcal, HcalForward, i, m_findTool, m_items, edm::SortedCollection< T, SORT >::size(), and CaloRecHitMetaCollectionV::size_.

                                                               {
  if (hf->size()==0) return; // do not add empty collections (can cause problems)
  CaloRecHitMetaCollectionItem* i=new CaloRecHitMetaCollectionItemT<HFRecHitCollection>(hf,size_);
  size_+=hf->size();
  m_items.insert(std::pair<int,CaloRecHitMetaCollectionItem*>(size_-1,i));
  m_findTool.insert(std::pair<int,CaloRecHitMetaCollectionItem*>(findIndex(DetId(DetId::Hcal,HcalForward)),i));
}

void CaloRecHitMetaCollection::add

(

const EcalRecHitCollection *

ecal

)

Definition at line 81 of file CaloRecHitMetaCollection.cc.

References DetId::Ecal, patCandidatesForDimuonsSequences_cff::ecal, EcalBarrel, EcalEndcap, findIndex(), i, m_findTool, m_items, edm::SortedCollection< T, SORT >::size(), and CaloRecHitMetaCollectionV::size_.

                                                                   {
  if (ecal->size()==0) return; // do not add empty collections (can cause problems)
  CaloRecHitMetaCollectionItem* i=new CaloRecHitMetaCollectionItemT<EcalRecHitCollection>(ecal,size_);
  size_+=ecal->size();
  m_items.insert(std::pair<int,CaloRecHitMetaCollectionItem*>(size_-1,i));
  m_findTool.insert(std::pair<int,CaloRecHitMetaCollectionItem*>(findIndex(DetId(DetId::Ecal,EcalBarrel)),i));
  m_findTool.insert(std::pair<int,CaloRecHitMetaCollectionItem*>(findIndex(DetId(DetId::Ecal,EcalEndcap)),i));
}

const CaloRecHit * CaloRecHitMetaCollection::at ( const_iterator::offset_type  i ) const

virtual

get an item by index

Implements CaloRecHitMetaCollectionV.

Definition at line 44 of file CaloRecHitMetaCollection.cc.

References m_items, and lumiQueryAPI::q.

                                                                                {
  std::map<int, CaloRecHitMetaCollectionItem*>::const_iterator q=m_items.lower_bound(i);
  return (q==m_items.end())?(0):(q->second->at(i));
}

CaloRecHitMetaCollection::const_iterator CaloRecHitMetaCollection::find ( const DetId &  id ) const

virtual

find by id (default version is very slow unsorted find)

Reimplemented from CaloRecHitMetaCollectionV.

Definition at line 34 of file CaloRecHitMetaCollection.cc.

References CaloRecHitMetaCollectionV::end(), findIndex(), i, m_findTool, AlCaHLTBitMon_ParallelJobs::options, and pos.

Referenced by BeautifulSoup.Tag::_invert(), HoECalculator::getHoE(), and BeautifulSoup.PageElement::insert().

                                                                                           {
  std::pair<find_iterator,find_iterator> options=m_findTool.equal_range(findIndex(id));
  int pos=-1;
  for (find_iterator i=options.first; i!=options.second; i++) {
    pos=i->second->find(id);
    if (pos>=0) break;
  }
  return (pos<0)?(end()):(const_iterator(this,pos));
}

int CaloRecHitMetaCollection::findIndex ( const DetId &  id ) const

private

Definition at line 30 of file CaloRecHitMetaCollection.cc.

Referenced by add(), and find().

                                                             {
  return id.rawId()>>25;
}

Member Data Documentation

std::multimap<int, CaloRecHitMetaCollectionItem*> CaloRecHitMetaCollection::m_findTool

private

Definition at line 32 of file CaloRecHitMetaCollection.h.

Referenced by add(), and find().

std::map<int,CaloRecHitMetaCollectionItem*> CaloRecHitMetaCollection::m_items

private

Definition at line 31 of file CaloRecHitMetaCollection.h.

Referenced by add(), at(), and ~CaloRecHitMetaCollection().