ClusterListKG.cxx

Go to the documentation of this file.

// Cluster3D package
//
// ClusterListKG.cxx
//
// ClusterListKG - list of clusters
//
// Author:  Katarzyna Grzelak K.Grzelak1@physics.ox.ac.uk
//
#include <algorithm>

#include "Cluster3D/ClusterListKG.h"
#include "Algorithm/AlgConfig.h"
#include "MessageService/MsgService.h" // needed for CVS
#include "Cluster3D/ClusterKG.h"
#include "Cluster3D/CellKG.h"
#include "Cluster3D/StripListKG.h"
#include "Cluster3D/CellListKG.h"

ClassImp(ClusterListKG)

CVSID("$Id: ClusterListKG.cxx,v 1.4 2009/02/28 21:46:11 gmieg Exp $");

ClusterListKG::ClusterListKG():energyRaw(0.),energyPe(0.),energyGeV(0.){
//
//  Purpose:  Default constructor
//
}

//............................................................................

void ClusterListKG::GetClusters(vector<ClusterKG> &allclust){
//
//  Purpose:  Return STL vector of clusters
//
//  Arguments: 
//              
//  Return:  n/a
//
//  Contact:   K.Grzelak1@physics.ox.ac.uk
//
//
//  Program Notes:-
//  =============
//
    allclust=allclsts;
}

//............................................................................

UInt_t ClusterListKG::GetNClusters(){
//
//  Purpose:  Return number of clusters
//
//  Arguments: n/a
//              
//  Return:  UInt_t number of clusters
//
//  Contact:   K.Grzelak1@physics.ox.ac.uk
//
//
//  Program Notes:-
//  =============
//
  return allclsts.size();

}

//............................................................................

void ClusterListKG::SetEnergy(){
//
//  Purpose:  Calculate total reconstructed energy
//
//  Arguments: n/a
//
//  Return:  n/a
//
//  Contact:   K.Grzelak1@physics.ox.ac.uk
//
//
//  Program Notes:-
//  =============
//
  for(UInt_t i=0; i<allclsts.size(); ++i){
    energyRaw=energyRaw+allclsts[i].GetEnergy(0);
    energyPe=energyPe+allclsts[i].GetEnergy(1);    
  }
}

//............................................................................

Double_t ClusterListKG::GetEnergy(Int_t whatKind){
//
//  Purpose:  Return total reconstructed energy
//
//  Arguments: 
//            whatKind in - raw energy, energy in pe's .... ?
//              
//  Return:  Double_t energy
//
//  Contact:   K.Grzelak1@physics.ox.ac.uk
//
//
//  Program Notes:-
//  =============
//

  if(whatKind==0){
    return energyRaw;
  }
  else if(whatKind==1){
    return energyPe;
  }
  else if(whatKind==2){
    return energyGeV;
  }
  else{
    return energyPe;
  }

//  return energyPe;
}

//............................................................................

void ClusterListKG::CreateClusters(AlgConfig &ac, StripListKG &all1, CellListKG &all2){
//
//  Purpose:  Create clusters
//
//  Arguments: 
//              
//  Return:  n/a
//
//  Contact:   K.Grzelak1@physics.ox.ac.uk
//
//
//  Program Notes:-
//  =============
//

  const Int_t planeDist = ac.GetInt("plnDist");
  const Int_t stripDist = ac.GetInt("stpDist");
 
  vector <Int_t> arr1[200];

  vector<Int_t> marked;

  vector<Int_t> left;

  std::vector<Int_t>::iterator pos; 

  Int_t allc = all2.GetNCells();

  for(Int_t jj=0;jj<allc;++jj){
    marked.push_back(0);
    left.push_back(jj);
  }

  Int_t notMarked=allc;

  
  MSG("Cluster3D", Msg::kDebug)
    << "notMarked = " << notMarked << endl;

  Int_t iclust=-1;
  Int_t icell=0;

  // do while the amount of not marked cells !=0
  while(notMarked!=0){
    bool neighbours=true;
    
    ++iclust;

    MSG("Cluster3D", Msg::kDebug)
    << "i-th cluster = " << iclust << endl;

    MSG("Cluster3D", Msg::kDebug)
      << "icell= " << icell << endl;

    icell=left[0]; 

    arr1[iclust].push_back(icell);

    MSG("Cluster3D", Msg::kDebug)
      << "all2.GetCellIndex(icell)= " << all2.GetCellIndex(icell)
        << "all2.GetCellPlane(icell)= " << all2.GetCellPlane(icell) << endl;

    pos=find(left.begin(),left.end(),icell);
      
    if (pos != left.end()){
       left.erase(pos);
    }
            
    marked[icell]=1;
    --notMarked;

    // while not checked neighbours exist

    Int_t icolu=-1;
    while(neighbours){
      ++icolu;
      // for every cell, check if it has neighbours
 
      for(Int_t kk=icell+1;kk<allc;++kk){

        if(marked[kk]==0){

          if(all2.IsNeighbour(arr1[iclust][icolu],kk,planeDist,stripDist)){ 

            marked[kk]=1;
            --notMarked;

           MSG("Cluster3D", Msg::kDebug)
             << "all2.GetCellIndex(kk)= " << all2.GetCellIndex(kk) 
             << "all2.GetCellPlane(kk)= " << all2.GetCellPlane(kk) << endl;
          

            arr1[iclust].push_back(kk);

            pos=find(left.begin(),left.end(),kk);
      
            if (pos != left.end()){
              left.erase(pos);
            }            
          }       
        } 
      }       
      if(icolu==((Int_t)arr1[iclust].size()-1) || notMarked==0) {
         neighbours=false;
      }
    }
  }

  MSG("Cluster3D", Msg::kDebug)
   << "CreateClusters: Number of clusters= " << (iclust+1) << endl;

  ClusterKG ctmp;
  for(Int_t ii=0; ii<(iclust+1); ++ii){
  MSG("Cluster3D", Msg::kDebug)
   << "arr1[ii].size()= " << arr1[ii].size() << endl;     
    if(ctmp.Create(ac,all1,all2,arr1[ii])){
      allclsts.push_back(ctmp);
    } 
  }
}

---