mirror of
https://github.com/OPM/ResInsight.git
synced 2025-02-25 18:55:39 -06:00
(#561) Moved static methods to separate file
This commit is contained in:
@@ -18,6 +18,7 @@
|
||||
/////////////////////////////////////////////////////////////////////////////////
|
||||
|
||||
#include "RimWellLogExtractionCurve.h"
|
||||
#include "RimWellLogExtractionCurveImpl.h"
|
||||
|
||||
#include "RiaApplication.h"
|
||||
|
||||
@@ -224,9 +225,9 @@ void RimWellLogExtractionCurve::updatePlotData()
|
||||
|
||||
if (values.size() > 0 && values.size() == depthValues.size())
|
||||
{
|
||||
validCurvePointIntervals(depthValues, values, plotIntervals);
|
||||
addValuesFromIntervals(depthValues, plotIntervals, &filteredDepths);
|
||||
addValuesFromIntervals(values, plotIntervals, &filteredValues);
|
||||
RimWellLogExtractionCurveImpl::validCurvePointIntervals(depthValues, values, plotIntervals);
|
||||
RimWellLogExtractionCurveImpl::addValuesFromIntervals(depthValues, plotIntervals, &filteredDepths);
|
||||
RimWellLogExtractionCurveImpl::addValuesFromIntervals(values, plotIntervals, &filteredValues);
|
||||
}
|
||||
}
|
||||
else if (geomExtractor.notNull()) // geomExtractor
|
||||
@@ -238,16 +239,16 @@ void RimWellLogExtractionCurve::updatePlotData()
|
||||
|
||||
if (values.size() > 0 && values.size() == depthValues.size())
|
||||
{
|
||||
validCurvePointIntervals(depthValues, values, plotIntervals);
|
||||
addValuesFromIntervals(depthValues, plotIntervals, &filteredDepths);
|
||||
addValuesFromIntervals(values, plotIntervals, &filteredValues);
|
||||
RimWellLogExtractionCurveImpl::validCurvePointIntervals(depthValues, values, plotIntervals);
|
||||
RimWellLogExtractionCurveImpl::addValuesFromIntervals(depthValues, plotIntervals, &filteredDepths);
|
||||
RimWellLogExtractionCurveImpl::addValuesFromIntervals(values, plotIntervals, &filteredValues);
|
||||
}
|
||||
}
|
||||
|
||||
m_plotCurve->setSamples(filteredValues.data(), filteredDepths.data(), (int)filteredValues.size());
|
||||
|
||||
std::vector< std::pair<size_t, size_t> > fltrIntervals;
|
||||
filteredIntervals(plotIntervals, &fltrIntervals);
|
||||
RimWellLogExtractionCurveImpl::filteredIntervals(plotIntervals, &fltrIntervals);
|
||||
|
||||
m_plotCurve->setPlotIntervals(fltrIntervals);
|
||||
|
||||
@@ -393,132 +394,6 @@ void RimWellLogExtractionCurve::defineUiTreeOrdering(caf::PdmUiTreeOrdering& uiT
|
||||
uiTreeOrdering.setForgetRemainingFields(true);
|
||||
}
|
||||
|
||||
//--------------------------------------------------------------------------------------------------
|
||||
///
|
||||
//--------------------------------------------------------------------------------------------------
|
||||
void RimWellLogExtractionCurve::validCurvePointIntervals(const std::vector<double>& depthValues, const std::vector<double>& values, std::vector< std::pair<size_t, size_t> >& intervals)
|
||||
{
|
||||
std::vector< std::pair<size_t, size_t> > valuesIntervals;
|
||||
validValuesIntervals(values, valuesIntervals);
|
||||
|
||||
size_t intervalsCount = valuesIntervals.size();
|
||||
for (size_t intIdx = 0; intIdx < intervalsCount; intIdx++)
|
||||
{
|
||||
std::vector< std::pair<size_t, size_t> > depthValuesIntervals;
|
||||
validDepthValuesIntervals(depthValues, valuesIntervals[intIdx].first, valuesIntervals[intIdx].second, depthValuesIntervals);
|
||||
|
||||
for (size_t dvintIdx = 0; dvintIdx < depthValuesIntervals.size(); dvintIdx++)
|
||||
{
|
||||
intervals.push_back(depthValuesIntervals[dvintIdx]);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
//--------------------------------------------------------------------------------------------------
|
||||
///
|
||||
//--------------------------------------------------------------------------------------------------
|
||||
void RimWellLogExtractionCurve::validValuesIntervals(const std::vector<double>& values, std::vector< std::pair<size_t, size_t> >& intervals)
|
||||
{
|
||||
int startIdx = -1;
|
||||
size_t vIdx = 0;
|
||||
|
||||
size_t valueCount = values.size();
|
||||
while (vIdx < valueCount)
|
||||
{
|
||||
double value = values[vIdx];
|
||||
if (value == HUGE_VAL || value == -HUGE_VAL || value != value)
|
||||
{
|
||||
if (startIdx >= 0)
|
||||
{
|
||||
intervals.push_back(std::make_pair(startIdx, vIdx - 1));
|
||||
startIdx = -1;
|
||||
}
|
||||
}
|
||||
else if (startIdx < 0)
|
||||
{
|
||||
startIdx = (int) vIdx;
|
||||
}
|
||||
|
||||
vIdx++;
|
||||
}
|
||||
|
||||
if (startIdx >= 0 && startIdx < valueCount)
|
||||
{
|
||||
intervals.push_back(std::make_pair(startIdx, valueCount - 1));
|
||||
}
|
||||
}
|
||||
|
||||
//--------------------------------------------------------------------------------------------------
|
||||
///
|
||||
//--------------------------------------------------------------------------------------------------
|
||||
void RimWellLogExtractionCurve::validDepthValuesIntervals(const std::vector<double>& depthValues, size_t startIdx, size_t stopIdx, std::vector< std::pair<size_t, size_t> >& intervals)
|
||||
{
|
||||
if (startIdx > stopIdx)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
if (startIdx == stopIdx || stopIdx - startIdx == 1)
|
||||
{
|
||||
intervals.push_back(std::make_pair(startIdx, stopIdx));
|
||||
return;
|
||||
}
|
||||
|
||||
// !! TODO: Find a reasonable tolerance
|
||||
const double depthDiffTolerance = 0.1;
|
||||
|
||||
// Find intervals containing depth values that should be connected
|
||||
size_t intStartIdx = startIdx;
|
||||
for (size_t vIdx = startIdx + 1; vIdx < stopIdx; vIdx += 2)
|
||||
{
|
||||
if (abs(depthValues[vIdx + 1] - depthValues[vIdx]) > depthDiffTolerance)
|
||||
{
|
||||
intervals.push_back(std::make_pair(intStartIdx, vIdx));
|
||||
intStartIdx = vIdx + 1;
|
||||
}
|
||||
}
|
||||
|
||||
if (intStartIdx <= stopIdx)
|
||||
{
|
||||
intervals.push_back(std::make_pair(intStartIdx, stopIdx));
|
||||
}
|
||||
}
|
||||
|
||||
//--------------------------------------------------------------------------------------------------
|
||||
///
|
||||
//--------------------------------------------------------------------------------------------------
|
||||
void RimWellLogExtractionCurve::addValuesFromIntervals(const std::vector<double>& values, std::vector< std::pair<size_t, size_t> >& intervals, std::vector<double>* filteredValues)
|
||||
{
|
||||
CVF_ASSERT(filteredValues);
|
||||
|
||||
for (size_t intIdx = 0; intIdx < intervals.size(); intIdx++)
|
||||
{
|
||||
for (size_t vIdx = intervals[intIdx].first; vIdx <= intervals[intIdx].second; vIdx++)
|
||||
{
|
||||
filteredValues->push_back(values[vIdx]);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
//--------------------------------------------------------------------------------------------------
|
||||
///
|
||||
//--------------------------------------------------------------------------------------------------
|
||||
void RimWellLogExtractionCurve::filteredIntervals(const std::vector< std::pair<size_t, size_t> >& intervals, std::vector< std::pair<size_t, size_t> >* fltrIntervals)
|
||||
{
|
||||
CVF_ASSERT(fltrIntervals);
|
||||
|
||||
const size_t intervalCount = intervals.size();
|
||||
if (intervalCount < 1) return;
|
||||
|
||||
size_t index = 0;
|
||||
for (size_t intIdx = 0; intIdx < intervalCount; intIdx++)
|
||||
{
|
||||
size_t intervalSize = intervals[intIdx].second - intervals[intIdx].first + 1;
|
||||
fltrIntervals->push_back(std::make_pair(index, index + intervalSize - 1));
|
||||
|
||||
index += intervalSize;
|
||||
}
|
||||
}
|
||||
|
||||
//--------------------------------------------------------------------------------------------------
|
||||
///
|
||||
|
||||
Reference in New Issue
Block a user