12 #ifndef VtxCandidate_h 13 #define VtxCandidate_h 52 double MaxAngle(
double minLength = 0.0)
const;
55 size_t Size(
double minLength)
const;
67 std::pair< pma::Track3D*, size_t >
Track(
size_t i)
const 69 return std::pair< pma::Track3D*, size_t >(
fAssigned[i].first.Track(),
fAssigned[i].second);
73 bool has(
const std::vector<int>& v,
int id)
const 75 for (
auto c : v)
if (c ==
id)
return true;
81 std::vector< std::pair< pma::TrkCandidate, size_t > >
fAssigned;
const TVector3 & Center(void) const
double ComputeMse2D(void)
bool Has(pma::Track3D *trk) const
double Test(const VtxCandidate &other) const
bool JoinTracks(pma::TrkCandidateColl &tracks, pma::TrkCandidateColl &src)
bool HasLoops(void) const
std::pair< pma::Track3D *, size_t > Track(size_t i) const
static const double kMinDistToNode
VtxCandidate(double segMinLength=0.5)
std::vector< std::pair< pma::TrkCandidate, size_t > > fAssigned
double MaxAngle(double minLength=0.0) const
Track finding helper for the Projection Matching Algorithm.
bool MergeWith(const VtxCandidate &other)
static const double kMaxDistToTrack
bool Add(const pma::TrkCandidate &trk)
bool IsAttached(pma::Track3D *trk) const
bool has(const std::vector< int > &v, int id) const