OilfieldToolsNet/ResInsight
4
0
Fork 0
mirror of https://github.com/OPM/ResInsight.git synced 2025-02-25 18:55:39 -06:00
Code Issues Packages Projects Releases Wiki Activity

Rename ApplicationCode to ApplicationLibCode

Browse Source
This commit is contained in:
Gaute Lindkvist
2021-01-06 14:55:29 +01:00
parent 751df1a421
commit 81699db187
3242 changed files with 0 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

210
ApplicationLibCode/UnitTests/RigTimeCurveHistoryMerger-Test.cpp Normal file
View File

@@ -0,0 +1,210 @@
#include "gtest/gtest.h"
#include "RiaCurveMerger.h"
#include <cmath> // Needed for HUGE_VAL on Linux
//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
TEST( RiaTimeHistoryCurveMergerTest, TestDateInterpolation )
{
std::vector<double> values{ 2.0, 3.5, 5.0, 6.0 };
std::vector<time_t> timeSteps{ 1, 5, 10, 15 };
{
double val = RiaTimeHistoryCurveMerger::interpolatedYValue( 1, timeSteps, values );
EXPECT_EQ( 2.0, val );
}
{
double val = RiaTimeHistoryCurveMerger::interpolatedYValue( 0, timeSteps, values );
EXPECT_EQ( HUGE_VAL, val );
}
{
double val = RiaTimeHistoryCurveMerger::interpolatedYValue( 20, timeSteps, values );
EXPECT_EQ( HUGE_VAL, val );
}
{
double val = RiaTimeHistoryCurveMerger::interpolatedYValue( 3, timeSteps, values );
EXPECT_EQ( 2.75, val );
}
}
//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
TEST( RiaTimeHistoryCurveMergerTest, ExtractIntervalsWithSameTimeSteps )
{
std::vector<double> valuesA{ HUGE_VAL, 1.0, HUGE_VAL, 2.0, 2.5, 3.0, 4.0, 5.0, 6.0, HUGE_VAL };
std::vector<double> valuesB{ 10, 20, 30, 40, 45, HUGE_VAL, HUGE_VAL, 5.0, 6.0, HUGE_VAL };
EXPECT_EQ( valuesA.size(), valuesB.size() );
std::vector<time_t> timeSteps;
for ( size_t i = 0; i < 10; i++ )
{
timeSteps.push_back( i );
}
RiaTimeHistoryCurveMerger interpolate;
interpolate.addCurveData( timeSteps, valuesA );
interpolate.addCurveData( timeSteps, valuesB );
interpolate.computeInterpolatedValues();
auto interpolatedTimeSteps = interpolate.allXValues();
auto intervals = interpolate.validIntervalsForAllXValues();
EXPECT_EQ( 10, static_cast<int>( interpolatedTimeSteps.size() ) );
EXPECT_EQ( 3, static_cast<int>( intervals.size() ) );
}
//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
TEST( RiaTimeHistoryCurveMergerTest, ExtractIntervalsWithSameTimeStepsOneComplete )
{
std::vector<double> valuesA{ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0 };
std::vector<double> valuesB{ 10, 20, 30, HUGE_VAL, 50, HUGE_VAL, 70 };
EXPECT_EQ( valuesA.size(), valuesB.size() );
std::vector<time_t> timeSteps;
for ( size_t i = 0; i < 7; i++ )
{
timeSteps.push_back( i );
}
RiaTimeHistoryCurveMerger interpolate;
interpolate.addCurveData( timeSteps, valuesA );
interpolate.addCurveData( timeSteps, valuesB );
interpolate.computeInterpolatedValues();
auto interpolatedTimeSteps = interpolate.allXValues();
auto intervals = interpolate.validIntervalsForAllXValues();
EXPECT_EQ( 7, static_cast<int>( interpolatedTimeSteps.size() ) );
EXPECT_EQ( 3, static_cast<int>( intervals.size() ) );
}
//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
TEST( RiaTimeHistoryCurveMergerTest, ExtractIntervalsWithSameTimeStepsBothComplete )
{
std::vector<double> valuesA{ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0 };
std::vector<double> valuesB{ 10, 20, 30, 40, 50, 60, 70 };
EXPECT_EQ( valuesA.size(), valuesB.size() );
std::vector<time_t> timeSteps;
for ( size_t i = 0; i < 7; i++ )
{
timeSteps.push_back( i );
}
RiaTimeHistoryCurveMerger interpolate;
interpolate.addCurveData( timeSteps, valuesA );
interpolate.addCurveData( timeSteps, valuesB );
interpolate.computeInterpolatedValues();
auto interpolatedTimeSteps = interpolate.allXValues();
auto intervals = interpolate.validIntervalsForAllXValues();
EXPECT_EQ( 7, static_cast<int>( interpolatedTimeSteps.size() ) );
EXPECT_EQ( 1, static_cast<int>( intervals.size() ) );
}
//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
TEST( RiaTimeHistoryCurveMergerTest, OverlappintTimes )
{
std::vector<double> valuesA{ 1, 2, 3, 4, 5 };
std::vector<double> valuesB{ 10, 20, 30, 40, 50 };
EXPECT_EQ( valuesA.size(), valuesB.size() );
std::vector<time_t> timeStepsA{ 0, 10, 11, 15, 20 };
std::vector<time_t> timeStepsB{ 1, 2, 3, 5, 7 };
RiaTimeHistoryCurveMerger interpolate;
interpolate.addCurveData( timeStepsA, valuesA );
interpolate.addCurveData( timeStepsB, valuesB );
interpolate.computeInterpolatedValues();
EXPECT_EQ( 2, static_cast<int>( interpolate.curveCount() ) );
auto interpolatedTimeSteps = interpolate.allXValues();
auto intervals = interpolate.validIntervalsForAllXValues();
EXPECT_EQ( 10, static_cast<int>( interpolatedTimeSteps.size() ) );
EXPECT_EQ( 1, static_cast<int>( intervals.size() ) );
}
//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
TEST( RiaTimeHistoryCurveMergerTest, RobustUse )
{
{
RiaTimeHistoryCurveMerger curveMerger;
curveMerger.computeInterpolatedValues();
EXPECT_EQ( 0, static_cast<int>( curveMerger.allXValues().size() ) );
}
std::vector<double> valuesA{ 1, 2, 3, 4, 5 };
std::vector<double> valuesB{ 10, 20, 30 };
std::vector<time_t> timeStepsA{ 0, 10, 11, 15, 20 };
std::vector<time_t> timeStepsB{ 1, 2, 3 };
{
RiaTimeHistoryCurveMerger curveMerger;
curveMerger.addCurveData( timeStepsA, valuesA );
curveMerger.computeInterpolatedValues();
EXPECT_EQ( timeStepsA.size(), curveMerger.allXValues().size() );
EXPECT_EQ( timeStepsA.size(), curveMerger.interpolatedYValuesForAllXValues( 0 ).size() );
}
{
RiaTimeHistoryCurveMerger curveMerger;
curveMerger.addCurveData( timeStepsA, valuesA );
curveMerger.addCurveData( timeStepsB, valuesB );
// Execute interpolation twice is allowed
curveMerger.computeInterpolatedValues();
curveMerger.computeInterpolatedValues();
EXPECT_EQ( 8, static_cast<int>( curveMerger.allXValues().size() ) );
EXPECT_EQ( 8, static_cast<int>( curveMerger.interpolatedYValuesForAllXValues( 0 ).size() ) );
EXPECT_EQ( 8, static_cast<int>( curveMerger.interpolatedYValuesForAllXValues( 1 ).size() ) );
}
}
//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
TEST( RiaTimeHistoryCurveMergerTest, NoTimeStepOverlap )
{
std::vector<double> valuesA{ 1, 2, 3, 4, 5 };
std::vector<double> valuesB{ 10, 20, 30 };
std::vector<time_t> timeStepsA{ 0, 10, 11, 15, 20 };
std::vector<time_t> timeStepsB{ 100, 200, 300 };
{
RiaTimeHistoryCurveMerger curveMerger;
curveMerger.addCurveData( timeStepsA, valuesA );
curveMerger.addCurveData( timeStepsB, valuesB );
// Execute interpolation twice is allowed
curveMerger.computeInterpolatedValues();
EXPECT_EQ( 8, static_cast<int>( curveMerger.allXValues().size() ) );
EXPECT_EQ( 0, static_cast<int>( curveMerger.validIntervalsForAllXValues().size() ) );
}
}