#include <TGoodRun.h>

Inheritance diagram for Root::TGoodRun:

Collaboration diagram for Root::TGoodRun:

Classes
struct	SorterL2H

Public Member Functions
	TGoodRun ()

	TGoodRun (const Int_t &runnr)

virtual	~TGoodRun ()

	TGoodRun (const Root::TGoodRun &other)

TGoodRun &	operator= (const TGoodRun &other)

const Root::TGoodRun	GetOverlapWith (const TGoodRun &other) const

const Root::TGoodRun	GetSumWith (const TGoodRun &other) const

const Root::TGoodRun	GetPartOnlyIn (const TGoodRun &other) const

const Root::TGoodRun	GetPartNotIn (const TGoodRun &other) const

Bool_t	IsEmpty () const

Bool_t	HasLB (const Int_t &lumiblocknr) const

std::vector< Root::TLumiBlockRange >::iterator	Find (const Int_t &lumiblocknr)

std::vector< Root::TLumiBlockRange >::const_iterator	Find (const Int_t &lumiblocknr) const

Int_t	GetRunNumber () const

void	SetRunNumber (const Int_t &runnr)

void	Summary () const

void	Sort ()

void	Compress ()

void	AddLB (const Int_t &lumiblocknr)

Public Attributes
T	elements
	STL member. More...

Private Attributes
Int_t	m_runnr

Detailed Description

Definition at line 27 of file TGoodRun.h.

Constructor & Destructor Documentation

◆ TGoodRun() [1/3]

Root::TGoodRun::TGoodRun ( )

◆ TGoodRun() [2/3]

Root::TGoodRun::TGoodRun ( const Int_t & runnr )

Definition at line 22 of file TGoodRun.cxx.

   : std::vector<TLumiBlockRange>()
   , TObject()
   , m_runnr(runnr)
 {
 }

◆ ~TGoodRun()

Root::TGoodRun::~TGoodRun ( )

virtual

Definition at line 30 of file TGoodRun.cxx.

31 {

32 }

◆ TGoodRun() [3/3]

Root::TGoodRun::TGoodRun ( const Root::TGoodRun & other )

Definition at line 35 of file TGoodRun.cxx.

   : std::vector<TLumiBlockRange>(other)
   , TObject(other)
   , m_runnr(other.m_runnr)
 {
 }

Member Function Documentation

◆ AddLB()

void Root::TGoodRun::AddLB ( const Int_t & lumiblocknr )

Definition at line 266 of file TGoodRun.cxx.

 {
   if ( lumiblocknr<0 ) return;
   if ( this->HasLB(lumiblocknr) ) return;
  
   // add at end
   std::vector< TLumiBlockRange >::iterator eitr = this->Find(lumiblocknr-1);
   if (eitr!=this->end()) { 
     eitr->SetEnd(lumiblocknr);
     this->Compress();
     return;
   } 
   // add at beginning
   std::vector< TLumiBlockRange >::iterator bitr = this->Find(lumiblocknr+1);
   if (bitr!=this->end()) {
     bitr->SetBegin(lumiblocknr);
     this->Compress();
     return;
   } 
   // add as new range 
   this->push_back(Root::TLumiBlockRange(lumiblocknr,lumiblocknr)); 
   this->Sort();
   return;
 }

◆ Compress()

void Root::TGoodRun::Compress ( )

Definition at line 200 of file TGoodRun.cxx.

 {
   // this function throws away redundant lb ranges.
  
   // need to be sure goodrun is sorted in lumiblock ranges
   this->Sort();
  
   std::vector<TLumiBlockRange>::iterator itr, cbegin, cend;
   int fbegin(-1), /* fend(-1), */ tbegin(-1), tend(-1), lbegin(-1), lend(-1);
  
   for (itr=this->begin(); itr!=this->end();) {
     cbegin = itr;
     cend = itr;
  
     // first lumiblock of merge
     fbegin = cbegin->Begin();
     //fend = cbegin->End();
  
     // search all connecting lumi ranges
     bool go_on(true);
     for (++itr; itr!=this->end() && go_on; ++itr) {
       tbegin = cend->Begin();
       tend   = cend->End();
       lbegin = itr->Begin();
       lend   = itr->End();
       if ( lbegin>=tbegin && lend>=tend ) { // should always be true
         if (tend+1<lbegin) { go_on=false; }
         else { cend = itr; }
       } 
     }
  
     // reset iterator
     itr=cend; ++itr;
  
     if (cbegin!=cend) {
       // first lumiblock of merge
       fbegin = cbegin->Begin();
       //fend = cbegin->End();
       // last lumiblock of merge
       lbegin = cend->Begin();
       lend = cend->End();
       // remove [cbegin,itr)
       itr = this->erase(cbegin,itr); 
       // insert merge lbrange before itr
       this->insert(itr,Root::TLumiBlockRange(fbegin,lend));
     }
   }
 }

◆ Find() [1/2]

std::vector< Root::TLumiBlockRange >::iterator Root::TGoodRun::Find ( const Int_t & lumiblocknr )

Definition at line 149 of file TGoodRun.cxx.

 {
   std::vector<TLumiBlockRange>::iterator itr = this->begin();
  
   Bool_t pass(kFALSE);
   for (; itr!=this->end(); ++itr) {
     pass = itr->Contains(lumiblocknr) ;
     if (pass) break;
   }
  
   return itr;
 }

◆ Find() [2/2]

std::vector< Root::TLumiBlockRange >::const_iterator Root::TGoodRun::Find ( const Int_t & lumiblocknr ) const

Definition at line 164 of file TGoodRun.cxx.

 {
   std::vector<TLumiBlockRange>::const_iterator itr = this->begin();
  
   Bool_t pass(kFALSE);
   for (; itr!=this->end(); ++itr) {
     pass = itr->Contains(lumiblocknr) ;
     if (pass) break;
   }
  
   return itr;
 }

◆ GetOverlapWith()

const Root::TGoodRun Root::TGoodRun::GetOverlapWith ( const TGoodRun & other ) const

Definition at line 57 of file TGoodRun.cxx.

 {
   Int_t runnr = ( this->GetRunNumber()==other.GetRunNumber() ? this->GetRunNumber() : -1 ) ;
  
   Root::TGoodRun overlaprun(runnr);
   if (runnr==-1) return overlaprun; // no overlap -> empty overlap
  
   std::vector<Root::TLumiBlockRange>::const_iterator itr1 = this->begin();
   std::vector<Root::TLumiBlockRange>::const_iterator itr2 = other.begin();
  
   for (; itr1!=this->end(); ++itr1) {
     for (itr2=other.begin(); itr2!=other.end(); ++itr2) {
       const Root::TLumiBlockRange lbr = itr1->GetOverlapWith(*itr2) ;
       if (!lbr.IsEmpty()) overlaprun.push_back(lbr);
     }
   } 
  
   return overlaprun;
 }

◆ GetPartNotIn()

const Root::TGoodRun Root::TGoodRun::GetPartNotIn ( const TGoodRun & other ) const

Definition at line 108 of file TGoodRun.cxx.

 {
   Root::TGoodRun notinother(*this);
  
   if (this->GetRunNumber()==other.GetRunNumber()) {
  
     Root::TGoodRun tmprun(this->GetRunNumber());
     std::vector<Root::TLumiBlockRange>::const_iterator itro,itrt,lbvecitr;
  
     for (itro=other.begin(); itro!=other.end(); ++itro) {
       tmprun.clear();
       for (itrt=notinother.begin(); itrt!=notinother.end(); ++itrt) {
         std::vector<Root::TLumiBlockRange> lbvec = itrt->GetPartNotIn(*itro);
         for (lbvecitr=lbvec.begin(); lbvecitr!=lbvec.end(); ++lbvecitr) 
           tmprun.push_back(*lbvecitr);
       }
       notinother=tmprun;
     }
   } 
  
   return notinother;
 }

◆ GetPartOnlyIn()

const Root::TGoodRun Root::TGoodRun::GetPartOnlyIn ( const TGoodRun & other ) const

