1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
/*
File : NSLPeakTest.cpp
Project : LabPlot
Description : NSL Tests for baseline functions
--------------------------------------------------------------------
SPDX-FileCopyrightText: 2023 Stefan Gerlach <stefan.gerlach@uni.kn>
SPDX-License-Identifier: GPL-2.0-or-later
*/
#include "NSLPeakTest.h"
#include "backend/nsl/nsl_peak.h"
#include <fstream>
// ##############################################################################
// ################# simple peak find
// ##############################################################################
void NSLPeakTest::testPeakSimple() {
double data[] = {4., 2., 5., 2., 3., 1., 0, 1};
const size_t N = 8;
const size_t result[] = {0, 2, 4, 7};
size_t np;
size_t* indices = nsl_peak_detect(data, N, np);
if (indices == nullptr) {
WARN("Error getting peaks")
return;
}
QCOMPARE(np, 4);
for (size_t i = 0; i < np; i++)
QCOMPARE(indices[i], result[i]);
free(indices);
}
void NSLPeakTest::testPeakHeight() {
double data[] = {4., 2., 5., 2., 3., 1., 0, 1};
const size_t N = 8;
const size_t result[] = {0, 2};
size_t np;
size_t* indices = nsl_peak_detect(data, N, np, 4.);
if (!indices) {
WARN("Error getting peaks")
return;
}
QCOMPARE(np, 2);
for (size_t i = 0; i < np; i++)
QCOMPARE(indices[i], result[i]);
free(indices);
}
void NSLPeakTest::testPeakDistance() {
double data[] = {4., 2., 5., 2., 3., 1., 0, 1};
const size_t N = 8;
const size_t result[] = {0, 4, 7};
size_t np;
size_t* indices = nsl_peak_detect(data, N, np, 0., 3);
if (!indices) {
WARN("Error getting peaks")
return;
}
QCOMPARE(np, 3);
for (size_t i = 0; i < np; i++)
QCOMPARE(indices[i], result[i]);
free(indices);
}
void NSLPeakTest::testPeakHeightDistance() {
double data[] = {4., 2., 5., 2., 3., 1., 0, 1};
const size_t N = 8;
const size_t result[] = {0, 4};
size_t np;
size_t* indices = nsl_peak_detect(data, N, np, 3., 3);
if (!indices) {
WARN("Error getting peaks")
return;
}
QCOMPARE(np, 2);
for (size_t i = 0; i < np; i++)
QCOMPARE(indices[i], result[i]);
free(indices);
}
/*void NSLPeakTest::testPeakX() {
std::ifstream d(QFINDTESTDATA(QLatin1String("data/spectrum.dat")).toStdString());
std::ifstream r(QFINDTESTDATA(QLatin1String("data/spectrum_arpls.dat")).toStdString());
const size_t N = 1000;
double data[N], result[N];
for (size_t i = 0; i < N; i++) {
d >> data[i];
r >> result[i];
}
nsl_baseline_remove_arpls(data, N, 1.e-2, 1.e4, 10);
for (size_t i = 0; i < N; ++i)
FuzzyCompare(data[i], result[i], 2.e-5);
}*/
QTEST_MAIN(NSLPeakTest)
|
