To check out this repository please hg clone the following URL, or open the URL using EasyMercurial or your preferred Mercurial client.
root / test / TestPeakInterpolator.cpp @ 40:8f56ef28b0b1
History | View | Annotate | Download (3.03 KB)
| 1 |
/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
|
|---|---|
| 2 |
/*
|
| 3 |
This file is Copyright (c) 2012 Chris Cannam
|
| 4 |
|
| 5 |
Permission is hereby granted, free of charge, to any person
|
| 6 |
obtaining a copy of this software and associated documentation
|
| 7 |
files (the "Software"), to deal in the Software without
|
| 8 |
restriction, including without limitation the rights to use, copy,
|
| 9 |
modify, merge, publish, distribute, sublicense, and/or sell copies
|
| 10 |
of the Software, and to permit persons to whom the Software is
|
| 11 |
furnished to do so, subject to the following conditions:
|
| 12 |
|
| 13 |
The above copyright notice and this permission notice shall be
|
| 14 |
included in all copies or substantial portions of the Software.
|
| 15 |
|
| 16 |
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
| 17 |
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
| 18 |
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
| 19 |
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR
|
| 20 |
ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
|
| 21 |
CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
| 22 |
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
| 23 |
*/
|
| 24 |
|
| 25 |
#include "PeakInterpolator.h" |
| 26 |
|
| 27 |
#define BOOST_TEST_DYN_LINK
|
| 28 |
#define BOOST_TEST_MAIN
|
| 29 |
|
| 30 |
#include <boost/test/unit_test.hpp> |
| 31 |
|
| 32 |
BOOST_AUTO_TEST_SUITE(TestPeakInterpolator) |
| 33 |
|
| 34 |
BOOST_AUTO_TEST_CASE(peakAtSample_N3) |
| 35 |
{
|
| 36 |
double data[] = { 0.0, 1.0, 0.0 }; |
| 37 |
PeakInterpolator p; |
| 38 |
double result = p.findPeakLocation(data, 3, 1); |
| 39 |
BOOST_CHECK_EQUAL(result, 1.0); |
| 40 |
} |
| 41 |
|
| 42 |
BOOST_AUTO_TEST_CASE(peakAtSample_N5) |
| 43 |
{
|
| 44 |
double data[] = { 0.0, 1.0, 2.0, 1.0, 0.0 }; |
| 45 |
PeakInterpolator p; |
| 46 |
double result = p.findPeakLocation(data, 5, 2); |
| 47 |
BOOST_CHECK_EQUAL(result, 2.0); |
| 48 |
} |
| 49 |
|
| 50 |
BOOST_AUTO_TEST_CASE(flat) |
| 51 |
{
|
| 52 |
double data[] = { 1.0, 1.0, 1.0, 1.0, 1.0 }; |
| 53 |
PeakInterpolator p; |
| 54 |
double result = p.findPeakLocation(data, 5, 2); |
| 55 |
BOOST_CHECK_EQUAL(result, 2.0); |
| 56 |
} |
| 57 |
|
| 58 |
BOOST_AUTO_TEST_CASE(multiPeak) |
| 59 |
{
|
| 60 |
double data[] = { 1.0, 2.0, 1.0, 2.0, 1.0 }; |
| 61 |
PeakInterpolator p; |
| 62 |
double result = p.findPeakLocation(data, 5, 3); |
| 63 |
BOOST_CHECK_EQUAL(result, 3.0); |
| 64 |
} |
| 65 |
|
| 66 |
BOOST_AUTO_TEST_CASE(start) |
| 67 |
{
|
| 68 |
// Can't meaningfully interpolate if we're identifying element 0
|
| 69 |
// as the peak
|
| 70 |
double data[] = { 1.0, 1.0, 0.0, 0.0 }; |
| 71 |
PeakInterpolator p; |
| 72 |
double result = p.findPeakLocation(data, 4, 0); |
| 73 |
BOOST_CHECK_EQUAL(result, 0.0); |
| 74 |
} |
| 75 |
|
| 76 |
BOOST_AUTO_TEST_CASE(end) |
| 77 |
{
|
| 78 |
// Likewise for the final element
|
| 79 |
double data[] = { 0.0, 0.0, 1.0, 1.0 }; |
| 80 |
PeakInterpolator p; |
| 81 |
double result = p.findPeakLocation(data, 4, 3); |
| 82 |
BOOST_CHECK_EQUAL(result, 3.0); |
| 83 |
} |
| 84 |
|
| 85 |
BOOST_AUTO_TEST_CASE(longHalfway) |
| 86 |
{
|
| 87 |
double data[] = { 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 1.0, 1.0 }; |
| 88 |
PeakInterpolator p; |
| 89 |
double result = p.findPeakLocation(data, 8, 4); |
| 90 |
BOOST_CHECK_EQUAL(result, 3.5); |
| 91 |
} |
| 92 |
|
| 93 |
BOOST_AUTO_TEST_CASE(shortHalfway) |
| 94 |
{
|
| 95 |
double data[] = { 1.0, 2.0, 2.0, 1.0 }; |
| 96 |
PeakInterpolator p; |
| 97 |
double result = p.findPeakLocation(data, 4, 1); |
| 98 |
BOOST_CHECK_EQUAL(result, 1.5); |
| 99 |
} |
| 100 |
|
| 101 |
BOOST_AUTO_TEST_SUITE_END() |
| 102 |
|