#include <SimpleClustering.h>
Definition at line 198 of file SimpleClustering.cxx.
200 for (
size_t i = 0; i < c1.
size(); i++)
bool hitsTouching(const tss::Hit2D &h1, const tss::Hit2D &h2) const
Definition at line 208 of file SimpleClustering.cxx.
210 for (
unsigned int i = 0; i < c1.
size(); i++)
bool hitsTouching(const tss::Hit2D &h1, const tss::Hit2D &h2) const
void tss::SimpleClustering::merge |
( |
std::vector< tss::Cluster2D > & |
clusters | ) |
const |
|
private |
Definition at line 218 of file SimpleClustering.cxx.
226 while (i < clusters.size() - 1)
229 while (j < clusters.size())
233 clusters[i].hits().reserve(clusters[i].
size() + clusters[i].
size());
234 for (
size_t h = 0;
h < clusters[j].size(); ++
h)
235 clusters[i].hits().push_back(clusters[j].hits()[
h]);
236 clusters.erase(clusters.begin() + j);
std::size_t size(FixedBins< T, C > const &) noexcept
bool hitsTouching(const tss::Hit2D &h1, const tss::Hit2D &h2) const
Definition at line 247 of file SimpleClustering.cxx.
249 std::vector< tss::Cluster2D > result;
250 for (
size_t h = 0;
h < inp.size(); ++
h)
253 for (
size_t r = 0;
r < result.size(); ++
r)
256 result[
r].hits().push_back(&(inp[h])); found =
true;
break;
261 result.back().hits().push_back(&(inp[h]));
void merge(std::vector< tss::Cluster2D > &clusters) const
bool hitsTouching(const tss::Hit2D &h1, const tss::Hit2D &h2) const
Definition at line 270 of file SimpleClustering.cxx.
272 std::vector< tss::Cluster2D > result;
273 for (
size_t h = 0;
h < inp.
size(); ++
h)
276 for (
size_t r = 0;
r < result.size(); ++
r)
279 result[
r].hits().push_back(inp.
hits()[
h]); found =
true;
break;
284 result.back().hits().push_back(inp.
hits()[
h]);
const std::vector< const tss::Hit2D * > & hits(void) const
void merge(std::vector< tss::Cluster2D > &clusters) const
bool hitsTouching(const tss::Hit2D &h1, const tss::Hit2D &h2) const
The documentation for this class was generated from the following files: