Jpp
17.3.0-rc.2
the software that should make you happy
|
Anonymous structure for clustering of hits. More...
#include <JAlgorithm.hh>
Public Member Functions | |
template<class JHitIterator_t , class JMatch_t > | |
JHitIterator_t | operator() (JHitIterator_t __begin, JHitIterator_t __end, const JMatch_t &match, const int Nmin=1) const |
Partition data according given binary match operator. More... | |
template<class JHitIterator_t , class JComparator_t , class JMatch_t > | |
JHitIterator_t | operator() (JHitIterator_t __begin, JHitIterator_t __end, const JComparator_t &comparator, const JMatch_t &match) const |
Select best root hit according given comparator and partition remaining data according given binary match operator and this root hit. More... | |
Private Member Functions | |
template<class JHitIterator_t , class JMatch_t > | |
JHitIterator_t | operator() (JHitIterator_t buffer, const int N, const JMatch_t &match, const int Nmin, std::random_access_iterator_tag tag) const |
Implementation of method clusterize for random access iterators. More... | |
Private Attributes | |
std::vector< int > | count |
Anonymous structure for clustering of hits.
Definition at line 23 of file JAlgorithm.hh.
|
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 hit iterator refers to a data structure which should conform with the match operator.
__begin | begin of data |
__end | end of data |
match | binary match operator |
Nmin | minimum cluster size |
Definition at line 43 of file JAlgorithm.hh.
|
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 algorithm will sort the data such that all selected hits are at the front.
__begin | begin of data |
__end | end of data |
comparator | comparator |
match | binary match operator |
Definition at line 65 of file JAlgorithm.hh.
|
inlineprivate |
Implementation of method clusterize for random access iterators.
buffer | pointer to data |
N | number of hits |
match | binary match operator |
Nmin | minimum cluster size |
tag | iterator tag |
Definition at line 96 of file JAlgorithm.hh.
|
mutableprivate |
Definition at line 180 of file JAlgorithm.hh.