mirror of
https://github.com/OPM/ResInsight.git
synced 2025-02-25 18:55:39 -06:00
Fix compiler warnings
This commit is contained in:
@@ -99,7 +99,7 @@ bool RiaStdStringTools::startsWithAlphabetic(const std::string& s)
|
|||||||
{
|
{
|
||||||
if (s.empty()) return false;
|
if (s.empty()) return false;
|
||||||
|
|
||||||
return isalpha(s[0]);
|
return isalpha(s[0]) != 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
//--------------------------------------------------------------------------------------------------
|
//--------------------------------------------------------------------------------------------------
|
||||||
|
|||||||
@@ -183,8 +183,8 @@ void RigFemPart::calculateElmNeighbors()
|
|||||||
// The candidates are sorted from smallest to largest, so we do a linear search to find the
|
// The candidates are sorted from smallest to largest, so we do a linear search to find the
|
||||||
// (two) common cells in the two arrays, and leaving this element out, we have one candidate left
|
// (two) common cells in the two arrays, and leaving this element out, we have one candidate left
|
||||||
|
|
||||||
int idx1 = 0;
|
size_t idx1 = 0;
|
||||||
int idx2 = 0;
|
size_t idx2 = 0;
|
||||||
|
|
||||||
while (idx1 < candidates1.size() && idx2 < candidates2.size())
|
while (idx1 < candidates1.size() && idx2 < candidates2.size())
|
||||||
{
|
{
|
||||||
|
|||||||
Reference in New Issue
Block a user