mirror of
https://github.com/slsdetectorgroup/aare.git
synced 2025-06-03 19:40:40 +02:00
94ac58b09e
Co-authored-by: Patrick <patrick.sieberer@psi.ch> Co-authored-by: JulianHeymes <julian.heymes@psi.ch> Co-authored-by: Dhanya Thattil <dhanya.thattil@psi.ch> Co-authored-by: Xiangyu Xie <45243914+xiangyuxie@users.noreply.github.com> Co-authored-by: xiangyu.xie <xiangyu.xie@psi.ch> Co-authored-by: AliceMazzoleni99 <alice.mazzoleni@psi.ch> Co-authored-by: Mazzoleni Alice Francesca <mazzol_a@pc17378.psi.ch> Co-authored-by: siebsi <sieb.patr@gmail.com>
87 lines
3.3 KiB
C++
87 lines
3.3 KiB
C++
|
|
/************************************************
|
|
* @file Cluster.hpp
|
|
* @short definition of cluster, where CoordType (x,y) give
|
|
* the cluster center coordinates and data the actual cluster data
|
|
* cluster size is given as template parameters
|
|
***********************************************/
|
|
|
|
#pragma once
|
|
|
|
#include <algorithm>
|
|
#include <array>
|
|
#include <cstdint>
|
|
#include <numeric>
|
|
#include <type_traits>
|
|
|
|
namespace aare {
|
|
|
|
// requires clause c++20 maybe update
|
|
template <typename T, uint8_t ClusterSizeX, uint8_t ClusterSizeY,
|
|
typename CoordType = int16_t>
|
|
struct Cluster {
|
|
|
|
static_assert(std::is_arithmetic_v<T>, "T needs to be an arithmetic type");
|
|
static_assert(std::is_integral_v<CoordType>,
|
|
"CoordType needs to be an integral type");
|
|
static_assert(ClusterSizeX > 0 && ClusterSizeY > 0,
|
|
"Cluster sizes must be bigger than zero");
|
|
|
|
CoordType x;
|
|
CoordType y;
|
|
std::array<T, ClusterSizeX * ClusterSizeY> data;
|
|
|
|
static constexpr uint8_t cluster_size_x = ClusterSizeX;
|
|
static constexpr uint8_t cluster_size_y = ClusterSizeY;
|
|
using value_type = T;
|
|
using coord_type = CoordType;
|
|
|
|
T sum() const { return std::accumulate(data.begin(), data.end(), T{}); }
|
|
|
|
std::pair<T, int> max_sum_2x2() const {
|
|
|
|
if constexpr (cluster_size_x == 3 && cluster_size_y == 3) {
|
|
std::array<T, 4> sum_2x2_subclusters;
|
|
sum_2x2_subclusters[0] = data[0] + data[1] + data[3] + data[4];
|
|
sum_2x2_subclusters[1] = data[1] + data[2] + data[4] + data[5];
|
|
sum_2x2_subclusters[2] = data[3] + data[4] + data[6] + data[7];
|
|
sum_2x2_subclusters[3] = data[4] + data[5] + data[7] + data[8];
|
|
int index = std::max_element(sum_2x2_subclusters.begin(),
|
|
sum_2x2_subclusters.end()) -
|
|
sum_2x2_subclusters.begin();
|
|
return std::make_pair(sum_2x2_subclusters[index], index);
|
|
} else if constexpr (cluster_size_x == 2 && cluster_size_y == 2) {
|
|
return std::make_pair(data[0] + data[1] + data[2] + data[3], 0);
|
|
} else {
|
|
constexpr size_t num_2x2_subclusters =
|
|
(ClusterSizeX - 1) * (ClusterSizeY - 1);
|
|
|
|
std::array<T, num_2x2_subclusters> sum_2x2_subcluster;
|
|
for (size_t i = 0; i < ClusterSizeY - 1; ++i) {
|
|
for (size_t j = 0; j < ClusterSizeX - 1; ++j)
|
|
sum_2x2_subcluster[i * (ClusterSizeX - 1) + j] =
|
|
data[i * ClusterSizeX + j] +
|
|
data[i * ClusterSizeX + j + 1] +
|
|
data[(i + 1) * ClusterSizeX + j] +
|
|
data[(i + 1) * ClusterSizeX + j + 1];
|
|
}
|
|
|
|
int index = std::max_element(sum_2x2_subcluster.begin(),
|
|
sum_2x2_subcluster.end()) -
|
|
sum_2x2_subcluster.begin();
|
|
return std::make_pair(sum_2x2_subcluster[index], index);
|
|
}
|
|
}
|
|
};
|
|
|
|
// Type Traits for is_cluster_type
|
|
template <typename T>
|
|
struct is_cluster : std::false_type {}; // Default case: Not a Cluster
|
|
|
|
template <typename T, uint8_t X, uint8_t Y, typename CoordType>
|
|
struct is_cluster<Cluster<T, X, Y, CoordType>> : std::true_type {}; // Cluster
|
|
|
|
template <typename T> constexpr bool is_cluster_v = is_cluster<T>::value;
|
|
|
|
} // namespace aare
|