Definition at line 101 of file TGoodRun.cxx.

 {
   return other.GetPartNotIn(*this);
 }

◆ GetRunNumber()

Int_t Root::TGoodRun::GetRunNumber ( ) const

inline

Definition at line 52 of file TGoodRun.h.

56 {

◆ GetSumWith()

const Root::TGoodRun Root::TGoodRun::GetSumWith ( const TGoodRun & other ) const

Definition at line 79 of file TGoodRun.cxx.

 {
   Int_t runnr = ( this->GetRunNumber()==other.GetRunNumber() ? this->GetRunNumber() : -1 ) ;
  
   Root::TGoodRun sumrun(runnr);
   if (runnr==-1) return sumrun; // only add runs with same runnumber
  
   Root::TGoodRun overlap     = this->GetOverlapWith(other);
   Root::TGoodRun onlyinother = this->GetPartOnlyIn(other);
   Root::TGoodRun notinother  = this->GetPartNotIn(other);
  
   std::vector<Root::TLumiBlockRange>::const_iterator itr;
   for (itr=overlap.begin(); itr!=overlap.end(); ++itr) sumrun.push_back(*itr);
   for (itr=onlyinother.begin(); itr!=onlyinother.end(); ++itr) sumrun.push_back(*itr);
   for (itr=notinother.begin(); itr!=notinother.end(); ++itr) sumrun.push_back(*itr);
   sumrun.Sort();     // sort lb ranges
  
   return sumrun;
 }

◆ HasLB()

Bool_t Root::TGoodRun::HasLB ( const Int_t & lumiblocknr ) const

Definition at line 133 of file TGoodRun.cxx.

 {
   std::vector<TLumiBlockRange>::const_iterator itr = this->begin();
   std::vector<TLumiBlockRange>::const_iterator end = this->end();
  
   Bool_t pass(kFALSE);
   for (; itr!=end; ++itr) {
     pass = pass || itr->Contains(lumiblocknr) ;
     if (pass) break;
   }
  
   return pass;
 }

◆ IsEmpty()

Bool_t Root::TGoodRun::IsEmpty ( ) const

Definition at line 251 of file TGoodRun.cxx.

 {
   if (this->GetRunNumber()<0) return kTRUE;
   if (this->empty()) return kTRUE;
  
   Bool_t isEmpty(kTRUE);
   std::vector< TLumiBlockRange >::const_iterator litr = this->begin();
   for (; litr!=this->end() && isEmpty; ++litr)
     isEmpty = isEmpty && litr->IsEmpty();
  
   return isEmpty;
 }

◆ operator=()

Root::TGoodRun & Root::TGoodRun::operator= ( const TGoodRun & other )

Definition at line 44 of file TGoodRun.cxx.

 {
   if (&other==this) {
     return *this ;
   } 
   std::vector<TLumiBlockRange>::operator=(other);
   m_runnr = other.m_runnr;
  
   return *this ;
 }

◆ SetRunNumber()

void Root::TGoodRun::SetRunNumber ( const Int_t & runnr )

inline

Definition at line 53 of file TGoodRun.h.

56 {

◆ Sort()

void Root::TGoodRun::Sort ( )

Definition at line 193 of file TGoodRun.cxx.

 {
   std::sort(this->begin(),this->end(),SorterL2H());
 }

◆ Summary()

void Root::TGoodRun::Summary ( ) const

Definition at line 179 of file TGoodRun.cxx.

 {
   Root::TMsgLogger m_logger("TGoodRun");
   m_logger << kINFO << "Run: " << m_runnr << GEndl;
  
   std::vector<TLumiBlockRange>::const_iterator itr = this->begin();
   std::vector<TLumiBlockRange>::const_iterator end = this->end();
  
   for (; itr!=end; ++itr)
     itr->Summary() ;
 }

Member Data Documentation

◆ elements

T std::vector< T >::elements

inherited

STL member.

◆ m_runnr

Int_t Root::TGoodRun::m_runnr

private

Definition at line 63 of file TGoodRun.h.

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

Classes

Public Member Functions

Public Attributes

Private Attributes