OilfieldToolsNet/opm-simulators
4
0
Fork 0
mirror of https://github.com/OPM/opm-simulators.git synced 2024-11-21 08:54:08 -06:00
Code Issues Packages Projects Releases Wiki Activity

fixing indent

Browse Source
This commit is contained in:
Vegard Kippe 2023-08-25 14:13:04 +02:00
parent 4ff08ffd2d
commit 0944cbbed9
1 changed files with 28 additions and 32 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

60
tests/test_tuning_TSINIT_NEXTSTEP.cpp
View File

@ -15,38 +15,34 @@ inline bool is_close(double a, double b, double tol = TOLERANCE) {
BOOST_AUTO_TEST_CASE(CheckTSINITAndNEXTSTEP)
{
//std::string case_name(boost::unit_test::framework::master_test_suite().argv[1]);
std::string case_name("02_TUNING_TSINIT_NEXTSTEP");
BOOST_TEST_MESSAGE("---------------------------------------------------------------------------");
BOOST_TEST_MESSAGE("Checking TSINIT and NEXTSTEP, see file " + case_name + ".DATA");
BOOST_TEST_MESSAGE("---------------------------------------------------------------------------");
Opm::EclIO::ESmry smry(case_name, false);
smry.loadData({"TIME"});
const auto& time = smry.get("TIME");
// First time step 1 day
BOOST_CHECK_CLOSE(time[0], 1.0, TOLERANCE);
//std::string case_name(boost::unit_test::framework::master_test_suite().argv[1]); std::string case_name("02_TUNING_TSINIT_NEXTSTEP");
BOOST_TEST_MESSAGE("---------------------------------------------------------------------------");
BOOST_TEST_MESSAGE("Checking TSINIT and NEXTSTEP, see file " + case_name + ".DATA");
BOOST_TEST_MESSAGE("---------------------------------------------------------------------------");
Opm::EclIO::ESmry smry(case_name, false);
smry.loadData({"TIME"});
const auto& time = smry.get("TIME");
for (size_t i=0; i<time.size(); ++i) {
std::cout << "######################################" << std::endl;
std::cout << time[i] << std::endl;
// Max time step 3 days initially
if (time[i] < 14.0) BOOST_CHECK(time[i+1] <= (time[i]+3.0));
// No short next step
if (is_close(time[i], 14.0)) BOOST_CHECK(time[i+1] > 15.1);
// Persistent NEXTSTEP=0.5
if (is_close(time[i], 31.0)) BOOST_CHECK_CLOSE(time[i+1], 31.5, TOLERANCE);
if (is_close(time[i], 45.0)) BOOST_CHECK_CLOSE(time[i+1], 45.5, TOLERANCE);
// Non-persistent NEXTSTEP=1.0
if (is_close(time[i], 60.0)) BOOST_CHECK_CLOSE(time[i+1], 61.0, TOLERANCE);
if (is_close(time[i], 74.0)) BOOST_CHECK(time[i+1] > 75.1);
// TSINIT=0.5
if (is_close(time[i], 91.0)) BOOST_CHECK_CLOSE(time[i+1], 91.5, TOLERANCE);
if (is_close(time[i], 105.0)) BOOST_CHECK(time[i+1] > 105.6);
}
// First time step 1 day
BOOST_CHECK_CLOSE(time[0], 1.0, TOLERANCE);
for (size_t i=0; i<time.size(); ++i) {
std::cout << "######################################" << std::endl;
std::cout << time[i] << std::endl;
// Max time step 3 days initially
if (time[i] < 14.0) BOOST_CHECK(time[i+1] <= (time[i]+3.0));
// No short next step
if (is_close(time[i], 14.0)) BOOST_CHECK(time[i+1] > 15.1);
// Persistent NEXTSTEP=0.5
if (is_close(time[i], 31.0)) BOOST_CHECK_CLOSE(time[i+1], 31.5, TOLERANCE);
if (is_close(time[i], 45.0)) BOOST_CHECK_CLOSE(time[i+1], 45.5, TOLERANCE);
// Non-persistent NEXTSTEP=1.0
if (is_close(time[i], 60.0)) BOOST_CHECK_CLOSE(time[i+1], 61.0, TOLERANCE);
if (is_close(time[i], 74.0)) BOOST_CHECK(time[i+1] > 75.1);
// TSINIT=0.5
if (is_close(time[i], 91.0)) BOOST_CHECK_CLOSE(time[i+1], 91.5, TOLERANCE);
if (is_close(time[i], 105.0)) BOOST_CHECK(time[i+1] > 105.6);
}
}