JTRIGGER Namespace Reference

Trigger algorithms and support classes. More...

Classes
class	JBinder2nd
	Auxiliary class to convert binary JMatch operator and given hit to unary match operator. More...
struct	JBuildHelper
	Auxiliary class to extend hit building functionality to all DAQ data types. More...
class	JBuildL0
	Template L0 hit builder. More...
class	JBuildL0< JHitL0 >
	Template specialisation of L0 builder for JHitL0 data type. More...
struct	JBuildL1Parameters
	Auxiliary data structure for L1 build parameters. More...
class	JBuildL1
	Template L1 hit builder. More...
class	JBuildL1< JHitL1 >
	Template specialisation of L1 builder for JHitL1 data type. More...
class	JBuildL1< JHitR1 >
	Template specialisation of L1 builder for JHitR1 data type. More...
class	JBuildL2
	Template L2 builder. More...
class	JBuildL2< JHitL2 >
	Template specialisation of L2 builder for JHitL1 data type. More...
class	JBuildL2< JHitR2 >
	Template specialisation of L2 builder for JHitR1 data type. More...
class	JClone
	Clone of a container. More...
class	JDOMToPMTMaskMap
class	JEvent
	Triggered event. More...
class	JEventOverlap
	Match of two events considering overlap in time. More...
class	JFrame
	Data frame for calibrated hits of one PMT. More...
class	JFrameClone
	Clone of JFrame. More...
struct	JGetRiseTime
	Auxiliary class for rise time evaluation. More...
class	JHit
	Hit data structure. More...
struct	JMatch_t
	Auxiliary class to check whether two consecutive hits should be joined. More...
class	JHitL0
	Data structure for L0 hit. More...
class	JHitL1
	Data structure for L1 hit. More...
class	JHitR0
	Reduced data structure for L0 hit. More...
class	JHitR1
	Reduced data structure for L1 hit. More...
struct	JHitToolkit
	Template definition of hit toolkit. More...
struct	JHitToolkit< JHit, false >
	Template specialisation of hit toolkit for JHit class. More...
struct	JHitToolkit< JHitR0, false >
	Template specialisation of hit toolkit for JHit class. More...
struct	JHitToolkit< JHit_t, true >
	Template specialisation of hit toolkit for any primitive data type. More...
class	JMatch
	Function object interface for hit matching. More...
class	JMatchHelper
	Auxiliary class to handle pointer to match function. More...
class	JMatch1D
	1D match criterion. More...
class	JMatch3B
	3D match criterion with road width. More...
class	JMatch3D
	3D match criterion. More...
class	JMatch3G
	3G match criterion. More...
struct	JModuleCounter
	Auxiliary class for counting unique modules. More...
struct	JModuleHeader
	Header for Module. More...
struct	JParametersHelper
	Wrapper class to share parameters. More...
struct	JPMTHeader
	Header for PMT. More...
class	JPMTMask
	Auxiliary class for pmt mask. More...
class	JPrescaler
	Auxiliary class for prescaling. More...
struct	JRunByRun
	Auxiliary class to handle run by run options. More...
class	JSummaryRouter
	Router for fast addressing of summary data in JDAQSummaryslice data structure as a function of the optical module identifier. More...
class	JSuperFrame1D
	1-dimensional frame with time calibrated data from one optical module. More...
class	JSuperFrame2D
	2-dimensional frame with time calibrated data from one optical module. More...
class	JSuperFrameClone1D
	Clone of JSuperFrame1D. More...
class	JSuperFrameClone2D
	Clone of JSuperFrame2D. More...
class	JTimeConverter
	Auxiliary class to convert DAQ/trigger hit time to/from Monte Carlo hit time. More...
class	JTimeslice
	Time slice with calibrated data. More...
class	JTimesliceClone
	Clone of JTimeslice. More...
class	JTimesliceL1
	Auxiliary class to build JDAQTimeslice for L1 timeslice. More...
class	JTimesliceRouter
	Router for fast addressing of hits in KM3NETDAQ::JDAQTimeslice data structure as a function of the optical module identifier and time. More...
class	JTrigger3D
	General purpose majority trigger. More...
class	JTrigger3DMuon
	Muon trigger. More...
struct	JTrigger3DMuon_t
	Muon trigger parameters. More...
class	JTrigger3DShower
	Shower trigger. More...
