Belle II Software development
|
Predicate class to check for the containment of items in a rangeobject in a hough space part. More...
#include <RangeInBox.h>
Public Types | |
using | HoughBox = typename AHitInBoxAlgorithm::HoughBox |
The type of the underlying HoughBox (copied from the udnerlaying hit algorithm) | |
Public Member Functions | |
template<class ARangeObject > | |
Weight | operator() (const ARangeObject &rangeObject, const HoughBox *box) |
When called, it goes through all items in the range object (e.g. | |
Public Attributes | |
const double | minimalRatio = 0.6 |
The minimal percentage of items of a given range that must belong to the box the be called a hit. | |
Predicate class to check for the containment of items in a rangeobject in a hough space part.
Note this part this code defines the performance of the search in the hough plain quite significantly and there is probably room for improvement.
Definition at line 25 of file RangeInBox.h.
using HoughBox = typename AHitInBoxAlgorithm::HoughBox |
The type of the underlying HoughBox (copied from the udnerlaying hit algorithm)
Definition at line 28 of file RangeInBox.h.
|
inline |
When called, it goes through all items in the range object (e.g.
a CDCSegment) and checks the HitInBox algorithm passed as a template argument. If there is a certain amount of items of the range in the box, it returns the number of items as a weight, otherwise it returns NAN;
Definition at line 35 of file RangeInBox.h.
const double minimalRatio = 0.6 |
The minimal percentage of items of a given range that must belong to the box the be called a hit.
Definition at line 57 of file RangeInBox.h.