PMT_choice.hh

Go to the documentation of this file.

#ifndef __PMTCHOICE__
#define __PMTCHOICE__
 
 
using namespace std;
 
 
/**
 * \author rgruiz
 */
 
struct pmt_clusters_top{
 
  vector < int > top_a = {0,4};
 
  vector < int > top_b = {3} ;
 
  vector < int > top_c = {2 , 6} ;
 
  vector < int > top_d = {5 , 8} ;
 
  vector < int > top_e = {10 , 1} ;
 
  vector < int > top_f = {9 , 7 , 11} ;
 
};
 
 
struct pmt_clusters_bottom{
 
  vector < int > bottom_a = {22} ;
 
  vector < int > bottom_b = {14 , 18 , 19 , 24 , 25 , 26} ;
 
  vector < int > bottom_c = {13 , 17 , 20 , 21 , 28 , 29} ;
 
  vector < int > bottom_d = {12 , 15 , 16 , 23 , 27 , 30} ;
 
};
 
 
/**
 * Select the PMTs in the upper hemisphere of a DOM.
 *
 * \param option user choice
 * \return vector with chosen pmts
 */
inline vector < int > setTopPMTs(int option){
  
  vector < int > topPMTs ;
  
  pmt_clusters_top t ;
 
  switch(option){
      
  case 1 :
    
    topPMTs.insert(topPMTs.end(), t.top_a.begin(), t.top_a.end());
    
    break;
    
  case 2 :
    
    topPMTs.insert(topPMTs.end(), t.top_a.begin(), t.top_a.end());
    
    topPMTs.insert(topPMTs.end(), t.top_b.begin(), t.top_b.end());
    
    break;
    
  case 3 :
    
    topPMTs.insert(topPMTs.end(), t.top_a.begin(), t.top_a.end());
    
    topPMTs.insert(topPMTs.end(), t.top_b.begin(), t.top_b.end());
    
    topPMTs.insert(topPMTs.end(), t.top_c.begin(), t.top_c.end());
    
    topPMTs.insert(topPMTs.end(), t.top_d.begin(), t.top_d.end());
    
    topPMTs.insert(topPMTs.end(), t.top_e.begin(), t.top_e.end());
    
    topPMTs.insert(topPMTs.end(), t.top_f.begin(), t.top_f.end());
    
    break;
    
  }
  
  return topPMTs ;
 
}
 
 
 
/**
 * Select the PMTs in the lower hemisphere of a DOM.
 *
 * \param option user choice
 * \return vector with chosen pmts
 */
inline vector < int > setBottomPMTs(int option){
  
  vector < int > bottomPMTs ;
 
  pmt_clusters_bottom b ;
 
  switch(option){
    
  case 1 :
    
    bottomPMTs.insert(bottomPMTs.end(), b.bottom_a.begin(), b.bottom_a.end());
 
    break;
 
  case 2 :
 
    bottomPMTs.insert(bottomPMTs.end(), b.bottom_a.begin(), b.bottom_a.end());
 
    bottomPMTs.insert(bottomPMTs.end(), b.bottom_b.begin(), b.bottom_b.end());
 
    break;
 
  case 3 :
 
    bottomPMTs.insert(bottomPMTs.end(), b.bottom_a.begin(), b.bottom_a.end());
 
    bottomPMTs.insert(bottomPMTs.end(), b.bottom_b.begin(), b.bottom_b.end());
 
    bottomPMTs.insert(bottomPMTs.end(), b.bottom_c.begin(), b.bottom_c.end());
 
    break;
 
  case 4 :
 
    bottomPMTs.insert(bottomPMTs.end(), b.bottom_a.begin(), b.bottom_a.end());
 
    bottomPMTs.insert(bottomPMTs.end(), b.bottom_b.begin(), b.bottom_b.end());
 
    bottomPMTs.insert(bottomPMTs.end(), b.bottom_c.begin(), b.bottom_c.end());
 
    bottomPMTs.insert(bottomPMTs.end(), b.bottom_d.begin(), b.bottom_d.end());
 
    break;
 
  } 
 
  return bottomPMTs ;
 
}
 
 
#endif