aboutsummaryrefslogtreecommitdiffstats
path: root/host/tests
diff options
context:
space:
mode:
authorMartin Braun <martin.braun@ettus.com>2020-04-09 11:20:29 -0700
committerAaron Rossetto <aaron.rossetto@ni.com>2020-04-17 07:58:19 -0500
commit760abdf70315be16943496a1a1375f78660d96d8 (patch)
tree220c0423ee6ccb4b6c4412f0f2538caa7e2d3514 /host/tests
parenta01dd2da5b647acf7524a4d064f5942d823c686c (diff)
downloaduhd-760abdf70315be16943496a1a1375f78660d96d8.tar.gz
uhd-760abdf70315be16943496a1a1375f78660d96d8.tar.bz2
uhd-760abdf70315be16943496a1a1375f78660d96d8.zip
lib: utils: interpolation: Add bilinear interpolation
This allows to treat a std::map<KeyType<std::map<KeyType, ValueType>> as a set of x-y coordinates, and bilinearly interpolate a z-value given four x/y pairs.
Diffstat (limited to 'host/tests')
-rw-r--r--host/tests/interpolation_test.cpp70
1 files changed, 69 insertions, 1 deletions
diff --git a/host/tests/interpolation_test.cpp b/host/tests/interpolation_test.cpp
index b3314c34a..4873f2214 100644
--- a/host/tests/interpolation_test.cpp
+++ b/host/tests/interpolation_test.cpp
@@ -6,6 +6,45 @@
#include <uhdlib/utils/interpolation.hpp>
#include <boost/test/unit_test.hpp>
+#include <string>
+
+BOOST_AUTO_TEST_CASE(test_get_bounding_iterators)
+{
+ using std::string;
+ using namespace uhd::math;
+
+ const std::map<double, string> data{{1.0, "leviathan wakes"}, {2.0, "calibans war"}};
+
+ const auto test1 = get_bounding_iterators(data, 1.1);
+ BOOST_CHECK_EQUAL(test1.first->first, 1.0);
+ BOOST_CHECK_EQUAL(test1.second->first, 2.0);
+ BOOST_CHECK_EQUAL(test1.first->second, "leviathan wakes");
+ BOOST_CHECK_EQUAL(test1.second->second, "calibans war");
+
+ const auto test2 = get_bounding_iterators(data, 0.5);
+ BOOST_CHECK_EQUAL(test2.first->first, 1.0);
+ BOOST_CHECK_EQUAL(test2.second->first, 1.0);
+ BOOST_CHECK_EQUAL(test2.first->second, "leviathan wakes");
+ BOOST_CHECK_EQUAL(test2.second->second, "leviathan wakes");
+
+ const auto test3 = get_bounding_iterators(data, 1e6);
+ BOOST_CHECK_EQUAL(test3.first->first, 2.0);
+ BOOST_CHECK_EQUAL(test3.second->first, 2.0);
+ BOOST_CHECK_EQUAL(test3.first->second, "calibans war");
+ BOOST_CHECK_EQUAL(test3.second->second, "calibans war");
+
+ const auto test4 = get_bounding_iterators(data, 2.0);
+ BOOST_CHECK_EQUAL(test4.first->first, 1.0);
+ BOOST_CHECK_EQUAL(test4.second->first, 2.0);
+ BOOST_CHECK_EQUAL(test4.first->second, "leviathan wakes");
+ BOOST_CHECK_EQUAL(test4.second->second, "calibans war");
+
+ const auto test5 = get_bounding_iterators(data, 1.0);
+ BOOST_CHECK_EQUAL(test5.first->first, 1.0);
+ BOOST_CHECK_EQUAL(test5.second->first, 1.0);
+ BOOST_CHECK_EQUAL(test5.first->second, "leviathan wakes");
+ BOOST_CHECK_EQUAL(test5.second->second, "leviathan wakes");
+}
BOOST_AUTO_TEST_CASE(test_interp)
{
@@ -20,7 +59,7 @@ BOOST_AUTO_TEST_CASE(test_interp)
BOOST_AUTO_TEST_CASE(test_map_interp)
{
using namespace uhd::math;
- std::map<double, double> test_data{{1.0, 1.0}, {2.0, 2.0}, {3.0, 3.0}};
+ const std::map<double, double> test_data{{1.0, 1.0}, {2.0, 2.0}, {3.0, 3.0}};
BOOST_CHECK_EQUAL(at_nearest(test_data, 1.1), 1.0);
BOOST_CHECK_EQUAL(at_nearest(test_data, 1.9), 2.0);
@@ -33,3 +72,32 @@ BOOST_AUTO_TEST_CASE(test_map_interp)
BOOST_CHECK_EQUAL(at_lin_interp(test_data, 137.0), 3.0);
}
+BOOST_AUTO_TEST_CASE(test_map_bilinear_interp)
+{
+ using namespace uhd::math;
+ // clang-format off
+ std::map<double, std::map<double, double>> test_data{
+ {1.0, {{1.0, 0.0}, {2.0, 1.0}}},
+ {2.0, {{1.0, 1.0}, {2.0, 2.0}}}
+ };
+ // clang-format on
+
+ BOOST_CHECK_CLOSE(at_bilin_interp(test_data, 1.5, 1.5), 1.0, 1e-6);
+ // Move y out of bounds, keep x in bounds
+ BOOST_CHECK_CLOSE(at_bilin_interp(test_data, 1.5, -17), 0.5, 1e-6);
+ BOOST_CHECK_CLOSE(at_bilin_interp(test_data, 1.5, 123.4), 1.5, 1e-6);
+ // Move x out of bounds, keep y in bounds
+ BOOST_CHECK_CLOSE(at_bilin_interp(test_data, -1e5, 1.5), 0.5, 1e-6);
+ BOOST_CHECK_CLOSE(at_bilin_interp(test_data, 1e9, 1.5), 1.5, 1e-6);
+ // Move x and y out of bounds
+ BOOST_CHECK_CLOSE(at_bilin_interp(test_data, -1e5, -1e6), 0.0, 1e-6);
+ BOOST_CHECK_CLOSE(at_bilin_interp(test_data, -1e5, 1e6), 1.0, 1e-6);
+ BOOST_CHECK_CLOSE(at_bilin_interp(test_data, 1e5, -1e6), 1.0, 1e-6);
+ BOOST_CHECK_CLOSE(at_bilin_interp(test_data, 1e5, 1e6), 2.0, 1e-6);
+ // Boundary conditions
+ BOOST_CHECK_EQUAL(at_bilin_interp(test_data, 1.0, 1.0), 0.0);
+ BOOST_CHECK_EQUAL(at_bilin_interp(test_data, 2.0, 2.0), 2.0);
+ BOOST_CHECK_EQUAL(at_bilin_interp(test_data, 1.0, 1.5), 0.5);
+ BOOST_CHECK_EQUAL(at_bilin_interp(test_data, 1.5, 2.0), 1.5);
+}
+