Newer
Older
///////////////////////////////////////////////////////////////////////////////
// //
// //
// Subdetector class to hold a bunch of planes constituting a chamber //
// This class will be created by the THcDC class which will also create //
// the plane objects. //
// The THcDC class will then pass this class a list of the planes. //
// //
///////////////////////////////////////////////////////////////////////////////
#include "THcDriftChamber.h"
#include "THcDC.h"
#include "THcDCHit.h"
#include "THcGlobals.h"
#include "THcParmList.h"
#include "VarDef.h"
#include "VarType.h"
#include "THaTrack.h"
#include "TClonesArray.h"
#include "TMath.h"
#include "THcSpacePoint.h"
#include "THaTrackProj.h"
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
//_____________________________________________________________________________
THcDriftChamber::THcDriftChamber(
const char* name, const char* description,
const Int_t chambernum, THaDetectorBase* parent ) :
THaSubDetector(name,description,parent)
{
// Constructor
// fTrackProj = new TClonesArray( "THaTrackProj", 5 );
Stephen A. Wood
committed
fNPlanes = 0; // No planes until we make them
fSpacePoints = new TClonesArray("THcSpacePoint",10);
}
//_____________________________________________________________________________
void THcDriftChamber::Setup(const char* name, const char* description)
{
char prefix[2];
THaApparatus *app = GetApparatus();
if(app) {
cout << app->GetName() << endl;
} else {
cout << "No apparatus found" << endl;
}
prefix[0]=tolower(app->GetName()[0]);
prefix[1]='\0';
// For now, decide chamber style from the spectrometer name.
// Should override with a paramter
if(prefix[0]=='h') {
fHMSStyleChambers = 1;
} else {
fHMSStyleChambers = 0;
}
}
//_____________________________________________________________________________
THcDriftChamber::THcDriftChamber( ) :
{
// Constructor
fPlanes.clear();
fSpacePoints = NULL;
}
//_____________________________________________________________________________
Int_t THcDriftChamber::Decode( const THaEvData& evdata )
{
return 0;
}
//_____________________________________________________________________________
THaAnalysisObject::EStatus THcDriftChamber::Init( const TDatime& date )
{
// static const char* const here = "Init()";
EStatus status;
// This triggers call of ReadDatabase and DefineVariables
if( (status = THaSubDetector::Init( date )) )
return fStatus=status;
void THcDriftChamber::AddPlane(THcDriftChamberPlane *plane)
{
plane->SetPlaneIndex(fNPlanes);
fPlanes.push_back(plane);
// Hard code Y plane numbers. Eventually need to get from database
if (fHMSStyleChambers) {
if(fChamberNum == 1) {
YPlaneNum=2;
YPlanePNum=5;
if(plane->GetPlaneNum() == 2) YPlaneInd = fNPlanes;
if(plane->GetPlaneNum() == 5) YPlanePInd = fNPlanes;
} else {
YPlaneNum=8;
YPlanePNum=11;
if(plane->GetPlaneNum() == 8) YPlaneInd = fNPlanes;
if(plane->GetPlaneNum() == 11) YPlanePInd = fNPlanes;
}
// SOS Specific
// Hard code X plane numbers. Eventually need to get from database
if(fChamberNum == 1) {
XPlaneNum=3;
XPlanePNum=4;
if(plane->GetPlaneNum() == 3) XPlaneInd = fNPlanes;
if(plane->GetPlaneNum() == 4) XPlanePInd = fNPlanes;
} else {
XPlaneNum=9;
XPlanePNum=10;
if(plane->GetPlaneNum() == 9) XPlaneInd = fNPlanes;
if(plane->GetPlaneNum() == 10) XPlanePInd = fNPlanes;
}
}
}
//_____________________________________________________________________________
Int_t THcDriftChamber::ReadDatabase( const TDatime& date )
{
cout << "THcDriftChamber::ReadDatabase()" << endl;
char prefix[2];
prefix[0]=tolower(GetApparatus()->GetName()[0]);
prefix[1]='\0';
DBRequest list[]={
{"_remove_sppt_if_one_y_plane",&fRemove_Sppt_If_One_YPlane, kInt,0,1},
Stephen A. Wood
committed
{"dc_wire_velocity", &fWireVelocity, kDouble},
{"SmallAngleApprox", &fSmallAngleApprox, kInt},
{"stub_max_xpdiff", &fStubMaxXPDiff, kDouble,0,1},
{"debugflagpr", &fhdebugflagpr, kInt},
{"debugstubchisq", &fdebugstubchisq, kInt},
{Form("dc_%d_zpos",fChamberNum), &fZPos, kDouble},
{0}
};
fRemove_Sppt_If_One_YPlane = 0; // Default
fStubMaxXPDiff = 0.05; // The HMS default. Not used for SOS.
gHcParms->LoadParmValues((DBRequest*)&list,prefix);
// Get parameters parent knows about
THcDC* fParent;
fParent = (THcDC*) GetParent();
fMinHits = fParent->GetMinHits(fChamberNum);
fMaxHits = fParent->GetMaxHits(fChamberNum);
fMinCombos = fParent->GetMinCombos(fChamberNum);
fFixPropagationCorrection = fParent->GetFixPropagationCorrectionFlag();
fSpacePointCriterion = fParent->GetSpacePointCriterion(fChamberNum);
fSpacePointCriterion2 = fSpacePointCriterion*fSpacePointCriterion;
if (fhdebugflagpr) cout << " cham = " << fChamberNum << " Set yplane num " << YPlaneNum << " "<< YPlanePNum << endl;
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
// Generate the HAA3INV matrix for all the acceptable combinations
// of hit planes. Try to make it as generic as possible
// pindex=0 -> Plane 1 missing, pindex5 -> plane 6 missing. Won't
// replicate the exact values used in the ENGINE, because the engine
// had one big list of matrices for both chambers, while here we will
// have a list just for one chamber. Also, call pindex, pmindex as
// we tend to use pindex as a plane index.
fCosBeta = new Double_t [fNPlanes];
fSinBeta = new Double_t [fNPlanes];
fTanBeta = new Double_t [fNPlanes];
fSigma = new Double_t [fNPlanes];
fPsi0 = new Double_t [fNPlanes];
fStubCoefs = new Double_t* [fNPlanes];
Int_t allplanes=0;
for(Int_t ip=0;ip<fNPlanes;ip++) {
fCosBeta[ip] = TMath::Cos(fPlanes[ip]->GetBeta());
fSinBeta[ip] = TMath::Sin(fPlanes[ip]->GetBeta());
fTanBeta[ip] = fSinBeta[ip]/fCosBeta[ip];
fSigma[ip] = fPlanes[ip]->GetSigma();
fPsi0[ip] = fPlanes[ip]->GetPsi0();
fStubCoefs[ip] = fPlanes[ip]->GetStubCoef();
allplanes |= 1<<ip;
}
// Unordered map introduced in C++-11
// Can use unordered_map if using C++-11
// May not want to use map a all for performance, but using it now
// for code clarity
for(Int_t ipm1=0;ipm1<fNPlanes+1;ipm1++) { // Loop over missing plane1
for(Int_t ipm2=ipm1;ipm2<fNPlanes+1;ipm2++) {
if(ipm1==ipm2 && ipm1<fNPlanes) continue;
TMatrixD* AA3 = new TMatrixD(3,3);
for(Int_t i=0;i<3;i++) {
for(Int_t j=i;j<3;j++) {
(*AA3)[i][j] = 0.0;
for(Int_t ip=0;ip<fNPlanes;ip++) {
if(ipm1 != ip && ipm2 != ip) {
(*AA3)[i][j] += fStubCoefs[ip][i]*fStubCoefs[ip][j];
(*AA3)[j][i] = (*AA3)[i][j];
}
}
Int_t bitpat = allplanes & ~(1<<ipm1) & ~(1<<ipm2);
// Should check that it is invertable
// if (fhdebugflagpr) cout << bitpat << " Determinant: " << AA3->Determinant() << endl;
AA3->Invert();
fAA3Inv[bitpat] = AA3;
}
}
#if 0
for(map<int,TMatrixD*>::iterator pm=fHaa3map.begin();
pm != fHaa3map.end(); pm++) {
fAA3Inv[pm->first]->Print();
}
#endif
return kOK;
}
//_____________________________________________________________________________
Int_t THcDriftChamber::DefineVariables( EMode mode )
{
// Initialize global variables and lookup table for decoder
if( mode == kDefine && fIsSetup ) return kOK;
fIsSetup = ( mode == kDefine );
// Register variables in global list
// RVarDef vars[] = {
// { "nhit", "Number of DC hits", "fNhits" },
// { 0 }
// };
// return DefineVarsFromList( vars, mode );
return kOK;
}
void THcDriftChamber::ProcessHits( void)
{
// Make a list of hits for whole chamber
fNhits = 0;
fHits.clear();
fHits.reserve(10);
for(Int_t ip=0;ip<fNPlanes;ip++) {
TClonesArray* hitsarray = fPlanes[ip]->GetHits();
for(Int_t ihit=0;ihit<fPlanes[ip]->GetNHits();ihit++) {
fHits.push_back(static_cast<THcDCHit*>(hitsarray->At(ihit)));
fNhits++;
}
// if (fhdebugflagpr) cout << "ThcDriftChamber::ProcessHits() " << fNhits << " hits" << endl;
}
void THcDriftChamber::PrintDecode( void )
{
cout << " Num of nits = " << fNhits << endl;
cout << " Num " << " Plane " << " Wire " << " Wire-Center " << " RAW TDC " << " Drift time" << endl;
for(Int_t ihit=0;ihit<fNhits;ihit++) {
THcDCHit* thishit = fHits[ihit];
cout << ihit << " " <<thishit->GetPlaneNum() << " " << thishit->GetWireNum() << " " << thishit->GetPos() << " " << thishit->GetRawTime() << " " << thishit->GetTime() << endl;
}
}
Int_t THcDriftChamber::FindSpacePoints( void )
{
fSpacePoints->Clear();
Int_t plane_hitind=0;
Int_t planep_hitind=0;
fNSpacePoints=0;
fEasySpacePoint = 0;
if(fNhits >= fMinHits && fNhits < fMaxHits) {
for(Int_t ihit=0;ihit<fNhits;ihit++) {
THcDCHit* thishit = fHits[ihit];
Int_t ip=thishit->GetPlaneNum(); // This is the absolute plane mumber
if(ip==YPlaneNum && fHMSStyleChambers) plane_hitind = ihit;
if(ip==YPlanePNum && fHMSStyleChambers) planep_hitind = ihit;
if(ip==XPlaneNum && !fHMSStyleChambers) plane_hitind = ihit;
if(ip==XPlanePNum && !fHMSStyleChambers) planep_hitind = ihit;
Int_t PlaneInd=0,PlanePInd=0;
if (fHMSStyleChambers) {
PlaneInd=YPlaneInd;
PlanePInd=YPlanePInd;
} else {
PlaneInd=XPlaneInd;
PlanePInd=XPlanePInd;
if(fPlanes[PlaneInd]->GetNHits() == 1 && fPlanes[PlanePInd]->GetNHits() == 1
&& TMath::Abs(fHits[plane_hitind]->GetPos() - fHits[planep_hitind]->GetPos())
< fSpacePointCriterion
&& fNhits <= 6) { // An easy case, probably one hit per plane
if(fHMSStyleChambers) fEasySpacePoint = FindEasySpacePoint_HMS(plane_hitind, planep_hitind);
if(!fHMSStyleChambers) fEasySpacePoint = FindEasySpacePoint_SOS(plane_hitind, planep_hitind);
}
if(!fEasySpacePoint) { // It's not easy
FindHardSpacePoints();
}
// We have our space points for this chamber
if(fNSpacePoints > 0) {
if(fHMSStyleChambers) {
if(fRemove_Sppt_If_One_YPlane == 1) {
// The routine is specific to HMS
Int_t ndest=DestroyPoorSpacePoints(); // Only for HMS?
// Loop over space points and remove those with less than 4 planes
// hit and missing hits in Y,Y' planes
}
Int_t nadded=SpacePointMultiWire(); // Only for HMS?
if (nadded) if (fhdebugflagpr) cout << nadded << " Space Points added with SpacePointMultiWire()" << endl;
}
ChooseSingleHit();
SelectSpacePoints();
// if(fNSpacePoints == 0) if (fhdebugflagpr) cout << "SelectSpacePoints() killed SP" << endl;
// if (fhdebugflagpr) cout << fNSpacePoints << " Space Points remain" << endl;
// Add these space points to the total list of space points for the
// the DC package. Do this in THcDC.cxx.
#if 0
for(Int_t ip=0;ip<fNPlanes;ip++) {
Int_t np = fPlanes[ip]->GetPlaneNum(); // Actuall plane number of this plane
// (0-11) or (1-12)?
TClonesArray* fHits = fPlanes[ip]->GetHits();
for(Int_t ihit=0;ihit<fNhits;ihit++) { // Looping over all hits in all planes of the chamber
THcDCHit* hit = static_cast<THcDCHit*>(fHits->At(ihit));
//
}
}
#endif
}
return(fNSpacePoints);
}
//_____________________________________________________________________________
Int_t THcDriftChamber::FindEasySpacePoint_HMS(Int_t yplane_hitind,Int_t yplanep_hitind)
{
// Simplified HMS find_space_point routing. It is given all y hits and
// checks to see if all x-like hits are close enough together to make
// a space point.
Int_t easy_space_point=0;
Double_t yt = (fHits[yplane_hitind]->GetPos() + fHits[yplanep_hitind]->GetPos())/2.0;
Double_t xt = 0.0;
Int_t num_xhits = 0;
Double_t x_pos[MAX_HITS_PER_POINT];
for(Int_t ihit=0;ihit<fNhits;ihit++) {
THcDCHit* thishit = fHits[ihit];
if(ihit!=yplane_hitind && ihit!=yplanep_hitind) { // x-like hit
// ysp and xsp are from h_generate_geometry
x_pos[ihit] = (thishit->GetPos()
-yt*thishit->GetWirePlane()->GetYsp())
/thishit->GetWirePlane()->GetXsp();
xt += x_pos[ihit];
num_xhits++;
} else {
x_pos[ihit] = 0.0;
}
}
Double_t max_dist = TMath::Sqrt(fSpacePointCriterion/2.);
xt = (num_xhits>0?xt/num_xhits:0.0);
easy_space_point = 1; // Assume we have an easy space point
// Rule it out if x points don't cluster well enough
for(Int_t ihit=0;ihit<fNhits;ihit++) {
cout << " easy sp check xt = " << xt-x_pos[ihit] << " " << max_dist << endl;
if(ihit!=yplane_hitind && ihit!=yplanep_hitind) { // select x-like hit
{ easy_space_point=0; break;}
}
}
if(easy_space_point) { // Register the space point
THcSpacePoint* sp = (THcSpacePoint*)fSpacePoints->ConstructedAt(fNSpacePoints++);
sp->Clear();
sp->SetXY(xt, yt);
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
sp->SetCombos(0);
for(Int_t ihit=0;ihit<fNhits;ihit++) {
sp->AddHit(fHits[ihit]);
}
}
return(easy_space_point);
}
// SOS Specific
Int_t THcDriftChamber::FindEasySpacePoint_SOS(Int_t xplane_hitind,Int_t xplanep_hitind)
{
// Simplified SOS find_space_point routing. It is given all x hits and
// checks to see if all y-like hits are close enough together to make
// a space point.
Int_t easy_space_point=0;
Double_t xt = (fHits[xplane_hitind]->GetPos() + fHits[xplanep_hitind]->GetPos())/2.0;
Double_t yt = 0.0;
Int_t num_yhits = 0;
Double_t y_pos[MAX_HITS_PER_POINT];
for(Int_t ihit=0;ihit<fNhits;ihit++) {
THcDCHit* thishit = fHits[ihit];
if(ihit!=xplane_hitind && ihit!=xplanep_hitind) { // y-like hit
// ysp and xsp are from h_generate_geometry
y_pos[ihit] = (thishit->GetPos()
-xt*thishit->GetWirePlane()->GetXsp())
/thishit->GetWirePlane()->GetYsp();
yt += y_pos[ihit];
num_yhits++;
} else {
y_pos[ihit] = 0.0;
}
}
Double_t max_dist = TMath::Sqrt(fSpacePointCriterion/2.);
yt = (num_yhits>0?yt/num_yhits:0.0);
easy_space_point = 1; // Assume we have an easy space point
// Rule it out if x points don't cluster well enough
for(Int_t ihit=0;ihit<fNhits;ihit++) {
if(ihit!=xplane_hitind && ihit!=xplanep_hitind) { // select y-like hit
if(TMath::Abs(yt-y_pos[ihit]) >= max_dist)
{ easy_space_point=0; break;}
}
}
if(easy_space_point) { // Register the space point
THcSpacePoint* sp = (THcSpacePoint*)fSpacePoints->ConstructedAt(fNSpacePoints++);
sp->Clear();
sp->SetXY(xt, yt);
sp->SetCombos(0);
for(Int_t ihit=0;ihit<fNhits;ihit++) {
sp->AddHit(fHits[ihit]);
}
}
return(easy_space_point);
}
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
//_____________________________________________________________________________
// Generic
Int_t THcDriftChamber::FindHardSpacePoints()
{
Int_t MAX_NUMBER_PAIRS=1000; // Where does this get set?
struct Pair {
THcDCHit* hit1;
THcDCHit* hit2;
Double_t x, y;
};
Pair pairs[MAX_NUMBER_PAIRS];
//
Int_t ntest_points=0;
for(Int_t ihit1=0;ihit1<fNhits-1;ihit1++) {
THcDCHit* hit1=fHits[ihit1];
THcDriftChamberPlane* plane1 = hit1->GetWirePlane();
for(Int_t ihit2=ihit1+1;ihit2<fNhits;ihit2++) {
if(ntest_points < MAX_NUMBER_PAIRS) {
THcDCHit* hit2=fHits[ihit2];
THcDriftChamberPlane* plane2 = hit2->GetWirePlane();
Double_t determinate = plane1->GetXsp()*plane2->GetYsp()
-plane1->GetYsp()*plane2->GetXsp();
if(TMath::Abs(determinate) > 0.3) { // 0.3 is sin(alpha1-alpha2)=sin(17.5)
pairs[ntest_points].hit1 = hit1;
pairs[ntest_points].hit2 = hit2;
pairs[ntest_points].x = (hit1->GetPos()*plane2->GetYsp()
- hit2->GetPos()*plane1->GetYsp())
/determinate;
pairs[ntest_points].y = (hit2->GetPos()*plane1->GetXsp()
- hit1->GetPos()*plane2->GetXsp())
/determinate;
ntest_points++;
}
}
}
}
Int_t ncombos=0;
struct Combo {
Pair* pair1;
Pair* pair2;
};
Combo combos[10*MAX_NUMBER_PAIRS];
for(Int_t ipair1=0;ipair1<ntest_points-1;ipair1++) {
for(Int_t ipair2=ipair1+1;ipair2<ntest_points;ipair2++) {
if(ncombos < 10*MAX_NUMBER_PAIRS) {
Double_t dist2 = pow(pairs[ipair1].x - pairs[ipair2].x,2)
+ pow(pairs[ipair1].y - pairs[ipair2].y,2);
if(dist2 <= fSpacePointCriterion2) {
combos[ncombos].pair1 = &pairs[ipair1];
combos[ncombos].pair2 = &pairs[ipair2];
ncombos++;
}
}
}
}
// Loop over all valid combinations and build space points
//if (fhdebugflagpr) cout << "looking for hard Space Point combos = " << ncombos << endl;
for(Int_t icombo=0;icombo<ncombos;icombo++) {
THcDCHit* hits[4];
hits[0]=combos[icombo].pair1->hit1;
hits[1]=combos[icombo].pair1->hit2;
hits[2]=combos[icombo].pair2->hit1;
hits[3]=combos[icombo].pair2->hit2;
// Get Average Space point xt, yt
Double_t xt = (combos[icombo].pair1->x + combos[icombo].pair2->x)/2.0;
Double_t yt = (combos[icombo].pair1->y + combos[icombo].pair2->y)/2.0;
// Loop over space points
if(fNSpacePoints > 0) {
Int_t add_flag=1;
for(Int_t ispace=0;ispace<fNSpacePoints;ispace++) {
THcSpacePoint* sp = (THcSpacePoint*)(*fSpacePoints)[ispace];
if(sp->GetNHits() > 0) {
Double_t sqdist_test = pow(xt - sp->GetX(),2) + pow(yt - sp->GetY(),2);
// I (who is I) want to be careful if sqdist_test is bvetween 1 and
// 3 fSpacePointCriterion2. Let me ignore not add a new point the
if(sqdist_test < 3*fSpacePointCriterion2) {
add_flag = 0; // do not add a new space point
}
if(sqdist_test < fSpacePointCriterion2) {
// This is a real match
// Add the new hits to the existing space point
Int_t iflag[4];
iflag[0]=0;iflag[1]=0;iflag[2]=0;iflag[3]=0;
// Find out which of the four hits in the combo are already
// in the space point under consideration so that we don't
// add duplicate hits to the space point
for(Int_t isp_hit=0;isp_hit<sp->GetNHits();isp_hit++) {
for(Int_t icm_hit=0;icm_hit<4;icm_hit++) { // Loop over combo hits
if(sp->GetHit(isp_hit)==hits[icm_hit]) {
iflag[icm_hit] = 1;
}
}
}
// Remove duplicated pionts in the combo so we don't add
// duplicate hits to the space point
for(Int_t icm1=0;icm1<3;icm1++) {
for(Int_t icm2=icm1+1;icm2<4;icm2++) {
if(hits[icm1]==hits[icm2]) {
iflag[icm2] = 1;
}
}
}
// Add the unique combo hits to the space point
for(Int_t icm=0;icm<4;icm++) {
if(iflag[icm]==0) {
sp->AddHit(hits[icm]);
// cout << " number of combos = " << sp->GetCombos() << endl;
// Terminate loop since this combo can only belong to one space point
break;
}
}
}// End of loop over existing space points
// Create a new space point if more than 2*space_point_criteria
if(fNSpacePoints < MAX_SPACE_POINTS) {
if(add_flag) {
//if (fhdebugflagpr) cout << " add glag = " << add_flag << " space pts = " << fNSpacePoints << endl ;
THcSpacePoint* sp = (THcSpacePoint*)fSpacePoints->ConstructedAt(fNSpacePoints++);
sp->Clear();
sp->SetXY(xt, yt);
sp->SetCombos(1);
sp->AddHit(hits[0]);
sp->AddHit(hits[1]);
if(hits[0] != hits[2] && hits[1] != hits[2]) {
sp->AddHit(hits[2]);
}
if(hits[0] != hits[3] && hits[1] != hits[3]) {
sp->AddHit(hits[3]);
}
}
}
} else {// Create first space point
// This duplicates code above. Need to see if we can restructure
// to avoid
THcSpacePoint* sp = (THcSpacePoint*)fSpacePoints->ConstructedAt(fNSpacePoints++);
sp->Clear();
sp->SetXY(xt, yt);
sp->SetCombos(1);
sp->AddHit(hits[0]);
sp->AddHit(hits[1]);
if(hits[0] != hits[2] && hits[1] != hits[2]) {
sp->AddHit(hits[2]);
}
if(hits[0] != hits[3] && hits[1] != hits[3]) {
sp->AddHit(hits[3]);
//if (fhdebugflagpr) cout << "1st hard Space Point " << xt << " " << yt << " Space point # =" << fNSpacePoints << " combos = " << sp->GetCombos() << endl;
}//End check on 0 space points
}//End loop over combos
//if (fhdebugflagpr) cout << " finished findspacept # of sp pts = " << fNSpacePoints << endl;
}
//_____________________________________________________________________________
// HMS Specific?
Int_t THcDriftChamber::DestroyPoorSpacePoints()
{
Int_t spacepointsgood[fNSpacePoints];
Int_t ngood=0;
for(Int_t i=0;i<fNSpacePoints;i++) {
spacepointsgood[i] = 0;
}
for(Int_t isp=0;isp<fNSpacePoints;isp++) {
Int_t nplanes_hit = 0;
for(Int_t ip=0;ip<fNPlanes;ip++) {
nhitsperplane[ip] = 0;
}
// Count # hits in each plane for this space point
THcSpacePoint* sp = (THcSpacePoint*)(*fSpacePoints)[isp];
for(Int_t ihit=0;ihit<sp->GetNHits();ihit++) {
THcDCHit* hit=sp->GetHit(ihit);
// hit_order(hit) = ihit;
Int_t ip = hit->GetPlaneIndex();
nhitsperplane[ip]++;
}
// Count # planes that have hits
for(Int_t ip=0;ip<fNPlanes;ip++) {
if(nhitsperplane[ip] > 0) {
nplanes_hit++;
}
}
if(nplanes_hit >= fMinHits && nhitsperplane[YPlaneInd]>0
&& nhitsperplane[YPlanePInd] > 0) {
spacepointsgood[ngood++] = isp; // Build list of good points
} else {
// if (fhdebugflagpr) cout << "Missing Y-hit!!";
// Remove the bad space points
Int_t nremoved=fNSpacePoints-ngood;
fNSpacePoints = ngood;
for(Int_t isp=0;isp<fNSpacePoints;isp++) { // New index num ber
Int_t osp=spacepointsgood[isp]; // Original index number
if(osp > isp) {
// Does this work, or do we have to copy each member?
// If it doesn't we should overload the = operator
Mark Jones
committed
//(*fSpacePoints)[isp] = (*fSpacePoints)[osp];
THcSpacePoint* spi = (THcSpacePoint*)(*fSpacePoints)[isp];
THcSpacePoint* spo = (THcSpacePoint*)(*fSpacePoints)[osp];
spi->Clear();
Double_t xt,yt;
xt=spo->GetX();
yt=spo->GetY();
spi->SetXY(xt, yt);
for(Int_t ihit=0;ihit<spo->GetNHits();ihit++) {
THcDCHit* hit = spo->GetHit(ihit);
spi->AddHit(hit);
}
}
}
return nremoved;
}
//_____________________________________________________________________________
// HMS Specific?
/*
Purpose and Methods : This routine loops over space points and
looks at all hits in the space
point. If more than 1 hit is in the same
plane then the space point is cloned with
all combinations of 1 wire per plane. The
requirements for cloning are: 1) at least
4 planes fire, and 2) no more than 6 planes
have multiple hits.
*/
Int_t THcDriftChamber::SpacePointMultiWire()
{
Int_t nhitsperplane[fNPlanes];
THcDCHit* hits_plane[fNPlanes][MAX_HITS_PER_POINT];
Int_t nsp_check;
Int_t nplanes_single;
Int_t nsp_tot=fNSpacePoints;
Int_t nsp_totl=fNSpacePoints;
//if (fhdebugflagpr) cout << "Start Multiwire # of sp pts = " << nsp_totl << endl;
for(Int_t isp=0;isp<nsp_totl;isp++) {
Int_t nplanes_hit = 0; // Number of planes with hits
Int_t nplanes_mult = 0; // Number of planes with multiple hits
Int_t nsp_new = 1;
Int_t newsp_num=0;
//if (fhdebugflagpr) cout << "Looping thru space pts at # = " << isp << " total = " << fNSpacePoints << endl;
for(Int_t ip=0;ip<fNPlanes;ip++) {
nhitsperplane[ip] = 0;
for(Int_t ih=0;ih<MAX_HITS_PER_POINT;ih++) {
hits_plane[ip][ih] = 0;
}
}
// Sort Space Points hits by plane
THcSpacePoint* sp = (THcSpacePoint*)(*fSpacePoints)[isp];
for(Int_t ihit=0;ihit<sp->GetNHits();ihit++) { // All hits in SP
THcDCHit* hit=sp->GetHit(ihit);
// hit_order Make a hash
// hash(hit) = ihit;
Int_t ip = hit->GetPlaneIndex();
hits_plane[ip][nhitsperplane[ip]++] = hit;
//if (fhdebugflagpr) cout << " hit = " << ihit+1 << " plane index = " << ip << " nhitsperplane = " << nhitsperplane[ip] << endl;
}
for(Int_t ip=0;ip<fNPlanes;ip++) {
if(nhitsperplane[ip] > 0) {
nplanes_hit++;
nsp_new *= nhitsperplane[ip];
if(nhitsperplane[ip] > 1) nplanes_mult++;
//if (fhdebugflagpr) cout << "Found plane with multi hits plane =" << ip+1 << " nplane_hit = "<< nplanes_hit << " nsp_new = " <<nsp_new << " nplane_mult = "<< nplanes_mult << endl;
}
}
--nsp_new;
nsp_check=nsp_tot + nsp_new;
nplanes_single = nplanes_hit - nplanes_mult;
//if (fhdebugflagpr) cout << " # of new space points = " << nsp_new << " total now = " << nsp_tot<< endl;
// Check if cloning conditions are met
Int_t ntot = 0;
if(nplanes_hit >= 4 && nplanes_mult < 4 && nplanes_mult >0
&& nsp_check < 20) {
//if (fhdebugflagpr) cout << " Cloning space point " << endl;
// Order planes by decreasing # of hits
Int_t maxplane[fNPlanes];
for(Int_t ip=0;ip<fNPlanes;ip++) {
maxplane[ip] = ip;
}
// Sort by decreasing # of hits
for(Int_t ip1=0;ip1<fNPlanes-1;ip1++) {
for(Int_t ip2=ip1+1;ip2<fNPlanes;ip2++) {
if(nhitsperplane[maxplane[ip2]] > nhitsperplane[maxplane[ip1]]) {
Int_t temp = maxplane[ip1];
maxplane[ip1] = maxplane[ip2];
maxplane[ip2] = temp;
}
}
}
//if (fhdebugflagpr) cout << " Max plane and hits " << maxplane[0] << " " << nhitsperplane[maxplane[0]]<< " " << maxplane[1] << " " << nhitsperplane[maxplane[1]]<< " "<< maxplane[2] << " " << nhitsperplane[maxplane[2]]<< endl;
// First fill clones with 1 hit each from the 3 planes with the most hits
for(Int_t n1=0;n1<nhitsperplane[maxplane[0]];n1++) {
for(Int_t n2=0;n2<nhitsperplane[maxplane[1]];n2++) {
for(Int_t n3=0;n3<nhitsperplane[maxplane[2]];n3++) {
ntot++;
newsp_num = fNSpacePoints; //
//if (fhdebugflagpr) cout << " new space pt num = " << newsp_num << " " << fNSpacePoints << endl;
if(n1==0 && n2==0 && n3==0) {
newsp_num = isp; // Copy over the original SP
THcSpacePoint* newsp = (THcSpacePoint*)fSpacePoints->ConstructedAt(newsp_num);//= (THcSpacePoint*)(*fSpacePoints)[newsp_num];
//if (fhdebugflagpr) cout << " Copy over original SP " << endl;
// newsp = sp;
Int_t combos_save=sp->GetCombos();
newsp->Clear(); // Clear doesn't clear X, Y
// if (fhdebugflagpr) cout << " original sp #hits combos X y " << sp->GetCombos() << sp->GetNHits() << sp->GetX() << " " << sp->GetY() << endl;
newsp->SetXY(sp->GetX(), sp->GetY());
newsp->SetCombos(combos_save);
newsp->AddHit(hits_plane[maxplane[0]][n1]);
newsp->AddHit(hits_plane[maxplane[1]][n2]);
newsp->AddHit(hits_plane[maxplane[2]][n3]);
newsp->AddHit(hits_plane[maxplane[3]][0]);
if(nhitsperplane[maxplane[4]] == 1) {
newsp->AddHit(hits_plane[maxplane[4]][0]);
if(nhitsperplane[maxplane[5]] == 1)
newsp->AddHit(hits_plane[maxplane[5]][0]);
}
// if (fhdebugflagpr) cout << " setting other sp " << "# space pts now = " << fNSpacePoints << endl;
THcSpacePoint* newsp = (THcSpacePoint*)fSpacePoints->ConstructedAt(newsp_num);
fNSpacePoints++;
Int_t combos_save=sp->GetCombos();
newsp->Clear();
newsp->SetXY(sp->GetX(), sp->GetY());
newsp->SetCombos(combos_save);
newsp->AddHit(hits_plane[maxplane[0]][n1]);
newsp->AddHit(hits_plane[maxplane[1]][n2]);
newsp->AddHit(hits_plane[maxplane[2]][n3]);
newsp->AddHit(hits_plane[maxplane[3]][0]);
if(nhitsperplane[maxplane[4]] == 1) {
newsp->AddHit(hits_plane[maxplane[4]][0]);
if(nhitsperplane[maxplane[5]] == 1)
newsp->AddHit(hits_plane[maxplane[5]][0]);
}
}
}
}
#if 0
// Loop over clones and order hits in the same way as parent SP
// Why do we have to order the hits.
for(Int_t i=0;i<ntot;i++) {
Int_t newsp_num= nsp_tot + i;
if(i == 1) newsp_num = isp;
for(Int_t j=0;j<nplanes_hit;j++) {
for(Int_t k=0;k<nplanes_hit;k++) {
THcDCHit* hit1 = fSpacePointHits[newsp_num][j];
THcDCHit* hit2 = fSpacePointHits[newsp_num][k];
if(hit_order(hit1) > hit_order(hit2)) {
THcDCHit* temp = fSpacePoints[newsp_num].hits[k];
fSpacePoints[newsp_num].hits[k] = fSpacePoints[newsp_num].hits[j];
fSpacePoints[newsp_num].hits[j] = temp;
}
}
}
}
ntot=1; // space point not to be cloned
assert (nsp_tot > 0); // program terminates if nsp_tot <=0
Int_t nadded=0;
if(nsp_tot <= 20) {
nadded = nsp_tot - fNSpacePoints;
// fNSpacePoints = nsp_tot;
//if (fhdebugflagpr) cout << " Added space pts " << nadded << " total space pts = " << fNSpacePoints << endl;
// In Fortran, fill in zeros.
return(nadded);
}
//_____________________________________________________________________________
void THcDriftChamber::ChooseSingleHit()
{
// Look at all hits in a space point. If two hits are in the same plane,
// reject the one with the longer drift time.
for(Int_t isp=0;isp<fNSpacePoints;isp++) {
THcSpacePoint* sp = (THcSpacePoint*)(*fSpacePoints)[isp];
Int_t startnum = sp->GetNHits();
Int_t goodhit[startnum];
for(Int_t ihit=0;ihit<startnum;ihit++) {
goodhit[ihit] = 1;
}
// For each plane, mark all hits longer than the shortest drift time
for(Int_t ihit1=0;ihit1<startnum-1;ihit1++) {
THcDCHit* hit1 = sp->GetHit(ihit1);
Int_t plane1=hit1->GetPlaneIndex();
Double_t tdrift1 = hit1->GetTime();
for(Int_t ihit2=ihit1+1;ihit2<startnum;ihit2++) {
THcDCHit* hit2 = sp->GetHit(ihit2);
Int_t plane2=hit2->GetPlaneIndex();
Double_t tdrift2 = hit2->GetTime();
if(plane1 == plane2) {
if(tdrift1 > tdrift2) {
goodhit[ihit1] = 0;
} else {
goodhit[ihit2] = 0;
}
// if (fhdebugflagpr) cout << " Rejecting hit " << ihit1 << " " << tdrift1 << " " << ihit2 << " " << tdrift2 << endl;
}
}
}
// Gather the remaining hits
Int_t finalnum = 0;
for(Int_t ihit=0;ihit<startnum;ihit++) {
THcDCHit* hit = sp->GetHit(ihit);
// if (fhdebugflagpr) cout << " good hit = "<< ihit << " " << goodhit[ihit] << " time = " << hit->GetTime() << endl;
if(goodhit[ihit] > 0) { // Keep this hit
if (ihit > finalnum) { // Move hit
sp->ReplaceHit(finalnum++, sp->GetHit(ihit));
} else {
finalnum++ ;
}
sp->SetNHits(finalnum);
// if (fhdebugflagpr) cout << " choose single hit start # of hits = " << startnum << " final # = " <<finalnum << endl;
}
//_____________________________________________________________________________
// Generic
void THcDriftChamber::SelectSpacePoints()
// This routine goes through the list of space_points and space_point_hits
// found by find_space_points and only accepts those with
// number of hits > min_hits
// number of combinations > min_combos
{
Int_t sp_count=0;
for(Int_t isp=0;isp<fNSpacePoints;isp++) {
// Include fEasySpacePoint because ncombos not filled in
THcSpacePoint* sp = (THcSpacePoint*)(*fSpacePoints)[isp];
// if (fhdebugflagpr) cout << " looping sp points " << sp->GetCombos() << " " << fMinCombos << " " << fEasySpacePoint << " " << sp->GetNHits() << " " << fMinHits << endl;
if(sp->GetCombos() >= fMinCombos || fEasySpacePoint) {
if(sp->GetNHits() >= fMinHits) {
Mark Jones
committed
if(isp > sp_count) {
// (*fSpacePoints)[sp_count] = (*fSpacePoints)[isp];
THcSpacePoint* sp1 = (THcSpacePoint*)(*fSpacePoints)[sp_count];
//if (fhdebugflagpr) cout << " select space pt = " << isp << endl;
Mark Jones
committed
sp1->Clear();
Double_t xt,yt;
xt=sp->GetX();
yt=sp->GetY();
sp1->SetXY(xt, yt);
Mark Jones
committed
for(Int_t ihit=0;ihit<sp->GetNHits();ihit++) {
THcDCHit* hit = sp->GetHit(ihit);
sp1->AddHit(hit);
}
}
// if(sp_count < fNSpacePoints) if (fhdebugflagpr) cout << "Reduced from " << fNSpacePoints << " to " << sp_count << " space points" << endl;
Mark Jones
committed
for(Int_t isp=0;isp<fNSpacePoints;isp++) {
THcSpacePoint* sp = (THcSpacePoint*)(*fSpacePoints)[isp];
//if (fhdebugflagpr) cout << " sp pt = " << isp+1 << " # of hits = " << sp->GetNHits() << endl;
Mark Jones
committed
for(Int_t ihit=0;ihit<sp->GetNHits();ihit++) {
THcDCHit* hit = sp->GetHit(ihit);
THcDriftChamberPlane* plane=hit->GetWirePlane();
// if (fhdebugflagpr) cout << ihit+1 << "selecting " << plane->GetPlaneNum() << " " << plane->GetChamberNum() << " " << hit->GetTime() << " " << hit->GetDist() << " " << plane->GetCentralTime() << " " << plane->GetDriftTimeSign() << endl;
Mark Jones
committed
}
}
Stephen A. Wood
committed
void THcDriftChamber::CorrectHitTimes()
{
// Use the rough hit positions in the chambers to correct the drift time
// for hits in the space points.
// Assume all wires for a plane are read out on the same side (l/r or t/b).
// If the wire is closer to horizontal, read out left/right. If nearer
// vertical, assume top/bottom. (Note, this is not always true for the
// SOS u and v planes. They have 1 card each on the side, but the overall
// time offset per card will cancel much of the error caused by this. The
// alternative is to check by card, rather than by plane and this is harder.
//if (fhdebugflagpr) cout << "In correcthittimes fNSpacePoints = " << fNSpacePoints << endl;
Stephen A. Wood
committed
for(Int_t isp=0;isp<fNSpacePoints;isp++) {
THcSpacePoint* sp = (THcSpacePoint*)(*fSpacePoints)[isp];
Double_t x = sp->GetX();
Double_t y = sp->GetY();
for(Int_t ihit=0;ihit<sp->GetNHits();ihit++) {
THcDCHit* hit = sp->GetHit(ihit);
Stephen A. Wood
committed
THcDriftChamberPlane* plane=hit->GetWirePlane();
// How do we know this correction only gets applied once? Is
// it determined that a given hit can only belong to one space point?
Double_t time_corr = plane->GetReadoutX() ?
y*plane->GetReadoutCorr()/fWireVelocity :
x*plane->GetReadoutCorr()/fWireVelocity;
Stephen A. Wood
committed
// if (fhdebugflagpr) cout << "Correcting hit " << hit << " " << plane->GetPlaneNum() << " " << isp << "/" << ihit << " " << x << "," << y << endl;
// Fortran ENGINE does not do this check, so hits can get "corrected"
// multiple times if they belong to multiple space points.
// To reproduce the precise ENGINE behavior, remove this if condition.
if(fFixPropagationCorrection==0) { // ENGINE behavior
hit->SetTime(hit->GetTime() - plane->GetCentralTime()
+ plane->GetDriftTimeSign()*time_corr);
hit->ConvertTimeToDist();
// hit->SetCorrectedStatus(1);
} else {
// New behavior: Save corrected distance with the hit in the space point
// so that the same hit can have a different correction depending on
// which space point it is in.
//
// This is a hack now because the converttimetodist method is connected to the hit
// so I compute the corrected time and distance, and then restore the original
// time and distance. Can probably add a method to hit that does a conversion on a time
// but does not modify the hit data.
Double_t time=hit->GetTime();
Double_t dist=hit->GetDist();
hit->SetTime(time - plane->GetCentralTime()
+ plane->GetDriftTimeSign()*time_corr);
hit->ConvertTimeToDist();
sp->SetHitDist(ihit, hit->GetDist());
hit->SetTime(time); // Restore time
hit->SetDist(dist); // Restore distance
}
Stephen A. Wood
committed
}
}
}
UInt_t THcDriftChamber::Count1Bits(UInt_t x)
// From http://graphics.stanford.edu/~seander/bithacks.html
x = x - ((x >> 1) & 0x55555555);
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
return (((x + (x >> 4)) & 0x0F0F0F0F) * 0x01010101) >> 24;