mirror of
https://github.com/slsdetectorgroup/aare.git
synced 2026-02-19 17:18:43 +01:00
make max_sum_2x2 properly accessible from python
This commit is contained in:
@@ -8,6 +8,7 @@
|
||||
|
||||
#pragma once
|
||||
|
||||
#include "defs.hpp"
|
||||
#include <algorithm>
|
||||
#include <array>
|
||||
#include <cstdint>
|
||||
@@ -45,7 +46,7 @@ struct Cluster {
|
||||
* @return photon energy of subcluster, 2x2 subcluster index relative to
|
||||
* cluster center
|
||||
*/
|
||||
std::pair<T, int> max_sum_2x2() const {
|
||||
Sum_index_pair<T, int> max_sum_2x2() const {
|
||||
|
||||
if constexpr (cluster_size_x == 3 && cluster_size_y == 3) {
|
||||
std::array<T, 4> sum_2x2_subclusters;
|
||||
@@ -56,9 +57,10 @@ struct Cluster {
|
||||
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);
|
||||
return Sum_index_pair<T, int>{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);
|
||||
return Sum_index_pair<T, int>{data[0] + data[1] + data[2] + data[3],
|
||||
0};
|
||||
} else {
|
||||
constexpr size_t cluster_center_index =
|
||||
(ClusterSizeX / 2) + (ClusterSizeY / 2) * ClusterSizeX;
|
||||
@@ -97,7 +99,7 @@ struct Cluster {
|
||||
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);
|
||||
return Sum_index_pair<T, int>{sum_2x2_subcluster[index], index};
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
@@ -86,15 +86,14 @@ class ClusterVector<Cluster<T, ClusterSizeX, ClusterSizeY, CoordType>> {
|
||||
/**
|
||||
* @brief Sum the pixels in the 2x2 subcluster with the biggest pixel sum in
|
||||
* each cluster
|
||||
* @return std::vector<T> vector of sums for each cluster
|
||||
* @return vector of sums index pairs for each cluster
|
||||
*/
|
||||
std::vector<T> sum_2x2() {
|
||||
std::vector<T> sums_2x2(m_data.size());
|
||||
std::vector<Sum_index_pair<T, int>> sum_2x2() {
|
||||
std::vector<Sum_index_pair<T, int>> sums_2x2(m_data.size());
|
||||
|
||||
std::transform(m_data.begin(), m_data.end(), sums_2x2.begin(),
|
||||
[](const ClusterType &cluster) {
|
||||
return cluster.max_sum_2x2().first;
|
||||
});
|
||||
std::transform(
|
||||
m_data.begin(), m_data.end(), sums_2x2.begin(),
|
||||
[](const ClusterType &cluster) { return cluster.max_sum_2x2(); });
|
||||
|
||||
return sums_2x2;
|
||||
}
|
||||
|
||||
@@ -331,6 +331,12 @@ enum DACIndex {
|
||||
SLOW_ADC_TEMP
|
||||
};
|
||||
|
||||
// helper pair class to easily expose in python
|
||||
template <typename T1, typename T2> struct Sum_index_pair {
|
||||
T1 sum;
|
||||
T2 index;
|
||||
};
|
||||
|
||||
enum class TimingMode { Auto, Trigger };
|
||||
enum class FrameDiscardPolicy { NoDiscard, Discard, DiscardPartial };
|
||||
|
||||
|
||||
Reference in New Issue
Block a user