mirror of
https://github.com/slsdetectorgroup/aare.git
synced 2026-02-20 01:28:41 +01:00
108 lines
3.8 KiB
C++
108 lines
3.8 KiB
C++
// SPDX-License-Identifier: MPL-2.0
|
|
#include "aare/Cluster.hpp"
|
|
|
|
#include <cstdint>
|
|
#include <filesystem>
|
|
#include <fmt/format.h>
|
|
#include <pybind11/numpy.h>
|
|
#include <pybind11/pybind11.h>
|
|
#include <pybind11/stl.h>
|
|
#include <pybind11/stl_bind.h>
|
|
|
|
namespace py = pybind11;
|
|
using pd_type = double;
|
|
|
|
using namespace aare;
|
|
|
|
#pragma GCC diagnostic push
|
|
#pragma GCC diagnostic ignored "-Wunused-parameter"
|
|
|
|
template <typename Type, uint8_t ClusterSizeX, uint8_t ClusterSizeY,
|
|
typename CoordType>
|
|
void define_Cluster(py::module &m, const std::string &typestr) {
|
|
auto class_name = fmt::format("Cluster{}", typestr);
|
|
|
|
py::class_<Cluster<Type, ClusterSizeX, ClusterSizeY, CoordType>>(
|
|
m, class_name.c_str(), py::buffer_protocol())
|
|
|
|
.def(py::init([](CoordType x, CoordType y,
|
|
py::array_t<Type, py::array::forcecast> data) {
|
|
py::buffer_info buf_info = data.request();
|
|
Cluster<Type, ClusterSizeX, ClusterSizeY, CoordType> cluster;
|
|
cluster.x = x;
|
|
cluster.y = y;
|
|
auto r = data.template unchecked<1>(); // no bounds checks
|
|
for (py::ssize_t i = 0; i < data.size(); ++i) {
|
|
cluster.data[i] = r(i);
|
|
}
|
|
return cluster;
|
|
}))
|
|
|
|
// TODO! Review if to keep or not
|
|
.def_property_readonly(
|
|
"data",
|
|
[](Cluster<Type, ClusterSizeX, ClusterSizeY, CoordType> &c)
|
|
-> py::array {
|
|
return py::array(py::buffer_info(
|
|
c.data.data(), sizeof(Type),
|
|
py::format_descriptor<Type>::format(), // Type
|
|
// format
|
|
2, // Number of dimensions
|
|
{static_cast<ssize_t>(ClusterSizeX),
|
|
static_cast<ssize_t>(ClusterSizeY)}, // Shape (flattened)
|
|
{sizeof(Type) * ClusterSizeY, sizeof(Type)}
|
|
// Stride (step size between elements)
|
|
));
|
|
})
|
|
|
|
.def_readonly("x",
|
|
&Cluster<Type, ClusterSizeX, ClusterSizeY, CoordType>::x)
|
|
|
|
.def_readonly("y",
|
|
&Cluster<Type, ClusterSizeX, ClusterSizeY, CoordType>::y)
|
|
|
|
.def(
|
|
"max_sum_2x2",
|
|
[](Cluster<Type, ClusterSizeX, ClusterSizeY, CoordType> &self) {
|
|
auto max_sum = self.max_sum_2x2();
|
|
return py::make_tuple(max_sum.sum,
|
|
static_cast<int>(max_sum.index));
|
|
},
|
|
R"(calculates sum of 2x2 subcluster with highest energy and index relative to cluster center 0: top_left, 1: top_right, 2: bottom_left, 3: bottom_right
|
|
)");
|
|
}
|
|
|
|
template <typename T, uint8_t ClusterSizeX, uint8_t ClusterSizeY,
|
|
typename CoordType = int16_t>
|
|
void reduce_to_3x3(py::module &m) {
|
|
|
|
m.def(
|
|
"reduce_to_3x3",
|
|
[](const Cluster<T, ClusterSizeX, ClusterSizeY, CoordType> &cl) {
|
|
return reduce_to_3x3(cl);
|
|
},
|
|
py::return_value_policy::move, R"(Reduce cluster to 3x3 subcluster)");
|
|
}
|
|
|
|
template <typename T, uint8_t ClusterSizeX, uint8_t ClusterSizeY,
|
|
typename CoordType = int16_t>
|
|
void reduce_to_2x2(py::module &m) {
|
|
|
|
m.def(
|
|
"reduce_to_2x2",
|
|
[](const Cluster<T, ClusterSizeX, ClusterSizeY, CoordType> &cl) {
|
|
return reduce_to_2x2(cl);
|
|
},
|
|
py::return_value_policy::move,
|
|
R"(
|
|
Reduce cluster to 2x2 subcluster by taking the 2x2 subcluster with
|
|
the highest photon energy.
|
|
|
|
RETURN:
|
|
|
|
reduced cluster (cluster is filled in row major ordering starting at the top left. Thus for a max subcluster in the top left corner the photon hit is at the fourth position.)
|
|
|
|
)");
|
|
}
|
|
|
|
#pragma GCC diagnostic pop |