#include "SimpleClustering.h"
Definition at line 37 of file SimpleClustering.h.
tss::Cluster2D::Cluster2D |
( |
void |
| ) |
|
|
inline |
tss::Cluster2D::Cluster2D |
( |
const std::vector< const tss::Hit2D * > & |
hits | ) |
|
Definition at line 11 of file SimpleClustering.cxx.
References fHits.
14 fHits.reserve(hits.size());
15 for (
size_t h = 0; h < hits.size(); ++h)
16 fHits.push_back(hits[h]);
std::vector< const tss::Hit2D * > fHits
const tss::Hit2D * tss::Cluster2D::closest |
( |
const TVector2 & |
p2d, |
|
|
size_t & |
idx |
|
) |
| const |
double tss::Cluster2D::dist2 |
( |
const TVector2 & |
p2d | ) |
const |
Definition at line 127 of file SimpleClustering.cxx.
References pma::Dist2(), and fHits.
Referenced by dist2().
131 for (
size_t i = 1; i <
fHits.size(); ++i) {
133 if (d2 < min_d2) { min_d2 = d2; }
double Dist2(const TVector2 &v1, const TVector2 &v2)
std::vector< const tss::Hit2D * > fHits
double tss::Cluster2D::dist2 |
( |
const TVector2 & |
p2d, |
|
|
size_t & |
hIdx |
|
) |
| const |
Definition at line 142 of file SimpleClustering.cxx.
References pma::Dist2(), and fHits.
147 for (
size_t i = 1; i <
fHits.size(); ++i) {
double Dist2(const TVector2 &v1, const TVector2 &v2)
std::vector< const tss::Hit2D * > fHits
Definition at line 161 of file SimpleClustering.cxx.
References dist2(), and fHits.
164 double d2, min_d2 = clu.
dist2(
fHits.front()->Point2D());
165 for (
size_t i = 1; i <
fHits.size(); ++i) {
167 if (d2 < min_d2) { min_d2 = d2; }
double dist2(const TVector2 &p2d) const
std::vector< const tss::Hit2D * > fHits
const tss::Hit2D* tss::Cluster2D::end |
( |
void |
| ) |
const |
|
inline |
bool tss::Cluster2D::has |
( |
const tss::Hit2D * |
hit | ) |
const |
Definition at line 119 of file SimpleClustering.cxx.
References fHits.
121 for (
size_t i = 0; i <
fHits.size(); ++i)
122 if (
fHits[i] == hit)
return true;
std::vector< const tss::Hit2D * > fHits
const std::vector<const tss::Hit2D*>& tss::Cluster2D::hits |
( |
void |
| ) |
const |
|
inline |
std::vector<const tss::Hit2D*>& tss::Cluster2D::hits |
( |
void |
| ) |
|
|
inline |
bool tss::Cluster2D::isDenseEnd |
( |
void |
| ) |
const |
|
inline |
bool tss::Cluster2D::isDenseStart |
( |
void |
| ) |
const |
|
inline |
bool tss::Cluster2D::isEM |
( |
void |
| ) |
const |
|
inline |
bool tss::Cluster2D::isTagged |
( |
void |
| ) |
const |
|
inline |
double tss::Cluster2D::length2 |
( |
void |
| ) |
const |
|
inline |
const TVector2 tss::Cluster2D::max |
( |
void |
| ) |
const |
Definition at line 102 of file SimpleClustering.cxx.
References fHits, and size().
Referenced by tss::Segmentation2D::Cl2InsideCl1().
105 TVector2 maximum =
fHits[0]->Point2D();
107 for (
size_t i = 1; i <
size(); ++i) {
108 const TVector2 h =
fHits[i]->Point2D();
110 if (h.X() > maximum.X()) maximum.Set(h.X(), h.Y());
111 if (h.Y() > maximum.Y()) maximum.Set(maximum.X(), h.Y());
std::vector< const tss::Hit2D * > fHits
const TVector2 tss::Cluster2D::min |
( |
void |
| ) |
const |
Definition at line 85 of file SimpleClustering.cxx.
References fHits, and size().
Referenced by tss::Segmentation2D::Cl2InsideCl1().
88 TVector2 minimum =
fHits[0]->Point2D();
90 for (
size_t i = 1; i <
size(); ++i) {
91 const TVector2 h =
fHits[i]->Point2D();
93 if (h.X() < minimum.X()) minimum.Set(h.X(), h.Y());
94 if (h.Y() < minimum.Y()) minimum.Set(minimum.X(), h.Y());
std::vector< const tss::Hit2D * > fHits
const Hit2D& tss::Cluster2D::operator[] |
( |
size_t |
index | ) |
const |
|
inline |
const tss::Hit2D * tss::Cluster2D::outermost |
( |
size_t & |
idx | ) |
const |
void tss::Cluster2D::push_back |
( |
const tss::Hit2D * |
hit | ) |
|
|
inline |
bool tss::Cluster2D::release |
( |
const tss::Hit2D * |
hit | ) |
|
const tss::Hit2D * tss::Cluster2D::release_at |
( |
size_t |
idx | ) |
|
void tss::Cluster2D::setTag |
( |
bool |
b | ) |
|
|
inline |
size_t tss::Cluster2D::size |
( |
void |
| ) |
const |
|
inline |
void tss::Cluster2D::sort |
( |
void |
| ) |
|
|
inline |
const tss::Hit2D* tss::Cluster2D::start |
( |
void |
| ) |
const |
|
inline |
void tss::Cluster2D::tagDenseEnd |
( |
bool |
b | ) |
|
|
inline |
void tss::Cluster2D::tagDenseStart |
( |
bool |
b | ) |
|
|
inline |
void tss::Cluster2D::tagEM |
( |
bool |
b | ) |
|
|
inline |
Definition at line 67 of file SimpleClustering.h.
References release_at().
void push_back(const tss::Hit2D *hit)
const Hit2D * release_at(size_t idx)
Detector simulation of raw signals on wires.
bool tss::Cluster2D::fDenseEnd |
|
private |
bool tss::Cluster2D::fDenseStart |
|
private |
std::vector<const tss::Hit2D*> tss::Cluster2D::fHits |
|
private |
bool tss::Cluster2D::fIsEM |
|
private |
bool tss::Cluster2D::fTag |
|
private |
The documentation for this class was generated from the following files:
- larreco/v09_25_00/source/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.h
- larreco/v09_25_00/source/larreco/ClusterFinder/TrackShowerSplitter/Segmentation2D/SimpleClustering.cxx