80 lines
2.6 KiB
C++
80 lines
2.6 KiB
C++
/*
|
|
Copyright 2010, 2011, 2012 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"
|
|
#include <opm/core/props/pvt/PvtInterface.hpp>
|
|
|
|
#include <cassert>
|
|
|
|
namespace Opm
|
|
{
|
|
|
|
PvtInterface::PvtInterface()
|
|
: num_phases_(MaxNumPhases)
|
|
{
|
|
for (int i = 0; i < MaxNumPhases; ++i) {
|
|
phase_pos_[i] = i;
|
|
}
|
|
}
|
|
|
|
PvtInterface::~PvtInterface()
|
|
{
|
|
}
|
|
|
|
void PvtInterface::setPhaseConfiguration(const int num_phases, const int* phase_pos)
|
|
{
|
|
num_phases_ = num_phases;
|
|
for (int i = 0; i < MaxNumPhases; ++i) {
|
|
phase_pos_[i] = phase_pos[i];
|
|
}
|
|
}
|
|
|
|
void extractPvtTableIndex(std::vector<int> &pvtTableIdx,
|
|
Opm::DeckConstPtr deck,
|
|
size_t numCompressed,
|
|
const int *compressedToCartesianCellIdx)
|
|
{
|
|
if (deck->hasKeyword("PVTNUM")) {
|
|
// we have a "real" multi-pvt deck.
|
|
|
|
// get the PVT number from the deck
|
|
Opm::DeckKeywordConstPtr pvtnumKeyword = deck->getKeyword("PVTNUM");
|
|
const std::vector<int> &pvtnumData = pvtnumKeyword->getIntData();
|
|
|
|
// convert this into an array of compressed cells. since
|
|
// Eclipse uses Fortran-style indices which start at 1
|
|
// instead of 0, we subtract 1.
|
|
pvtTableIdx.resize(numCompressed);
|
|
for (size_t cellIdx = 0; cellIdx < numCompressed; ++ cellIdx) {
|
|
size_t cartesianCellIdx = compressedToCartesianCellIdx?compressedToCartesianCellIdx[cellIdx]:cellIdx;
|
|
assert(cartesianCellIdx < pvtnumData.size());
|
|
|
|
pvtTableIdx[cellIdx] = pvtnumData[cartesianCellIdx] - 1;
|
|
}
|
|
}
|
|
else {
|
|
// create the pvtIdxArray: all cells use the one and only
|
|
// PVT table...
|
|
pvtTableIdx.resize(numCompressed);
|
|
std::fill(pvtTableIdx.begin(), pvtTableIdx.end(), 0);
|
|
}
|
|
}
|
|
|
|
} // namespace Opm
|