33320270fc
The <have_boost_redef.hpp> header was introduced (commit 82369f9) as
a work-around for a particular interaction in the Autotools-based
setup of OPM-Core and the Dune core modules. Notably, Dune's
"Enable" trick for Boost failed on some older Autoconf systems. Now
that we're using CMake, however, that kluge is no longer needed
because we (OPM-Core) always
#define HAVE_BOOST 1
i.e., as an explict true/false value.
Therefore, we need no longer include <have_boost_redef.hpp> . The
header will be removed at a later time.
74 lines
2.6 KiB
C++
74 lines
2.6 KiB
C++
/*
|
|
Copyright 2010 SINTEF ICT, Applied Mathematics.
|
|
|
|
This file is part of the Open Porous Media project (OPM).
|
|
|
|
OPM is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
OPM 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 General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with OPM. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
#include <config.h>
|
|
|
|
#if defined(HAVE_DYNAMIC_BOOST_TEST)
|
|
#define BOOST_TEST_DYN_LINK
|
|
#endif
|
|
#define NVERBOSE // to suppress our messages when throwing
|
|
|
|
|
|
#define BOOST_TEST_MODULE UniformTableLinearTests
|
|
#include <boost/test/unit_test.hpp>
|
|
#include <opm/core/utility/UniformTableLinear.hpp>
|
|
|
|
|
|
|
|
BOOST_AUTO_TEST_CASE(table_operations)
|
|
{
|
|
// Make a simple table.
|
|
double yva[] = { 1.0, -1.0, 3.0, 4.0, 2.0 };
|
|
const int numvals = sizeof(yva)/sizeof(yva[0]);
|
|
std::vector<double> yv(yva, yva + numvals);
|
|
const double xmin = 1.0;
|
|
const double xdelta = 2.5;
|
|
const double xmax = xmin + (numvals - 1)*xdelta;
|
|
Opm::utils::UniformTableLinear<double> t1(xmin, xmax, yv);
|
|
Opm::utils::UniformTableLinear<double> t1_copy1(1.0, 11.0, yv);
|
|
Opm::utils::UniformTableLinear<double> t1_copy2(t1);
|
|
|
|
// Check equality.
|
|
BOOST_CHECK(t1 == t1_copy1);
|
|
BOOST_CHECK(t1 == t1_copy2);
|
|
|
|
// Check some evaluations.
|
|
for (int i = 0; i < numvals; ++i) {
|
|
BOOST_CHECK_EQUAL(t1(xmin + i*xdelta), yv[i]);
|
|
}
|
|
BOOST_CHECK_EQUAL(t1(2.25), 0.0);
|
|
BOOST_CHECK_EQUAL(t1(9.75), 3.0);
|
|
BOOST_CHECK_EQUAL(t1.derivative(9.75), -2.0/xdelta);
|
|
// Until we implement anything but the ClosestValue end policy, we only test that.
|
|
BOOST_CHECK_EQUAL(t1(xmin - 1.0), yv[0]);
|
|
BOOST_CHECK_EQUAL(t1(xmax + 1.0), yv.back());
|
|
|
|
// Domains.
|
|
BOOST_CHECK_EQUAL(t1.domain().first, xmin);
|
|
BOOST_CHECK_EQUAL(t1.domain().second, xmin + (numvals-1)*xdelta);
|
|
std::pair<double, double> new_domain(-100.0, 20.0);
|
|
t1.rescaleDomain(new_domain);
|
|
BOOST_CHECK_EQUAL(t1.domain().first, new_domain.first);
|
|
BOOST_CHECK_EQUAL(t1.domain().second, new_domain.second);
|
|
for (int i = 0; i < numvals; ++i) {
|
|
BOOST_CHECK_EQUAL(t1(-100.0 + i*120.0/(double(numvals - 1))), yv[i]);
|
|
}
|
|
BOOST_CHECK_EQUAL(t1(-85.0), 0.0);
|
|
BOOST_CHECK(std::fabs(t1.derivative(0.0) + 2.0/30.0) < 1e-14);
|
|
}
|