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

#10649 ApplicationLibCode: Use collection.empty() instead of comparing with size

Browse Source
This commit is contained in:
Kristian Bendiksen
2023-09-27 08:07:49 +02:00
parent 98796b0dd9
commit 959c9d48fa
220 changed files with 432 additions and 431 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
ApplicationLibCode/ResultStatisticsCache/RigStatisticsDataCache.cpp
View File

@@ -426,7 +426,7 @@ void RigStatisticsDataCache::computeHistogramStatisticsIfNeeded( size_t timeStep
//--------------------------------------------------------------------------------------------------
void RigStatisticsDataCache::computeUniqueValuesIfNeeded()
{
if ( m_statsAllTimesteps.m_uniqueValues.size() == 0 )
if ( m_statsAllTimesteps.m_uniqueValues.empty() )
{
std::set<int> setValues;
m_statisticsCalculator->uniqueValues( 0, setValues ); // This is a Hack ! Only using first timestep. Ok for
@@ -444,7 +444,7 @@ void RigStatisticsDataCache::computeUniqueValuesIfNeeded()
//--------------------------------------------------------------------------------------------------
void RigStatisticsDataCache::computeUniqueValuesIfNeeded( size_t timeStepIndex )
{
if ( m_statsPrTs[timeStepIndex].m_uniqueValues.size() == 0 )
if ( m_statsPrTs[timeStepIndex].m_uniqueValues.empty() )
{
std::set<int> setValues;
m_statisticsCalculator->uniqueValues( timeStepIndex, setValues );

4
ApplicationLibCode/ResultStatisticsCache/RigStatisticsMath.cpp
View File

@@ -182,7 +182,7 @@ std::vector<double> RigStatisticsMath::calculateNearestRankPercentiles( const st
std::sort( sortedValues.begin(), sortedValues.end() );
std::vector<double> percentiles( pValPositions.size(), HUGE_VAL );
if ( sortedValues.size() )
if ( !sortedValues.empty() )
{
for ( size_t i = 0; i < pValPositions.size(); ++i )
{
@@ -226,7 +226,7 @@ std::vector<double> RigStatisticsMath::calculateInterpolatedPercentiles( const s
std::sort( sortedValues.begin(), sortedValues.end() );
std::vector<double> percentiles( pValPositions.size(), HUGE_VAL );
if ( sortedValues.size() )
if ( !sortedValues.empty() )
{
for ( size_t i = 0; i < pValPositions.size(); ++i )
{