MdcSegList Class Reference

#include <MdcSegList.h>

Public Member Functions
	MdcSegList (int nSupers, const MdcSegParams segParms)
	~MdcSegList ()
void	setPlot (int lPlt)
void	plot () const
const GmsList *	oneList (int slayIndex) const
void	append (MdcSeg *aSeg)
int	count () const
void	destroySegs ()
MdcSeg *	getSeed (int iview, int goodOnly)
void	resetSeed (const MdcDetector *gm)
MdcSegParams *	segPar ()

Friends
class	MdcSegFinder

Detailed Description

Definition at line 20 of file MdcSegList.h.

Constructor & Destructor Documentation

MdcSegList()

MdcSegList::MdcSegList	(	int	nSupers,
		const MdcSegParams	segParms
	)

Definition at line 35 of file MdcSegList.cxx.

                                                           {
/**************************************************************************/
    segParam = segP;  // bit-wise copy
    MdcSeg::setParam(&segParam);
    zeroSeed();
    segList = new GmsList[nSlayer];
    _nsupers = nSlayer;
}

~MdcSegList()

MdcSegList::~MdcSegList

(

)

Definition at line 45 of file MdcSegList.cxx.

                        { 
/**************************************************************************/
delete [] segList; 
}

Member Function Documentation

append()

void MdcSegList::append

(

MdcSeg *

aSeg

)

Definition at line 257 of file MdcSegList.cxx.

                                    {
  /****************************************************************************/
  segList[aSeg->superlayer()->index()].append(aSeg); 
}

count()

int MdcSegList::count

(

)

const

Definition at line 419 of file MdcSegList.cxx.

                        { 
  //-------------------------------------------------------------------------
  int cnt = 0;
  for (int i = 0; i < _nsupers; i++) cnt += segList[i].count();
  return cnt;
}

Referenced by count(), MdcTrackList::createFromSegs(), and MdcSegFinder::createSegs().

destroySegs()

void MdcSegList::destroySegs

(

)

Definition at line 92 of file MdcSegList.cxx.

                             {
  /****************************************************************************/
 
  zeroSeed();
  MdcSeg *aSeg, *bSeg;
  for (int i = 0; i < _nsupers; i++) {
    aSeg = (MdcSeg *) segList[i].first();
    while (aSeg != 0) {
      bSeg = (MdcSeg *) aSeg->next();
      segList[i].remove( aSeg );
      delete aSeg ;
      aSeg = bSeg;
    }
  }
  return;
}

getSeed()

MdcSeg * MdcSegList::getSeed	(	int	iview,
		int	goodOnly
	)

Definition at line 139 of file MdcSegList.cxx.

                                                     {
  //***************************************************************************
 
  // Find a suitable segment for starting a track.  If goodOnly=1, look for 
  //  isolated, unambiguous segments; unambiguous is 
  //  defined as being the only segment within a band in phiseg (typically 
  //  2 cell widths wide), or as differing only slightly from nearby 
  //  segments in phi and slope.  When these have been exhausted, take any 
  //  unused segment.  Return pointer to seed seg, or 0 if none found. 
 
  int viewIndex = iview + 1;
  if (seedSlay[viewIndex] == 0) return 0;
  while (1) {
    //if(seedSeg[viewIndex] != 0){
      //seedSeg[viewIndex]->plotSeg(0,0);//yzhang debug
      //std::cout<<__FILE__<<" "<<__LINE__<<" goodOnly "<<goodOnly<<  std::endl;
    //}
    if (seedSeg[viewIndex] == 0) {
      //seedSlay[viewIndex] = seedSlay[viewIndex]->nextInView();//yzhang temp 
      seedSlay[viewIndex] = seedSlay[viewIndex]->prevInView(); //yzhang del
      if (seedSlay[viewIndex] == 0) return 0;
      seedSeg[viewIndex] = (MdcSeg *) 
    oneList(seedSlay[viewIndex]->index())->first();
    } // We have a segment; is it a viable seed?
    else if (seedSeg[viewIndex]->segUsed()) {
      //std::cout<<__FILE__<<" segUsed " << std::endl;
      seedSeg[viewIndex] = (MdcSeg *) seedSeg[viewIndex]->next();
    } 
    else if (seedSeg[viewIndex]->segAmbig() && goodOnly) {
      //std::cout<<__FILE__<<" segAmbig && goodOnly" << std::endl;
      seedSeg[viewIndex] = (MdcSeg *) seedSeg[viewIndex]->next();
      //yzhang delete 09-10-10
      //delete (!seedSeg[viewIndex]->segAmbig() && !goodOnly)
    } //yzhang add 09-09-28
    else if ( !seedSeg[viewIndex]->segFull() && goodOnly) {
      //std::cout<<__FILE__<<" segFull && goodOnly" << std::endl;
      seedSeg[viewIndex] = (MdcSeg *) seedSeg[viewIndex]->next();
      //zhangy add
    } else {
      // Reject segments with a lot of used hits
      int nused = 0;
      int navail = seedSeg[viewIndex]->nHit();
      for (int ihit = 0; ihit < seedSeg[viewIndex]->nHit(); ihit++) {
    MdcHitUse *ahit = seedSeg[viewIndex]->hit(ihit);
    if ( ahit->mdcHit()->usedHit() ) nused++;
      }
      // Minimum 2 unused hits (but allow special-purpose segs w/ 0 hits)
      if (navail - nused < 2 && navail > 0) {  
    seedSeg[viewIndex] = (MdcSeg *) seedSeg[viewIndex]->next();
      } else {
    //std::cout<<__FILE__<<" Reject segments with a lot of used hits" << std::endl;
    break;
      }
    }
    /*
    if(seedSeg[viewIndex]!=0){
      seedSeg[viewIndex]->plotSeg();
      std::cout<< __FILE__ << "   " << __LINE__ << " goodOnly  "
    <<goodOnly<<" viewIndex "<<viewIndex<< " full "<<seedSeg[viewIndex]->segFull() <<std::endl;
    }
    */
  }
 
  // We have a seed
  MdcSeg *theSeed = seedSeg[viewIndex];
  seedSeg[viewIndex] = (MdcSeg *) seedSeg[viewIndex]->next();
 
  return theSeed;
}

