|
| 1 | +// Copyright 2026 Davide Faconti |
| 2 | +// SPDX-License-Identifier: MPL-2.0 |
| 3 | + |
| 4 | +#include "pj_plugins/sdk/builtin_transforms.hpp" |
| 5 | + |
| 6 | +#include <gtest/gtest.h> |
| 7 | + |
| 8 | +#include <cmath> |
| 9 | +#include <cstdint> |
| 10 | +#include <limits> |
| 11 | + |
| 12 | +#include "pj_plugins/sdk/filter_transform_factory.hpp" |
| 13 | + |
| 14 | +namespace { |
| 15 | + |
| 16 | +using namespace PJ::sdk; // NOLINT |
| 17 | + |
| 18 | +// Helper: apply a transform to (xs, ys) pairs and return output points. |
| 19 | +std::vector<Point2> apply(FilterTransform& t, std::vector<double> xs, std::vector<double> ys) { |
| 20 | + std::vector<Point2> in; |
| 21 | + in.reserve(xs.size()); |
| 22 | + for (size_t i = 0; i < xs.size(); ++i) { |
| 23 | + in.push_back({xs[i], ys[i]}); |
| 24 | + } |
| 25 | + return t.applyBatch(in); |
| 26 | +} |
| 27 | + |
| 28 | +TEST(Transforms, Absolute) { |
| 29 | + AbsoluteTransform t; |
| 30 | + auto out = apply(t, {0, 1, 2}, {-3, 4, -5}); |
| 31 | + ASSERT_EQ(out.size(), 3u); |
| 32 | + EXPECT_DOUBLE_EQ(out[0].y, 3.0); |
| 33 | + EXPECT_DOUBLE_EQ(out[2].y, 5.0); |
| 34 | +} |
| 35 | + |
| 36 | +TEST(Transforms, ScaleAndOffset) { |
| 37 | + ScaleTransform t; |
| 38 | + t.value_scale = 2.0; |
| 39 | + t.value_offset = 1.0; |
| 40 | + t.time_offset = 10.0; |
| 41 | + auto out = apply(t, {0, 1}, {3, 4}); |
| 42 | + EXPECT_DOUBLE_EQ(out[0].x, 10.0); |
| 43 | + EXPECT_DOUBLE_EQ(out[0].y, 7.0); |
| 44 | + EXPECT_DOUBLE_EQ(out[1].y, 9.0); |
| 45 | +} |
| 46 | + |
| 47 | +TEST(Transforms, DerivativeActualDt) { |
| 48 | + DerivativeTransform t; |
| 49 | + auto out = apply(t, {0, 1, 2}, {0, 10, 30}); |
| 50 | + ASSERT_EQ(out.size(), 2u); |
| 51 | + EXPECT_DOUBLE_EQ(out[0].y, 10.0); |
| 52 | + EXPECT_DOUBLE_EQ(out[1].y, 20.0); |
| 53 | +} |
| 54 | + |
| 55 | +TEST(Transforms, IntegralTrapezoid) { |
| 56 | + IntegralTransform t; |
| 57 | + auto out = apply(t, {0, 1, 2}, {0, 2, 4}); |
| 58 | + ASSERT_EQ(out.size(), 2u); |
| 59 | + EXPECT_DOUBLE_EQ(out[0].y, 1.0); |
| 60 | + EXPECT_DOUBLE_EQ(out[1].y, 4.0); |
| 61 | +} |
| 62 | + |
| 63 | +TEST(Transforms, MovingAverageWindow) { |
| 64 | + MovingAverageTransform t; |
| 65 | + t.window = 2; |
| 66 | + auto out = apply(t, {0, 1, 2, 3}, {2, 4, 6, 8}); |
| 67 | + ASSERT_EQ(out.size(), 4u); |
| 68 | + EXPECT_DOUBLE_EQ(out[0].y, 2.0); // padded |
| 69 | + EXPECT_DOUBLE_EQ(out[1].y, 3.0); // (2+4)/2 |
| 70 | + EXPECT_DOUBLE_EQ(out[3].y, 7.0); // (6+8)/2 |
| 71 | +} |
| 72 | + |
| 73 | +TEST(Transforms, MovingRMS) { |
| 74 | + MovingRMSTransform t; |
| 75 | + t.window = 2; |
| 76 | + auto out = apply(t, {0, 1}, {3, 4}); |
| 77 | + EXPECT_DOUBLE_EQ(out[0].y, 3.0); |
| 78 | + EXPECT_DOUBLE_EQ(out[1].y, std::sqrt((9.0 + 16.0) / 2.0)); |
| 79 | +} |
| 80 | + |
| 81 | +TEST(Transforms, BinaryFilterGreater) { |
| 82 | + BinaryFilterTransform t; |
| 83 | + t.op = BinaryOp::kGreater; |
| 84 | + t.a = 5.0; |
| 85 | + auto out = apply(t, {0, 1, 2}, {3, 5, 7}); |
| 86 | + EXPECT_DOUBLE_EQ(out[0].y, 0.0); |
| 87 | + EXPECT_DOUBLE_EQ(out[1].y, 0.0); |
| 88 | + EXPECT_DOUBLE_EQ(out[2].y, 1.0); |
| 89 | +} |
| 90 | + |
| 91 | +TEST(Transforms, BinaryFilterRange) { |
| 92 | + BinaryFilterTransform t; |
| 93 | + t.op = BinaryOp::kRange; |
| 94 | + t.a = 2.0; |
| 95 | + t.b = 6.0; |
| 96 | + auto out = apply(t, {0, 1, 2}, {1, 4, 7}); |
| 97 | + EXPECT_DOUBLE_EQ(out[0].y, 0.0); |
| 98 | + EXPECT_DOUBLE_EQ(out[1].y, 1.0); |
| 99 | + EXPECT_DOUBLE_EQ(out[2].y, 0.0); |
| 100 | +} |
| 101 | + |
| 102 | +TEST(Transforms, TimeSincePrevious) { |
| 103 | + TimeSincePreviousTransform t; |
| 104 | + auto out = apply(t, {0, 2, 5}, {9, 9, 9}); |
| 105 | + ASSERT_EQ(out.size(), 2u); |
| 106 | + EXPECT_DOUBLE_EQ(out[0].y, 2.0); |
| 107 | + EXPECT_DOUBLE_EQ(out[1].y, 3.0); |
| 108 | +} |
| 109 | + |
| 110 | +TEST(Transforms, SamplesCounter) { |
| 111 | + SamplesCounterTransform t; |
| 112 | + t.samples_ms = 2000; |
| 113 | + auto out = apply(t, {0, 1, 2, 3}, {0, 0, 0, 0}); |
| 114 | + ASSERT_EQ(out.size(), 4u); |
| 115 | + EXPECT_DOUBLE_EQ(out[0].y, 0.0); |
| 116 | + EXPECT_DOUBLE_EQ(out[2].y, 2.0); |
| 117 | +} |
| 118 | + |
| 119 | +TEST(Transforms, NoneIsPassthrough) { |
| 120 | + NoneTransform t; |
| 121 | + auto out = apply(t, {0, 1}, {5, 6}); |
| 122 | + ASSERT_EQ(out.size(), 2u); |
| 123 | + EXPECT_DOUBLE_EQ(out[1].y, 6.0); |
| 124 | +} |
| 125 | + |
| 126 | +TEST(Transforms, FactoryRegistration) { |
| 127 | + // The host owns the factory now (one source of truth); for the test we just |
| 128 | + // exercise the same registration shape the plugin's loaderInit uses. |
| 129 | + FilterTransformFactory f; |
| 130 | + f.registerTransform( |
| 131 | + "scale", []() -> FilterTransform* { return new ScaleTransform{}; }, [](FilterTransform* p) noexcept { delete p; }, |
| 132 | + {}); |
| 133 | + f.registerTransform( |
| 134 | + "moving_average", []() -> FilterTransform* { return new MovingAverageTransform{}; }, |
| 135 | + [](FilterTransform* p) noexcept { delete p; }, {}); |
| 136 | + |
| 137 | + const auto ids = f.registeredIds(); |
| 138 | + EXPECT_FALSE(ids.empty()); |
| 139 | + for (const auto& id : ids) { |
| 140 | + auto t = f.create(id); |
| 141 | + EXPECT_NE(t, nullptr) << "Could not create: " << id; |
| 142 | + } |
| 143 | +} |
| 144 | + |
| 145 | +TEST(Transforms, StreamSafeFlags) { |
| 146 | + // Known stream-safe |
| 147 | + EXPECT_TRUE(AbsoluteTransform{}.isStreamSafe()); |
| 148 | + EXPECT_TRUE(ScaleTransform{}.isStreamSafe()); |
| 149 | + EXPECT_TRUE(DerivativeTransform{}.isStreamSafe()); |
| 150 | + EXPECT_TRUE(MovingAverageTransform{}.isStreamSafe()); |
| 151 | + EXPECT_TRUE(MovingRMSTransform{}.isStreamSafe()); |
| 152 | + EXPECT_TRUE(MovingVarianceTransform{}.isStreamSafe()); |
| 153 | + EXPECT_TRUE(OutlierRemovalTransform{}.isStreamSafe()); |
| 154 | + EXPECT_TRUE(BinaryFilterTransform{}.isStreamSafe()); |
| 155 | + EXPECT_TRUE(TimeSincePreviousTransform{}.isStreamSafe()); |
| 156 | + // Known non-safe (need full history) |
| 157 | + EXPECT_FALSE(IntegralTransform{}.isStreamSafe()); |
| 158 | + EXPECT_FALSE(SamplesCounterTransform{}.isStreamSafe()); |
| 159 | +} |
| 160 | + |
| 161 | +// --------------------------------------------------------------------------- |
| 162 | +// Streaming equivalence: calculateNextPoint matches applyBatch |
| 163 | +// --------------------------------------------------------------------------- |
| 164 | + |
| 165 | +void expectStreamingMatchesBatch(FilterTransform& t_batch, FilterTransform& t_stream) { |
| 166 | + std::vector<Point2> full; |
| 167 | + for (int i = 0; i < 30; ++i) { |
| 168 | + full.push_back({static_cast<double>(i), std::sin(i * 0.3) * 5.0 + static_cast<double>(i % 5)}); |
| 169 | + } |
| 170 | + // Batch |
| 171 | + const auto batch = t_batch.applyBatch(full); |
| 172 | + // Streaming point-by-point |
| 173 | + t_stream.reset(); |
| 174 | + std::vector<Point2> streamed; |
| 175 | + for (const auto& p : full) { |
| 176 | + if (auto r = t_stream.calculateNextPoint(p)) { |
| 177 | + streamed.push_back(*r); |
| 178 | + } |
| 179 | + } |
| 180 | + ASSERT_EQ(batch.size(), streamed.size()); |
| 181 | + for (size_t i = 0; i < batch.size(); ++i) { |
| 182 | + EXPECT_NEAR(batch[i].x, streamed[i].x, 1e-9) << "x mismatch at " << i; |
| 183 | + EXPECT_NEAR(batch[i].y, streamed[i].y, 1e-9) << "y mismatch at " << i; |
| 184 | + } |
| 185 | +} |
| 186 | + |
| 187 | +TEST(Transforms, StreamingMatchesBatch) { |
| 188 | + { |
| 189 | + AbsoluteTransform a, b; |
| 190 | + expectStreamingMatchesBatch(a, b); |
| 191 | + } |
| 192 | + { |
| 193 | + DerivativeTransform a, b; |
| 194 | + expectStreamingMatchesBatch(a, b); |
| 195 | + } |
| 196 | + { |
| 197 | + IntegralTransform a, b; |
| 198 | + expectStreamingMatchesBatch(a, b); |
| 199 | + } |
| 200 | + { |
| 201 | + MovingAverageTransform a, b; |
| 202 | + a.window = b.window = 5; |
| 203 | + expectStreamingMatchesBatch(a, b); |
| 204 | + } |
| 205 | + { |
| 206 | + MovingRMSTransform a, b; |
| 207 | + a.window = b.window = 5; |
| 208 | + expectStreamingMatchesBatch(a, b); |
| 209 | + } |
| 210 | + { |
| 211 | + TimeSincePreviousTransform a, b; |
| 212 | + expectStreamingMatchesBatch(a, b); |
| 213 | + } |
| 214 | + { |
| 215 | + BinaryFilterTransform a, b; |
| 216 | + a.op = b.op = BinaryOp::kGreater; |
| 217 | + a.a = b.a = 2.0; |
| 218 | + expectStreamingMatchesBatch(a, b); |
| 219 | + } |
| 220 | +} |
| 221 | + |
| 222 | +} // namespace |
0 commit comments