RoiUtil.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
	RoiUtil

Functions
bool	RoiUtil::contains (const IRoiDescriptor &roi, double z0, double dzdr)
	see whether a segment is contained within the roi in r-z More...
bool	RoiUtil::contains_zrange (const IRoiDescriptor &roi, double z0, double dzdr, double zmin, double zmax)
bool	RoiUtil::contains (const IRoiDescriptor &roi, double z, double r, double phi)
	see whether a point is contained within the roi (in phi and r-z) More...
bool	RoiUtil::containsPhi (const IRoiDescriptor &roi, double phi)
	test whether a stub is contained within the roi More...
bool	RoiUtil::containsZed (const IRoiDescriptor &roi, double z, double r)
double	RoiUtil::phicheck (double phi)
	basic range checkers More...
double	RoiUtil::etacheck (double eta)
double	RoiUtil::zedcheck (double zed)
bool	operator== (const IRoiDescriptor &roi0, const IRoiDescriptor &roi1)
bool	operator!= (const IRoiDescriptor &roi0, const IRoiDescriptor &roi1)

Function Documentation

operator!=()

bool operator!=	(	const IRoiDescriptor &	roi0,
		const IRoiDescriptor &	roi1
	)

Definition at line 190 of file RoiUtil.cxx.

{ return !(roi0==roi1); } 

operator==()

bool operator==	(	const IRoiDescriptor &	roi0,
		const IRoiDescriptor &	roi1
	)

trivial self comparison

same compositness ?

not composite

check full scan - all non-composite full scan rois are equivalent

check geometry

Fixme: naive phi differwnce - should test for the phi=pi boundary for the case of very close angles but wrapped differently

check constituents

Definition at line 149 of file RoiUtil.cxx.

                                                                           { 
  
  if ( &roi0 == &roi1 ) return true;
 
  if ( roi0.composite() != roi1.composite() ) return false;
 
  if ( !roi0.composite() ) { 
 
    if ( roi0.isFullscan() != roi1.isFullscan() ) return false;
    if ( roi0.isFullscan() ) return true;
 
    if ( std::fabs(roi0.zed()     -roi1.zed()     )>1e-7 ) return false;
    if ( std::fabs(roi0.zedPlus() -roi1.zedPlus() )>1e-7 ) return false;
    if ( std::fabs(roi0.zedMinus()-roi1.zedMinus())>1e-7 ) return false;
   
    if ( std::fabs(roi0.eta()     -roi1.eta()     )>1e-7 ) return false;
    if ( std::fabs(roi0.etaPlus() -roi1.etaPlus() )>1e-7 ) return false;
    if ( std::fabs(roi0.etaMinus()-roi1.etaMinus())>1e-7 ) return false;
 
    if ( std::fabs(roi0.phi()     -roi1.phi()    ) >1e-7 ) return false;
    if ( std::fabs(roi0.phiPlus() -roi1.phiPlus()) >1e-7 ) return false;
    if ( std::fabs(roi0.phiMinus()-roi1.phiMinus())>1e-7 ) return false;
  } 
  else { 
    if ( roi0.size() != roi1.size() ) return false;
    for ( unsigned i=roi0.size() ; i-- ; ) if ( !( *roi0.at(i) == *roi1.at(i) ) ) return false;  
  }
  
  return true;
}