struct	JTrigger3DShower_t
	Shower trigger parameters. More...
class	JTrigger3N
	General purpose muon trigger. More...
class	JTriggeredEvent
	Auxiliary class to build JDAQEvent for a triggered event. More...
class	JTriggeredHit
	Data structure for triggered hit. More...
class	JTriggerException
	General exception. More...
class	JTriggerInput
	Data structure for input to trigger algorithm. More...
class	JTriggerInterface
	Trigger interface. More...
struct	JTriggerBit
	This class is used to map trigger class to trigger bit. More...
struct	JAssertBit
	This class will generate a compiler error if trigger bit is out of range. More...
struct	JAssertBit< N, true >
	Implementation of a valid trigger bit. More...
struct	JAttributes
	Module attributes. More...
class	JTriggerMXShower
	Shower trigger. More...
struct	JTriggerMXShower_t
	Shower trigger parameters. More...
class	JTriggerOutput
	Set of triggered events. More...
struct	JL2Parameters
	Data structure for L2 parameters. More...
class	JTriggerParameters
	Data structure for all trigger parameters. More...

Typedefs
typedef JHitL1	JHitL2
	Type definition of L2 hit. More...
typedef JHitR1	JHitR2
	Type definition of R2 hit. More...
typedef unsigned int	JPMTMask_t
	Type definition of pmt mask. More...
typedef unsigned int	JTriggerbit_t
	Type definition of trigger bit. More...

Functions
template<class JHitIterator_t , class JHit_t >
JHitIterator_t	clusterize (JHitIterator_t __begin, JHitIterator_t __end, const JMatch< JHit_t > &match, const int Nmin=1)
	Partition data according given binary match operator. More...
template<class JHitIterator_t , class JHit_t >
JHitIterator_t	clusterize (JHitIterator_t __begin, JHitIterator_t __end, const JMatch< JHit_t > &match, const int Nmin, std::random_access_iterator_tag)
	Implementation of method clusterize for random access iterators. More...
template<class JHitIterator_t , class JHit_t >
JHitIterator_t	reverse_clusterize (JHitIterator_t __begin, JHitIterator_t __end, const JMatch< JHit_t > &match)
	Partition data according given binary match operator. More...
template<class JHitIterator_t , class JHit_t >
JHitIterator_t	reverse_clusterize (JHitIterator_t __begin, JHitIterator_t __end, const JMatch< JHit_t > &match, std::random_access_iterator_tag)
	Implementation of method reverse_clusterize for random access iterators. More...
template<class JHitIterator_t , class JComparator_t , class JHit_t >
JHitIterator_t	clusterize (JHitIterator_t __begin, JHitIterator_t __end, JComparator_t comparator, const JMatch< JHit_t > &match)
	Select best root hit according given comparator and partition remaining data according given binary match operator and this root hit. More...
template<class JHitIterator_t , class JHit_t >
JHitIterator_t	clusterizeWeight (JHitIterator_t __begin, JHitIterator_t __end, const JMatch< JHit_t > &match)
	Partition data according given binary match operator. More...
template<class JHitIterator_t , class JHit_t >
JHitIterator_t	clusterizeWeight (JHitIterator_t __begin, JHitIterator_t __end, const JMatch< JHit_t > &match, std::random_access_iterator_tag)
	Implementation of method clusterizeWeight for random access iterators. More...
template<class JHit_t >
bool	weightSorter (const JHit_t &first, const JHit_t &second)
	Compare two hits by weight. More...
template<class JHit_t >
bool	timeSorter (const JHit_t &first, const JHit_t &second)
	Compare two hits by weight. More...
template<class JHit_t >
JBinder2nd< JHit_t >	JBind2nd (const JMatch< JHit_t > &match, const JHit_t &second)
	Auxiliary method to create JBinder2nd object. More...
bool	operator< (const JEvent &first, const JEvent &second)
	Less than operator for events. More...
