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
|
// -*- C++ -*-
/**
* @brief The test file of class FilteringWindows
* This tests the Hamming and Hann classes
*
* Copyright 2005-2025 Airbus-EDF-IMACS-ONERA-Phimeca
*
* This library is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this library. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "openturns/OT.hxx"
#include "openturns/OTtestcode.hxx"
using namespace OT;
using namespace OT::Test;
int main(int, char *[])
{
TESTPREAMBLE;
OStream fullprint(std::cout);
try
{
/* Hann filter */
Hann myHanningFilter;
fullprint << "myHanningFilter = " << myHanningFilter << std::endl;
/* Hamming filter */
Hamming myHammingFilter;
fullprint << "myHammingFilter = " << myHammingFilter << std::endl;
/* Evaluation of values between t=0 and t=1 using a step = 0.01 */
const UnsignedInteger steps(100);
const Scalar tMin = 0.0;
const Scalar tMax = 1.0;
const Scalar tStep = (tMax - tMin) / steps;
for (UnsignedInteger i = 0; i < steps + 1; ++i )
{
const Scalar t = tMin + i * tStep;
fullprint << "t = " << t
<< " Hann = " << myHanningFilter(t)
<< " Hamming = " << myHammingFilter(t) << std::endl;
}
}
catch (TestFailed & ex)
{
std::cerr << ex << std::endl;
return ExitCode::Error;
}
return ExitCode::Success;
}
|
