5f620f7451
If the keyword is present then the transimissibilities of the corresponding NNC entries will be scalled with the factor specified via EDITNNC. Multiple entries for the same cell pairs are allowed and will result in multiple scalings. Cell pairs specified in EDITNNC that are not present in NNC are silently ignored.
128 lines
4.4 KiB
C++
128 lines
4.4 KiB
C++
/*
|
|
Copyright 2015 IRIS
|
|
|
|
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 <opm/parser/eclipse/EclipseState/Grid/NNC.hpp>
|
|
#include <opm/parser/eclipse/Parser/Parser.hpp>
|
|
#include <opm/parser/eclipse/Parser/ParseContext.hpp>
|
|
#include <opm/parser/eclipse/Deck/Deck.hpp>
|
|
#include <opm/parser/eclipse/EclipseState/Grid/EclipseGrid.hpp>
|
|
#include <opm/parser/eclipse/EclipseState/EclipseState.hpp>
|
|
#include <opm/parser/eclipse/Units/Units.hpp>
|
|
|
|
#define BOOST_TEST_MODULE NNCTests
|
|
|
|
#include <boost/test/unit_test.hpp>
|
|
|
|
using namespace Opm;
|
|
|
|
inline std::string pathprefix() {
|
|
return boost::unit_test::framework::master_test_suite().argv[1];
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(noNNC)
|
|
{
|
|
auto eclipseState = Parser::parse(pathprefix() + "NNC/noNNC.DATA");
|
|
const auto& nnc = eclipseState.getInputNNC();
|
|
BOOST_CHECK(!eclipseState.hasInputNNC());
|
|
BOOST_CHECK(!nnc.hasNNC());
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(readDeck)
|
|
{
|
|
auto eclipseState = Parser::parse(pathprefix() + "NNC/NNC.DATA");
|
|
const auto& nnc = eclipseState.getInputNNC();
|
|
BOOST_CHECK(nnc.hasNNC());
|
|
const std::vector<NNCdata>& nncdata = nnc.nncdata();
|
|
|
|
// test the NNCs in nnc.DATA
|
|
// NNCs are orderd lexicographically
|
|
// Therefore the two equal NNCs are next to each other
|
|
BOOST_CHECK_EQUAL(nnc.numNNC(), 4);
|
|
BOOST_CHECK_EQUAL(nncdata[0].cell1, 0);
|
|
BOOST_CHECK_EQUAL(nncdata[0].cell2, 1);
|
|
BOOST_CHECK_EQUAL(nncdata[0].trans, 0.5 * Opm::Metric::Transmissibility);
|
|
BOOST_CHECK_EQUAL(nncdata[2].cell1, 0);
|
|
BOOST_CHECK_EQUAL(nncdata[2].cell2, 10);
|
|
BOOST_CHECK_EQUAL(nncdata[2].trans, 1.0 * Opm::Metric::Transmissibility);
|
|
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(addNNCfromDeck)
|
|
{
|
|
auto eclipseState = Parser::parse(pathprefix() + "NNC/NNC.DATA");
|
|
auto nnc = eclipseState.getInputNNC();
|
|
BOOST_CHECK(nnc.hasNNC());
|
|
const std::vector<NNCdata>& nncdata = nnc.nncdata();
|
|
|
|
BOOST_CHECK_EQUAL(nnc.numNNC(), 4);
|
|
// test add NNC
|
|
nnc.addNNC(2, 2, 2.0);
|
|
BOOST_CHECK_EQUAL(nnc.numNNC(), 5);
|
|
BOOST_CHECK_EQUAL(nncdata[4].cell1, 2);
|
|
BOOST_CHECK_EQUAL(nncdata[4].cell2, 2);
|
|
BOOST_CHECK_EQUAL(nncdata[4].trans, 2.0);
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(addNNC)
|
|
{
|
|
Opm::NNC nnc;
|
|
// add NNC
|
|
nnc.addNNC(2,2,2.0);
|
|
const std::vector<NNCdata>& nncdata = nnc.nncdata();
|
|
BOOST_CHECK_EQUAL(nnc.numNNC(), 1);
|
|
BOOST_CHECK_EQUAL(nncdata[0].cell1, 2);
|
|
BOOST_CHECK_EQUAL(nncdata[0].cell1, 2);
|
|
BOOST_CHECK_EQUAL(nncdata[0].trans, 2.0);
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(editNNC)
|
|
{
|
|
|
|
auto eclipseState = Parser::parse(pathprefix() + "NNC/EDITNNC.DATA");
|
|
const auto& nnc = eclipseState.getInputNNC();
|
|
BOOST_CHECK(nnc.hasNNC());
|
|
const std::vector<NNCdata>& nncdata = nnc.nncdata();
|
|
|
|
// test the NNCs in nnc.DATA
|
|
// note that these are ordered lexicographically
|
|
// 0: 1,1,1 -> 2,1,1
|
|
BOOST_CHECK_EQUAL(nncdata[0].cell1, 0);
|
|
BOOST_CHECK_EQUAL(nncdata[0].cell2, 1);
|
|
BOOST_CHECK_EQUAL(nncdata[0].trans, 1.0 * Opm::Metric::Transmissibility);
|
|
// 1: 1,1,1 -> 2,1,1
|
|
BOOST_CHECK_EQUAL(nncdata[0].cell1, 0);
|
|
BOOST_CHECK_EQUAL(nncdata[0].cell2, 1);
|
|
BOOST_CHECK_EQUAL(nncdata[0].trans, 1.0 * Opm::Metric::Transmissibility);
|
|
// 2: 1,1,1 -> 1,2,1
|
|
BOOST_CHECK_EQUAL(nncdata[2].cell1, 0);
|
|
BOOST_CHECK_EQUAL(nncdata[2].cell2, 10);
|
|
BOOST_CHECK_EQUAL(nncdata[2].trans, 1.0 * Opm::Metric::Transmissibility);
|
|
// 3: 1,2,1 -> 1,2,1
|
|
BOOST_CHECK_EQUAL(nncdata[3].cell1, 10);
|
|
BOOST_CHECK_EQUAL(nncdata[3].cell2, 10);
|
|
BOOST_CHECK_EQUAL(nncdata[3].trans, 10.0 * Opm::Metric::Transmissibility);
|
|
// 4: 2,2,1 -> 2,2,1
|
|
BOOST_CHECK_EQUAL(nncdata[4].cell1, 11);
|
|
BOOST_CHECK_EQUAL(nncdata[4].cell2, 11);
|
|
BOOST_CHECK_EQUAL(nncdata[4].trans, 6.0 * Opm::Metric::Transmissibility);
|
|
// There should be no entry due EDITNNC for 3,2,1 -> 3,2,1 as there is no nnc
|
|
BOOST_CHECK_EQUAL(nnc.numNNC(), 5);
|
|
|
|
}
|