LPhiSector Struct Reference

#include <TrigTrackSeedGenerator.h>

Collaboration diagram for LPhiSector:

Classes
struct	compareZ
struct	compareR
struct	compareRless
struct	greaterThanZ
struct	smallerThanZ
struct	greaterThanR
struct	greaterThanR_i
struct	smallerThanR
struct	smallerThanR_i

Public Member Functions
	LPhiSector (int nPhiSlices)
	LPhiSector (const LPhiSector &ps)
const LPhiSector &	operator= (const LPhiSector &ps)
void	reset ()
void	addSpacePoint (int phiIndex, const INDEXED_SP *p)
void	sortSpacePoints (bool isBarrel)
void	sortSpacePoints (bool isBarrel, bool isPositive)
int	size () const

Public Attributes
int	m_nSP
std::vector< std::vector< const INDEXED_SP * > >	m_phiSlices
std::vector< std::vector< const INDEXED_SP * > >	m_phiThreeSlices
std::vector< int >	m_threeIndices [3]

Private Member Functions
	LPhiSector ()

Detailed Description

Definition at line 32 of file TrigTrackSeedGenerator.h.

Constructor & Destructor Documentation

LPhiSector() [1/3]

LPhiSector::LPhiSector ( int nPhiSlices )

inline

Definition at line 91 of file TrigTrackSeedGenerator.h.

                           : m_nSP(0) {
  std::vector<const INDEXED_SP*> d;
  m_phiSlices.resize(nPhiSlices, d);
  m_phiThreeSlices.resize(nPhiSlices, d);
  if(nPhiSlices == 1) {//special case
    m_threeIndices[1].push_back(0);
    m_threeIndices[0].push_back(-1);
    m_threeIndices[2].push_back(-1);
  }
  if(nPhiSlices == 2) {//special case
    m_threeIndices[1].push_back(0);
    m_threeIndices[0].push_back(-1);
    m_threeIndices[2].push_back(1);
    m_threeIndices[1].push_back(1);
    m_threeIndices[0].push_back(0);
    m_threeIndices[2].push_back(-1);
  }
  if(nPhiSlices > 2) {
    for(int phiIdx=0;phiIdx<nPhiSlices;phiIdx++) {
      m_threeIndices[1].push_back(phiIdx);
      if(phiIdx>0) m_threeIndices[0].push_back(phiIdx-1);
      else m_threeIndices[0].push_back(nPhiSlices-1);
      if(phiIdx<nPhiSlices-1) m_threeIndices[2].push_back(phiIdx+1);
      else m_threeIndices[2].push_back(0);
    }
  }
}

LPhiSector() [2/3]

LPhiSector::LPhiSector ( const LPhiSector & ps )

inline

Definition at line 119 of file TrigTrackSeedGenerator.h.

                                 : m_nSP(ps.m_nSP), m_phiSlices(ps.m_phiSlices), m_phiThreeSlices(ps.m_phiThreeSlices) {
  for(int i=0;i<3;i++) {
    m_threeIndices[i] = ps.m_threeIndices[i];
  }
}

LPhiSector() [3/3]

LPhiSector::LPhiSector ( )

inlineprivate

Definition at line 194 of file TrigTrackSeedGenerator.h.

{};

Member Function Documentation

addSpacePoint()

void LPhiSector::addSpacePoint ( int phiIndex, const INDEXED_SP * p )

inline

Definition at line 145 of file TrigTrackSeedGenerator.h.

                                                        {
    m_nSP++;
    m_phiSlices[phiIndex].push_back(p);
    for(int i=0;i<3;i++) {
      if(m_threeIndices[i][phiIndex]==-1) continue;//to account for special cases nPhiSlices=1,2
      m_phiThreeSlices[m_threeIndices[i][phiIndex]].push_back(p);
    }
  }

operator=()

const LPhiSector & LPhiSector::operator= ( const LPhiSector & ps )

inline

Definition at line 125 of file TrigTrackSeedGenerator.h.

                                                    {
    m_nSP = ps.m_nSP;
    m_phiSlices = ps.m_phiSlices;
    m_phiThreeSlices = ps.m_phiThreeSlices;
    for(int i=0;i<3;i++) {
      m_threeIndices[i] = ps.m_threeIndices[i];
    }
    return *this;
  }

reset()

void LPhiSector::reset ( )

inline

Definition at line 135 of file TrigTrackSeedGenerator.h.

               {
    for(std::vector<std::vector<const INDEXED_SP*> >::iterator it = m_phiSlices.begin();it!=m_phiSlices.end();++it) {
      (*it).clear();
    }
    for(std::vector<std::vector<const INDEXED_SP*> >::iterator it = m_phiThreeSlices.begin();it!=m_phiThreeSlices.end();++it) {
      (*it).clear();
    }
    m_nSP = 0;
  }

size()

int LPhiSector::size ( ) const

inline

Definition at line 186 of file TrigTrackSeedGenerator.h.

{ return m_nSP; }

sortSpacePoints() [1/2]

void LPhiSector::sortSpacePoints ( bool isBarrel )

inline

Definition at line 154 of file TrigTrackSeedGenerator.h.

                                      {
    for(std::vector<std::vector<const INDEXED_SP*> >::iterator it=m_phiSlices.begin();it!=m_phiSlices.end();++it) {
      if((*it).empty()) continue;
      if(isBarrel) std::sort(it->begin(), it->end(), compareZ());
      else std::sort(it->begin(), it->end(), compareR());
    }
    for(std::vector<std::vector<const INDEXED_SP*> >::iterator it=m_phiThreeSlices.begin();it!=m_phiThreeSlices.end();++it) {
      if((*it).empty()) continue;
      if(isBarrel) std::sort(it->begin(), it->end(), compareZ());
      else std::sort(it->begin(), it->end(), compareR());
    }
  }

sortSpacePoints() [2/2]

void LPhiSector::sortSpacePoints ( bool isBarrel, bool isPositive )

inline

Definition at line 167 of file TrigTrackSeedGenerator.h.

                                                       {
    for(std::vector<std::vector<const INDEXED_SP*> >::iterator it=m_phiSlices.begin();it!=m_phiSlices.end();++it) {
      if((*it).empty()) continue;
      if(isBarrel) std::sort(it->begin(), it->end(), compareZ());
      else {
    if(isPositive) std::sort(it->begin(), it->end(), compareRless());
    else std::sort(it->begin(), it->end(), compareR());
      }
    }
    for(std::vector<std::vector<const INDEXED_SP*> >::iterator it=m_phiThreeSlices.begin();it!=m_phiThreeSlices.end();++it) {
      if((*it).empty()) continue;
      if(isBarrel) std::sort(it->begin(), it->end(), compareZ());
      else {
    if(isPositive) std::sort(it->begin(), it->end(), compareRless());
    else std::sort(it->begin(), it->end(), compareR());
      }
    }
  }

Member Data Documentation

m_nSP

int LPhiSector::m_nSP

Definition at line 188 of file TrigTrackSeedGenerator.h.

m_phiSlices

std::vector<std::vector<const INDEXED_SP*> > LPhiSector::m_phiSlices

Definition at line 189 of file TrigTrackSeedGenerator.h.

m_phiThreeSlices

std::vector<std::vector<const INDEXED_SP*> > LPhiSector::m_phiThreeSlices

Definition at line 190 of file TrigTrackSeedGenerator.h.

m_threeIndices

std::vector<int> LPhiSector::m_threeIndices[3]

Definition at line 191 of file TrigTrackSeedGenerator.h.

---

The documentation for this struct was generated from the following file:

• TrigTrackSeedGenerator.h