mirror of
https://github.com/OPM/ResInsight.git
synced 2025-01-24 07:16:53 -06:00
d09ae4e1cb
* Experiments for supporting visualization of new ODB files from WIA workflow * Some more experiments to get odb working for wia results * More work in progress, experimenting to get wellIA result files to load properly * Make sure all part geometries use the same global bounding box * Clean up code * Add some safeguards for data calculations Move parts below grid in project tree * Fix warnings * Add support for C3D8RT elements Add some more safeguards for missing data Remove strange part handling * Support elements with reduced number of integration points by pretending to have 8. * Change integration point mapping to correct order (ref. Stein and Abaqus 2019 doc) * Do not allocate too much memory for element nodal results for 20 element node types * Code cleanup. Revert back to old integration point numbering scheme (ref. Stein) * And, another integration point order update... * Update comments
135 lines
5.7 KiB
C++
135 lines
5.7 KiB
C++
/////////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Copyright (C) 2015- Statoil ASA
|
|
// Copyright (C) 2015- Ceetron Solutions AS
|
|
//
|
|
// 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 <http://www.gnu.org/licenses/gpl.html>
|
|
// for more details.
|
|
//
|
|
/////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#pragma once
|
|
|
|
//==================================================================================================
|
|
///
|
|
//==================================================================================================
|
|
#include "RigFemPartCollection.h"
|
|
#include "RigFemPartResultsCollection.h"
|
|
#include "RigFemResultAddress.h"
|
|
#include "RigGeoMechCaseData.h"
|
|
#include "RigStatisticsCalculator.h"
|
|
|
|
#include "cvfArray.h"
|
|
|
|
class RigFemPartResultsCollection;
|
|
|
|
class RigFemNativeVisibleCellsStatCalc : public RigStatisticsCalculator
|
|
{
|
|
public:
|
|
RigFemNativeVisibleCellsStatCalc( RigGeoMechCaseData* femCase,
|
|
const RigFemResultAddress& resVarAddr,
|
|
const cvf::UByteArray* cellVisibilities );
|
|
|
|
void minMaxCellScalarValues( size_t timeStepIndex, double& min, double& max ) override;
|
|
void posNegClosestToZero( size_t timeStepIndex, double& pos, double& neg ) override;
|
|
void valueSumAndSampleCount( size_t timeStepIndex, double& valueSum, size_t& sampleCount ) override;
|
|
void addDataToHistogramCalculator( size_t timeStepIndex, RigHistogramCalculator& histogramCalculator ) override;
|
|
void uniqueValues( size_t timeStepIndex, std::set<int>& values ) override;
|
|
size_t timeStepCount() override;
|
|
|
|
private:
|
|
RigGeoMechCaseData* m_caseData;
|
|
RigFemPartResultsCollection* m_resultsData;
|
|
RigFemResultAddress m_resVarAddr;
|
|
cvf::cref<cvf::UByteArray> m_cellVisibilities;
|
|
|
|
template <typename StatisticsAccumulator>
|
|
void traverseElementNodes( StatisticsAccumulator& accumulator, size_t timeStepIndex )
|
|
{
|
|
int partCount = m_caseData->femParts()->partCount();
|
|
|
|
if ( m_resVarAddr.resultPosType == RIG_NODAL )
|
|
{
|
|
for ( int pIdx = 0; pIdx < partCount; ++pIdx )
|
|
{
|
|
RigFemPart* part = m_caseData->femParts()->part( pIdx );
|
|
const std::vector<float>& values = m_resultsData->resultValues( m_resVarAddr, pIdx, (int)timeStepIndex );
|
|
|
|
size_t nodeCount = values.size();
|
|
cvf::UByteArray nodeVisibilities( nodeCount );
|
|
nodeVisibilities.setAll( false );
|
|
|
|
int elmCount = part->elementCount();
|
|
for ( int elmIdx = 0; elmIdx < elmCount; ++elmIdx )
|
|
{
|
|
if ( !( *m_cellVisibilities )[elmIdx] ) continue;
|
|
|
|
int elmNodeCount = RigFemTypes::elementNodeCount( part->elementType( elmIdx ) );
|
|
for ( int elmLocIdx = 0; elmLocIdx < elmNodeCount; ++elmLocIdx )
|
|
{
|
|
size_t elmNodeResIdx = part->elementNodeResultIdx( elmIdx, elmLocIdx );
|
|
int nodeIdx = part->nodeIdxFromElementNodeResultIdx( elmNodeResIdx );
|
|
nodeVisibilities[nodeIdx] = true;
|
|
}
|
|
}
|
|
|
|
for ( size_t nodeIdx = 0; nodeIdx < nodeCount; ++nodeIdx )
|
|
{
|
|
if ( nodeVisibilities[nodeIdx] )
|
|
{
|
|
accumulator.addValue( values[nodeIdx] );
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if ( m_resVarAddr.resultPosType == RIG_ELEMENT )
|
|
{
|
|
for ( int pIdx = 0; pIdx < partCount; ++pIdx )
|
|
{
|
|
RigFemPart* part = m_caseData->femParts()->part( pIdx );
|
|
const std::vector<float>& values = m_resultsData->resultValues( m_resVarAddr, pIdx, (int)timeStepIndex );
|
|
int elmCount = part->elementCount();
|
|
|
|
for ( int elmIdx = 0; elmIdx < elmCount; ++elmIdx )
|
|
{
|
|
if ( !( *m_cellVisibilities )[elmIdx] ) continue;
|
|
|
|
accumulator.addValue( values[elmIdx] );
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
for ( int pIdx = 0; pIdx < partCount; ++pIdx )
|
|
{
|
|
RigFemPart* part = m_caseData->femParts()->part( pIdx );
|
|
const std::vector<float>& values = m_resultsData->resultValues( m_resVarAddr, pIdx, (int)timeStepIndex );
|
|
int elmCount = part->elementCount();
|
|
|
|
if ( values.empty() ) continue;
|
|
|
|
for ( int elmIdx = 0; elmIdx < elmCount; ++elmIdx )
|
|
{
|
|
if ( !( *m_cellVisibilities )[elmIdx] ) continue;
|
|
|
|
int elmNodeCount = RigFemTypes::elementNodeCount( part->elementType( elmIdx ) );
|
|
for ( int elmLocIdx = 0; elmLocIdx < elmNodeCount; ++elmLocIdx )
|
|
{
|
|
size_t elmNodeResIdx = part->elementNodeResultIdx( elmIdx, elmLocIdx );
|
|
accumulator.addValue( values[elmNodeResIdx] );
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
};
|