Referenced by MdcTrackList::createFromSegs(), and MdcTrackListCsmc::createFromSegs().

oneList()

const GmsList * MdcSegList::oneList

(

int

slayIndex

)

const

Definition at line 412 of file MdcSegList.cxx.

                                       {
  //-------------------------------------------------------------------------
  return &segList[slayIndex];
}

Referenced by MdcSegGrouperAx::fillWithSegs(), MdcSegGrouperCsmc::fillWithSegs(), MdcSegGrouperSt::fillWithSegs(), getSeed(), and resetSeed().

plot()

void MdcSegList::plot

(

)

const

Definition at line 75 of file MdcSegList.cxx.

                            {
  /**************************************************************************/
 
  MdcSeg *aSeg;
  for (int i = 0; i < _nsupers; i++) {
    std::cout << " ---------------MdcSeg of Slayer "<<i<<"-------------" << std::endl;
 
    aSeg = (MdcSeg *) segList[i].first();
    while (aSeg != 0) {
      aSeg->plotSegAll();
      std::cout << endl;
      aSeg = (MdcSeg *) aSeg->next();
    }
  }
}

resetSeed()

void MdcSegList::resetSeed

(

const MdcDetector *

gm

)

Definition at line 57 of file MdcSegList.cxx.

                                                {
/**************************************************************************/
 
  for (int iview = -1; iview <= 1; iview++) {
    int viewIndex = iview + 1;
   /* 
    if(0 == iview){
      seedSlay[viewIndex] = gm->firstSlayInView(iview);
    }else{
      seedSlay[viewIndex] = gm->lastSlayInView(iview);
    }
    */
    seedSlay[viewIndex] = gm->lastSlayInView(iview);
    if (seedSlay[viewIndex] != 0) seedSeg[viewIndex] = 
      (MdcSeg *)   oneList(seedSlay[viewIndex]->index())->first();
  }
}

Referenced by MdcTrackList::createFromSegs(), MdcTrackListCsmc::createFromSegs(), and MdcSegFinder::createSegs().

segPar()

MdcSegParams * MdcSegList::segPar ( )

inline

Definition at line 38 of file MdcSegList.h.

{return &segParam;}

Referenced by MdcSegFinder::createSegs().

setPlot()

void MdcSegList::setPlot

(

int

lPlt

)

Definition at line 406 of file MdcSegList.cxx.

                            {
  MdcSeg::segPar()->lPlot = lPlt;
}

Friends And Related Function Documentation

MdcSegFinder

friend class MdcSegFinder

friend

Definition at line 22 of file MdcSegList.h.

---

The documentation for this class was generated from the following files:

• MdcSegList.h
• MdcSegList.cxx