Jpp
debug
the software that should make you happy
|
Anonymous struct for weighed 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 |
Partition data according given binary match operator. More... | |
Private Member Functions | |
template<class JHitIterator_t , class JMatch_t > | |
JHitIterator_t | operator() (JHitIterator_t buffer, const int N, const JMatch_t &match, std::random_access_iterator_tag tag) const |
Implementation of method clusterizeWeight for random access iterators. More... | |
Private Attributes | |
std::vector< double > | weight |
Anonymous struct for weighed clustering of hits.
Definition at line 300 of file JAlgorithm.hh.
|
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. Note that the weight is assumed to be positive definite and the larger the weight the better.
The hit iterator refers to a data structure which should conform with the match operator. In addition, it should have the following member method:
__begin | begin of data |
__end | end of data |
match | binary match operator |
Definition at line 322 of file JAlgorithm.hh.
|
inlineprivate |
Implementation of method clusterizeWeight for random access iterators.
buffer | pointer to data |
N | number of hits |
match | binary match operator |
tag | iterator tag |
Definition at line 340 of file JAlgorithm.hh.
|
mutableprivate |
Definition at line 417 of file JAlgorithm.hh.