JTimeRange	getTimeRange (const JEvent &event)
	Get time range (i.e. More...
bool	operator< (const JHit &first, const JHit &second)
	Less than operator for hits. More...
bool	operator< (const JHit &hit, const double t1)
	Less than operator for hits. More...
bool	operator== (const JHit &first, const JHit &second)
	Equal operator for hits. More...
double	getTime (const JDAQHit &hit, const JCalibration &cal)
	Get calibrated time of DAQ hit. More...
double	getToT (const JDAQHit &hit, const JCalibration &cal)
	Get calibrated time-over-threshold of DAQ hit. More...
template<class JHit_t >
JMatchHelper< JHit_t >	make_match (bool(*match)(const JHit_t &, const JHit_t &))
	Auxiliary method to make JMatch object based on pointer to match function. More...
JPMTMask_t	getPMTMask (const unsigned int bit)
	Convert pmt bit to pmt mask. More...
	setTriggerBit (JTrigger3DShower, 1)
	setTriggerBit (JTriggerMXShower, 2)
	setTriggerBit (JTrigger3DMuon, 4)
bool	operator< (const JTriggeredHit &first, const JTriggeredHit &second)
	Less than operator for triggered hits. More...
bool	operator== (const JTriggeredHit &first, const JTriggeredHit &second)
	Equal operator for triggered hits. More...
std::ostream &	operator<< (std::ostream &out, const JTriggerException &exception)
	Print error message of JTriggerException. More...
template<class JTrigger_t >
JTriggerbit_t	getTriggerBit ()
	Get the trigger bit. More...
template<class JTrigger_t >
JTriggerbit_t	getTriggerBit (const JTrigger_t &event)
	Get the trigger bit. More...
const char *	getTriggerName (JTriggerbit_t bit)
	Get trigger name. More...
void	setAttributes (const JModule &first, const JModule &second, JAttributes &attributes)
	Set module attributes. More...
JTimeRange	getTimeRange (const JTriggerParameters &parameters)
	Get time range of snapshot. More...

Variables
static const JGetRiseTime	getRiseTime
	Function object for rise time evaluation. More...
static const unsigned int	NUMBER_OF_PMT_BITS = 31
	Number of pmt bits. More...

Detailed Description

Trigger algorithms and support classes.

Author

mdejong

rbruijn

Typedef Documentation

typedef JHitL1 JTRIGGER::JHitL2

Type definition of L2 hit.

Definition at line 20 of file JHitL2.hh.

typedef JHitR1 JTRIGGER::JHitR2

Type definition of R2 hit.

Definition at line 20 of file JHitR2.hh.

typedef unsigned int JTRIGGER::JPMTMask_t

Type definition of pmt mask.

Definition at line 30 of file JPMTMask.hh.

typedef unsigned int JTRIGGER::JTriggerbit_t

Type definition of trigger bit.

Definition at line 29 of file JTriggerInterface.hh.

Function Documentation

template<class JHitIterator_t , class JHit_t >

JHitIterator_t JTRIGGER::clusterize ( JHitIterator_t  __begin, JHitIterator_t  __end, const JMatch< JHit_t > &  match, const int  Nmin = 1  )

inline

Partition data according given binary match operator.

The underlying algorithm is known in literature as 'clique'. The result is (likely to be) the maximal sub-set with all elements matched to each other. The complexity is quadratic, i.e. at most (number of elements x number of elements) operations. The algorithm will sort the data such that all clusterized hits are at the front. The return value points the first non clusterized hit.

The template argument JHit_t refers to a data structure which should have the following member methods:

• double getX(); // [m]
• double getY(); // [m]
• double getZ(); // [m]
• double getT(); // [ns]

Parameters

__begin	begin of data
__end	end of data
match	binary match operator
Nmin	minimum cluster size

Returns

end of data

Definition at line 45 of file JAlgorithm.hh.

  {
    return clusterize(__begin, __end, match, Nmin, typename std::iterator_traits<JHitIterator_t>::iterator_category());
  }

template<class JHitIterator_t , class JHit_t >

JHitIterator_t JTRIGGER::clusterize ( JHitIterator_t  __begin, JHitIterator_t  __end, const JMatch< JHit_t > &  match, const int  Nmin, std::random_access_iterator_tag    )

inline

Implementation of method clusterize for random access iterators.

Definition at line 58 of file JAlgorithm.hh.

  {
    const int N = std::distance(__begin, __end);

    if (N >= Nmin) {

      int i, j;
      int n = N;

      JHitIterator_t buffer = __begin;

      // Determine number of associated hits for each hit.
    
      std::vector<int> count(N, 1);      // Assume always a match with itself.
      
      for (i = 0; i != N; ++i) {

        for (j = i; ++j != N; ) {

          if (match(buffer[i], buffer[j])) {

            ++count[i];
            ++count[j];

          } else if (n == Nmin) {

            return __begin;
          }
        }

        if (count[i] < Nmin) {

          --n;

          if (n < Nmin) {
            return __begin;
          }
        }
      }

      n = N;

      // Remove hit with the smallest number of associated hits.
      // This procedure stops when the number of associated hits 
      // is equal to the number of (remaining) hits.
    
      for ( ; n >= Nmin; ) {
      
        j = 0;
      
        for (i = 1; i != n; ++i) {
          if (count[i] < count[j]) {
            j = i;
          }
        }
      
        // Ready?

        if (count[j] == n) {
          break;
        }
      
        // Reduce effective size.

        --n;
      
        // Swap the selected hit to end.

        std::swap(buffer[j], buffer[n]); 
        std::swap(count [j], count [n]);
      
        // Decrease number of associated hits for each associated hit.

        for (i = 0; i != n; ++i) {
          if (match(buffer[i], buffer[n])) {
            --count[i];
          }
        }
      }

      if (n >= Nmin)
        return __begin + n;
      else
        return __begin;
    }
        
    return __begin;
  }

template<class JHitIterator_t , class JHit_t >

JHitIterator_t JTRIGGER::reverse_clusterize ( JHitIterator_t  __begin, JHitIterator_t  __end, const JMatch< JHit_t > &  match  )

inline

Partition data according given binary match operator.

The underlying algorithm is known in literature as reverse 'clique'. The result is (likely to be) the maximal sub-set with all elements matched to each other. The complexity is quadratic, i.e. at most (number of elements x number of elements) operations. The algorithm will sort the data such that all clusterized hits are at the front. The return value points the first non clusterized hit.

The template argument JHit_t refers to a data structure which should have the following member methods:

• double getX(); // [m]
• double getY(); // [m]
• double getZ(); // [m]
• double getT(); // [ns]

Parameters

__begin	begin of data
__end	end of data
match	binary match operator

Returns

end of data

Definition at line 173 of file JAlgorithm.hh.

  {
    return reverse_clusterize(__begin, __end, match, typename std::iterator_traits<JHitIterator_t>::iterator_category());
  }

template<class JHitIterator_t , class JHit_t >

JHitIterator_t JTRIGGER::reverse_clusterize ( JHitIterator_t  __begin, JHitIterator_t  __end, const JMatch< JHit_t > &  match, std::random_access_iterator_tag    )

inline

Implementation of method reverse_clusterize for random access iterators.

Definition at line 185 of file JAlgorithm.hh.

  {
    const int N = std::distance(__begin, __end);

    if (N != 0) {

      int i, j;

      JHitIterator_t buffer = __begin;

      // Determine number of associated hits for each hit.
    
      std::vector<int> count(N, 1);      // Assume always a match with itself.

      for (i = 0; i != N; ++i) {
      
        for (j = 0; j != i; ++j) {
          if (match(buffer[i], buffer[j])) {
            ++count[i];
            ++count[j];
          }
        }
      }

      // Keep hit with the largest number of associated hits.
      // This procedure stops when the number of associated hits is equal to one.
 
      for (int k = 0; ; ) {

        j = k;
      
        for (i = j; ++i != N; ) {
          if (count[i] > count[j]) {
            j = i;
          }
        }
      
        // Ready?

        if (count[j] == 1) {
          return __begin + k;
        }

        // Swap the selected hit to begin.

        std::swap(buffer[j], buffer[k]);
        std::swap(count [j], count [k]);
      
        // Decrease number of associated hits for each associated hit.

        for (i = k; ++i != N; ) {
          if (match(buffer[i], buffer[k])) {
            --count[i];
          }
        }

        // Increase effective size.

        ++k;
      }
    }

    return __begin;
  }

template<class JHitIterator_t , class JComparator_t , class JHit_t >

JHitIterator_t JTRIGGER::clusterize ( JHitIterator_t  __begin, JHitIterator_t  __end, JComparator_t  comparator, const JMatch< JHit_t > &  match  )

inline

Select best root hit according given comparator and partition remaining data according given binary match operator and this root hit.

The complexity is linear, i.e. at most number of elements operations. The complexity is quadratic, i.e. at most (number of elements x number of elements) operations. The algorithm will sort the data such that all clusterized hits are at the front.

Parameters

__begin	begin of data
__end	end of data
comparator	comparator
match	binary match operator

Returns

end of data

Definition at line 268 of file JAlgorithm.hh.

  {
    if (__begin != __end) {

      std::sort(__begin, __end, comparator);
      
      const JHit_t& root = *__begin;

      return std::partition(++__begin, __end, JBind2nd(match, root));

    } else {

      return __end;
    }
  }

template<class JHitIterator_t , class JHit_t >

JHitIterator_t JTRIGGER::clusterizeWeight ( JHitIterator_t  __begin, JHitIterator_t  __end, const JMatch< JHit_t > &  match  )

inline

Partition data according given binary match operator.

The underlying algorithm is known in literature as reverse 'clique'. The result is (likely to be) the maximal sub-set with all elements matched to each other. The complexity is quadratic, i.e. at most (number of elements x number of elements) operations. The algorithm will sort the data such that all clusterized hits are at the front. The return value points the first non clusterized hit.

The template argument JHit_t refers to a data structure which should have the following member methods:

• double getX(); // [m]
• double getY(); // [m]
• double getZ(); // [m]
• double getT(); // [ns]
• double getW(); // [au]

Parameters

__begin	begin of data
__end	end of data
match	binary match operator

Returns

end of data

Definition at line 310 of file JAlgorithm.hh.

  {
    return clusterizeWeight(__begin, __end, match, typename std::iterator_traits<JHitIterator_t>::iterator_category());
  }

template<class JHitIterator_t , class JHit_t >

JHitIterator_t JTRIGGER::clusterizeWeight ( JHitIterator_t  __begin, JHitIterator_t  __end, const JMatch< JHit_t > &  match, std::random_access_iterator_tag    )

inline

Implementation of method clusterizeWeight for random access iterators.

Definition at line 322 of file JAlgorithm.hh.

  {
    if (__begin != __end) {

      const int N = std::distance(__begin, __end);

      int i, j;

      // Determine weight of each hit.

      std::vector<double> weight(N, 0.0);
    
      JHitIterator_t buffer = __begin;

      for (i = 0; i != N; ++i) {
      
        weight[i] += buffer[i].getW();
      
        for (j = i; ++j != N; ) {
        
          if (match(buffer[i], buffer[j])) {
            
            weight[i] += buffer[j].getW();
            weight[j] += buffer[i].getW();
          }
        }
      }

      // Remove hit with the smallest weight of associated hits.
      // This procedure stops when the weight of associated hits
      // is equal to the maximal weight of (remaining) hits.
    
      int    n = N;
      double W;
    
      for ( ; ; ) {
      
        j = 0;
        W = weight[j];

        for (i = 1; i != n; ++i) {

          if (weight[i] < weight[j]) {
            j = i;
          }

          if (weight[i] > W) {
            W = weight[i];
          }
        }
      
        // Ready?
      
        if (weight[j] == W) {
          break;
        }
      
        // Reduce effective size.
      
        --n;
      
        // Swap the selected hit to end.
      
        std::swap(buffer[j], buffer[n]);
        std::swap(weight[j], weight[n]);
      
        // Decrease weight of associated hits for each associated hit.
      
        for (i = 0; i != n; ++i) {
          if (match(buffer[i], buffer[n])) {
            weight[i] -= buffer[n].getW();
          }
        }
      }

      return __begin + n;

    } else {

      return __end;
    }
  }

template<class JHit_t >

bool JTRIGGER::weightSorter ( const JHit_t &  first, const JHit_t &  second  )

inline

Compare two hits by weight.

The template argument JHit_t refers to a data structure which should have the following member methods:

• double getW(); // [a.u.]

Parameters

first	first hit
second	second hit

Returns

true if first hit has larger weight than second; else false

Definition at line 420 of file JAlgorithm.hh.

  {
    return first.getW() > second.getW();
  }

template<class JHit_t >

bool JTRIGGER::timeSorter ( const JHit_t &  first, const JHit_t &  second  )

inline

Compare two hits by weight.

The template argument JHit_t refers to a data structure which should have the following member methods:

• double getT(); // [a.u.]

Parameters

first	first hit
second	second hit

Returns

true if first hit earlier than second; else false

Definition at line 437 of file JAlgorithm.hh.

  {
    return first.getT() < second.getT();
  }

template<class JHit_t >

JBinder2nd<JHit_t> JTRIGGER::JBind2nd ( const JMatch< JHit_t > &  match, const JHit_t &  second  )

inline

Auxiliary method to create JBinder2nd object.

Parameters

match	match operator
second	second hit

Returns

JBinder2nd

Definition at line 70 of file JBind2nd.hh.

  {
    return JBinder2nd<JHit_t>(match, second);
  }

bool JTRIGGER::operator< ( const JEvent &  first, const JEvent &  second  )

inline

Less than operator for events.

The less than operator is applied to the first hit in the events.

Parameters

first	first event
second	second event

Returns

true if first event earliear than second; else false

Definition at line 195 of file JEvent.hh.

  {
    if (first.empty() || second.empty()) {
      throw JTriggerException("Comparison with empty event(s).");
    }

    return first.begin()->getT() < second.begin()->getT();
  }

JTimeRange JTRIGGER::getTimeRange ( const JEvent &  event )

inline

Get time range (i.e.

earlist and latest hit time) of triggered event.

Parameters

event

event

Returns

time range

Definition at line 26 of file JEventToolkit.hh.

  {
    if (!event.empty())
      return JTimeRange(event.begin()->getT(), event.rbegin()->getT());
    else
      return JTimeRange::DEFAULT_RANGE;
  }

bool JTRIGGER::operator< ( const JHit &  first, const JHit &  second  )

inline

Less than operator for hits.

The less than operator is applied to the time of the hits.

Parameters

first	first hit
second	second hit

Returns

true if first hit earlier; else false

Definition at line 231 of file JHit.hh.

  {
    return first.getT() < second.getT();
  }

bool JTRIGGER::operator< ( const JHit &  hit, const double  t1  )

inline

Less than operator for hits.

The less than operator is applied to the time of the hits.

Parameters

hit	hit
t1	time [ns]

Returns

true if hit earlier than t; else false

Definition at line 246 of file JHit.hh.

  {
    return hit.getT() < t1;
  }

bool JTRIGGER::operator== ( const JHit &  first, const JHit &  second  )

inline

Equal operator for hits.

The equal operator is applied to the time of the hits.

Parameters

first	hit
second	hit

Returns

true if first hit time equal to second hit time; else false

Definition at line 261 of file JHit.hh.

  {
    return first.getT() == second.getT();
  }

double JTRIGGER::getTime ( const JDAQHit &  hit, const JCalibration &  cal  )

inline

Get calibrated time of DAQ hit.

Parameters

hit	DAQ hit
cal	calibration

Returns

time [ns]

Definition at line 34 of file JHitToolkit.hh.

  {
    return getTime(hit.getT(), cal);
  }

double JTRIGGER::getToT ( const JDAQHit &  hit, const JCalibration &  cal  )

inline

Get calibrated time-over-threshold of DAQ hit.

Parameters

hit	DAQ hit
cal	calibration

Returns

time-over-threshold [ns]

Definition at line 47 of file JHitToolkit.hh.

  {
    return getToT(hit.getToT(), cal);
  }

template<class JHit_t >

JMatchHelper<JHit_t> JTRIGGER::make_match

(

bool(*)(const JHit_t &, const JHit_t &)

match

)

Auxiliary method to make JMatch object based on pointer to match function.

Parameters

match

pointer to match function

Returns

match object

Definition at line 106 of file JMatch.hh.

  {
    return JMatchHelper<JHit_t>(match);
  }  

JPMTMask_t JTRIGGER::getPMTMask ( const unsigned int  bit )

inline

Convert pmt bit to pmt mask.

Parameters

bit

pmt bit

Returns

pmt mask

Definition at line 45 of file JPMTMask.hh.

  {
    if (bit < NUMBER_OF_PMT_BITS)
      return JPMTMask_t(1) << bit;
    else
      return 0;
  }

JTRIGGER::setTriggerBit	(	JTrigger3DShower	,
		1
	)

JTRIGGER::setTriggerBit	(	JTriggerMXShower	,
		2
	)

JTRIGGER::setTriggerBit	(	JTrigger3DMuon	,
		4
	)

bool JTRIGGER::operator< ( const JTriggeredHit &  first, const JTriggeredHit &  second  )

inline

Less than operator for triggered hits.

The less than operator is applied first to JTRIGGER::JHit and then to the KM3NETDAQ::JDAQPMTIdentifier. Hence, the ordering by JTRIGGER::JHit is maintained. This allows for the use of STL sort() and set_union() algorithms.

Parameters

first	first hit
second	second hit

Returns

true if first hit earlier or lower PMT identifier if equal; else false

Definition at line 86 of file JTriggeredHit.hh.

  {
    if (std::equal_to<JHit>()(first,second))
      return std::less<JDAQPMTIdentifier>()(first,second);
    else
      return std::less<JHit>             ()(first,second);
  }

bool JTRIGGER::operator== ( const JTriggeredHit &  first, const JTriggeredHit &  second  )

inline

Equal operator for triggered hits.

The equal operator is applied to JTRIGGER::JHit and to the KM3NETDAQ::JDAQPMTIdentifier.

Parameters

first	first hit
second	second hit

Returns

true if first hit equal second hit; else false

Definition at line 104 of file JTriggeredHit.hh.

  {
    return (std::equal_to<JDAQPMTIdentifier>()(first,second) &&
            std::equal_to<JHit>             ()(first,second));
  }

std::ostream& JTRIGGER::operator<< ( std::ostream &  out, const JTriggerException &  exception  )

inline

Print error message of JTriggerException.

Parameters

out	output stream
exception	JTriggerException

Definition at line 60 of file JTriggerException.hh.

  {
    return out << exception.what();
  }

template<class JTrigger_t >

JTriggerbit_t JTRIGGER::getTriggerBit ( )

inline

Get the trigger bit.

Returns

trigger bit

Definition at line 212 of file JTriggerInterface.hh.

  {
    return JTriggerBit<JTrigger_t>::value;
  }

template<class JTrigger_t >

JTriggerbit_t JTRIGGER::getTriggerBit ( const JTrigger_t &  event )

inline

Get the trigger bit.

Parameters

event

triggered event

Returns

trigger bit

Definition at line 225 of file JTriggerInterface.hh.

  {
    return JTriggerBit<JTrigger_t>::value;
  }

const char* JTRIGGER::getTriggerName ( JTriggerbit_t  bit )

inline

Get trigger name.

param bit trigger bit

Returns

trigger name

Definition at line 237 of file JTriggerInterface.hh.

  {
    return JTriggerInterface::getTriggerName(bit);
  }

void JTRIGGER::setAttributes ( const JModule &  first, const JModule &  second, JAttributes &  attributes  )

inline

Set module attributes.

Parameters

first	first module
second	second module
attributes	module attributes

Definition at line 46 of file JTriggerMXShower.hh.

  {
    using namespace JMATH;
    using namespace JTOOLS;

    typedef JTriggerMXShower_t::JParameters  JParameters_t;

    // get trigger parameters

    const JParameters_t& parameters = JParametersHelper<JParameters_t>::getParameters();

    const double d = getDistance(first, second);

    double t1 = 0.0;

    if      (d <= 0.5 * parameters.DMax_m)
      t1 =  d                      * getIndexOfRefraction() * getInverseSpeedOfLight()  +  parameters.TMaxExtra_ns;
    else if (d <= parameters.DMax_m)
      t1 = (parameters.DMax_m - d) * getIndexOfRefraction() * getInverseSpeedOfLight()  +  parameters.TMaxExtra_ns;

    attributes.Tmin_ns = -t1;
    attributes.Tmax_ns = +t1;
  }

JTimeRange JTRIGGER::getTimeRange ( const JTriggerParameters &  parameters )

inline

Get time range of snapshot.

Parameters

parameters

trigger parameters

Returns

time range [ns]

Definition at line 29 of file JTriggerToolkit.hh.

  {
    return JTimeRange(-parameters.TMaxEvent_ns, +parameters.TMaxEvent_ns);
  }

Variable Documentation

const JGetRiseTime JTRIGGER::getRiseTime

static

Function object for rise time evaluation.

Definition at line 77 of file JGetRiseTime.hh.

const unsigned int JTRIGGER::NUMBER_OF_PMT_BITS = 31

static

Number of pmt bits.

Definition at line 36 of file JPMTMask.hh.