Pandora
Pandora source code navigator
Loading...
Searching...
No Matches
TwoDSlidingFitSplittingAlgorithm.h
Go to the documentation of this file.
1
8#ifndef LAR_TWO_D_SLIDING_FIT_SPLITTING_ALGORITHM_H
9#define LAR_TWO_D_SLIDING_FIT_SPLITTING_ALGORITHM_H 1
10
12
14
15namespace lar_content
16{
17
22{
23public:
28
29protected:
31
40 virtual pandora::StatusCode FindBestSplitPosition(const TwoDSlidingFitResult &slidingFitResult, pandora::CartesianVector &splitPosition) const = 0;
41
44
45private:
47 const pandora::Cluster *const pCluster, pandora::CaloHitList &firstCaloHitList, pandora::CaloHitList &secondCaloHitList) const;
48
59 pandora::StatusCode DivideCaloHits(const TwoDSlidingFitResult &slidingFitResult, const pandora::CartesianVector &splitPosition,
60 pandora::CaloHitList &firstCaloHitList, pandora::CaloHitList &secondCaloHitList) const;
61};
62
63} // namespace lar_content
64
65#endif // #ifndef LAR_TWO_D_SLIDING_FIT_SPLITTING_ALGORITHM_H
Header file for the cluster splitting algorithm class.
Header file for the lar two dimensional sliding fit result class.
virtual pandora::StatusCode FindBestSplitPosition(const TwoDSlidingFitResult &slidingFitResult, pandora::CartesianVector &splitPosition) const =0
Use sliding linear fit to identify the best split position.
virtual pandora::StatusCode ReadSettings(const pandora::TiXmlHandle xmlHandle)
Read the algorithm settings.
pandora::StatusCode DivideCaloHits(const pandora::Cluster *const pCluster, pandora::CaloHitList &firstCaloHitList, pandora::CaloHitList &secondCaloHitList) const
Divide calo hits in a cluster into two lists, each associated with a separate fragment cluster.
CartesianVector class.
Cluster class.
Definition Cluster.h:31
MANAGED_CONTAINER< const CaloHit * > CaloHitList
StatusCode
The StatusCode enum.