///////////////////////////////////////////////////////////////////////////////// // // Copyright (C) 2017- Statoil ASA // // ResInsight 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. // // ResInsight 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 at // for more details. // ///////////////////////////////////////////////////////////////////////////////// #include "RimEnsembleStatisticsCase.h" #include "RifEnsembleStatisticsReader.h" #include "RiaSummaryTools.h" #include "RigStatisticsMath.h" #include "RimEnsembleCurveSet.h" #include "RimSummaryCaseCollection.h" #include #include #include //-------------------------------------------------------------------------------------------------- /// Internal constants //-------------------------------------------------------------------------------------------------- #define DOUBLE_INF std::numeric_limits::infinity() //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- RimEnsembleStatisticsCase::RimEnsembleStatisticsCase( RimEnsembleCurveSet* curveSet ) { m_curveSet = curveSet; } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- const std::vector& RimEnsembleStatisticsCase::timeSteps() const { return m_timeSteps; } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- const std::vector& RimEnsembleStatisticsCase::p10() const { return m_p10Data; } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- const std::vector& RimEnsembleStatisticsCase::p50() const { return m_p50Data; } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- const std::vector& RimEnsembleStatisticsCase::p90() const { return m_p90Data; } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- const std::vector& RimEnsembleStatisticsCase::mean() const { return m_meanData; } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- QString RimEnsembleStatisticsCase::caseName() const { return "Ensemble Statistics"; } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- void RimEnsembleStatisticsCase::createSummaryReaderInterface() { m_statisticsReader.reset( new RifEnsembleStatisticsReader( this ) ); } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- RifSummaryReaderInterface* RimEnsembleStatisticsCase::summaryReader() { if ( !m_statisticsReader ) { createSummaryReaderInterface(); } return m_statisticsReader.get(); } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- const RimEnsembleCurveSet* RimEnsembleStatisticsCase::curveSet() const { return m_curveSet; } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- void RimEnsembleStatisticsCase::calculate( const std::vector& sumCases, bool includeIncompleteCurves ) { auto inputAddress = m_curveSet->summaryAddress(); if ( m_statisticsReader && inputAddress.isValid() ) { const std::vector& validCases = validSummaryCases( sumCases, inputAddress, includeIncompleteCurves ); calculate( validCases, inputAddress, includeIncompleteCurves ); } } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- void RimEnsembleStatisticsCase::calculate( const std::vector sumCases, const RifEclipseSummaryAddress& inputAddress, bool includeIncompleteCurves ) { std::vector allTimeSteps; std::vector> caseAndTimeStepValues; if ( !inputAddress.isValid() ) return; caseAndTimeStepValues.reserve( sumCases.size() ); for ( const auto& sumCase : sumCases ) { const auto& reader = sumCase->summaryReader(); if ( reader ) { const std::vector& timeSteps = reader->timeSteps( inputAddress ); std::vector values; reader->values( inputAddress, &values ); if ( values.empty() ) continue; if ( !includeIncompleteCurves && timeSteps.size() != values.size() ) continue; auto [resampledTimeSteps, resampledValues] = RiaSummaryTools::resampledValuesForPeriod( inputAddress, timeSteps, values, RiaDefines::DateTimePeriod::DAY ); if ( allTimeSteps.empty() ) allTimeSteps = resampledTimeSteps; caseAndTimeStepValues.push_back( resampledValues ); } } clearData(); m_timeSteps = allTimeSteps; for ( size_t timeStepIndex = 0; timeStepIndex < allTimeSteps.size(); timeStepIndex++ ) { std::vector valuesAtTimeStep; valuesAtTimeStep.reserve( sumCases.size() ); for ( const std::vector& caseValues : caseAndTimeStepValues ) { if ( timeStepIndex < caseValues.size() ) { valuesAtTimeStep.push_back( caseValues[timeStepIndex] ); } } double p10, p50, p90, mean; RigStatisticsMath::calculateStatisticsCurves( valuesAtTimeStep, &p10, &p50, &p90, &mean, RigStatisticsMath::PercentileStyle::SWITCHED ); m_p10Data.push_back( p10 ); m_p50Data.push_back( p50 ); m_p90Data.push_back( p90 ); m_meanData.push_back( mean ); } } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- RiaDefines::EclipseUnitSystem RimEnsembleStatisticsCase::unitSystem() const { if ( m_curveSet ) { return m_curveSet->summaryCaseCollection()->unitSystem(); } return RiaDefines::EclipseUnitSystem::UNITS_UNKNOWN; } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- void RimEnsembleStatisticsCase::clearData() { m_timeSteps.clear(); m_p10Data.clear(); m_p50Data.clear(); m_p90Data.clear(); m_meanData.clear(); } //-------------------------------------------------------------------------------------------------- /// //-------------------------------------------------------------------------------------------------- std::vector RimEnsembleStatisticsCase::validSummaryCases( const std::vector allSumCases, const RifEclipseSummaryAddress& inputAddress, bool includeIncompleteCurves ) { std::vector validCases; std::vector> times; time_t maxTimeStep = 0; for ( auto& sumCase : allSumCases ) { const auto& reader = sumCase->summaryReader(); if ( reader ) { const std::vector& timeSteps = reader->timeSteps( inputAddress ); if ( !timeSteps.empty() ) { time_t lastTimeStep = timeSteps.back(); if ( lastTimeStep > maxTimeStep ) maxTimeStep = lastTimeStep; times.push_back( std::make_pair( sumCase, lastTimeStep ) ); } } } for ( const auto& [sumCase, lastTimeStep] : times ) { // Previous versions tested on identical first time step, this test is now removed. For large simulations with // numerical issues the first time step can be slightly different // // https://github.com/OPM/ResInsight/issues/7774 // if ( !includeIncompleteCurves && lastTimeStep != maxTimeStep ) { continue; } validCases.push_back( sumCase ); } return validCases; }