Jpp test-rotations-old
the software that should make you happy
|
Algorithms for hit clustering and sorting. More...
#include <vector>
#include <algorithm>
#include <iterator>
Go to the source code of this file.
Namespaces | |
namespace | JTRIGGER |
Auxiliary classes and methods for triggering. | |
namespace | JPP |
This name space includes all other name spaces (except KM3NETDAQ, KM3NET and ANTARES). | |
Functions | |
template<class JHitIterator_t , class JMatch_t > | |
JHitIterator_t | JTRIGGER::clusterize (JHitIterator_t __begin, JHitIterator_t __end, const JMatch_t &match, const int Nmin=1) |
Partition data according given binary match operator. | |
template<class JHitIterator_t , class JComparator_t , class JMatch_t > | |
JHitIterator_t | JTRIGGER::clusterize (JHitIterator_t __begin, JHitIterator_t __end, const JComparator_t &comparator, const JMatch_t &match) |
Select best root hit according given comparator and partition remaining data according given binary match operator and this root hit. | |
template<class JHitIterator_t , class JMatch_t > | |
JHitIterator_t | JTRIGGER::reverse_clusterize (JHitIterator_t __begin, JHitIterator_t __end, const JMatch_t &match) |
Partition data according given binary match operator. | |
template<class JHitIterator_t , class JMatch_t > | |
JHitIterator_t | JTRIGGER::clusterizeWeight (JHitIterator_t __begin, JHitIterator_t __end, const JMatch_t &match) |
Partition data according given binary match operator. | |
template<class JHit_t > | |
bool | JTRIGGER::weightSorter (const JHit_t &first, const JHit_t &second) |
Compare two hits by weight. | |
template<class JHit_t > | |
bool | JTRIGGER::timeSorter (const JHit_t &first, const JHit_t &second) |
Compare two hits by weight. | |
Algorithms for hit clustering and sorting.
Definition in file JAlgorithm.hh.