diff --git a/src/storm/modelchecker/prctl/helper/rewardbounded/CostLimitClosure.cpp b/src/storm/modelchecker/prctl/helper/rewardbounded/CostLimitClosure.cpp index 2471093d7..3660a792a 100644 --- a/src/storm/modelchecker/prctl/helper/rewardbounded/CostLimitClosure.cpp +++ b/src/storm/modelchecker/prctl/helper/rewardbounded/CostLimitClosure.cpp @@ -92,7 +92,7 @@ namespace storm { bool CostLimitClosure::containsUpwardClosure(CostLimits const& costLimits) const { CostLimits infinityProjection(costLimits); - for (auto const& dim : downwardDimensions) { + for (auto dim : downwardDimensions) { infinityProjection[dim] = CostLimit::infinity(); } return contains(infinityProjection); @@ -104,7 +104,7 @@ namespace storm { bool CostLimitClosure::full() const { CostLimits p(dimension(), CostLimit(0)); - for (auto const& dim : downwardDimensions) { + for (auto dim : downwardDimensions) { p[dim] = CostLimit::infinity(); } return contains(p); diff --git a/src/storm/modelchecker/prctl/helper/rewardbounded/MemoryStateManager.cpp b/src/storm/modelchecker/prctl/helper/rewardbounded/MemoryStateManager.cpp index 1bbd69892..9defc53eb 100644 --- a/src/storm/modelchecker/prctl/helper/rewardbounded/MemoryStateManager.cpp +++ b/src/storm/modelchecker/prctl/helper/rewardbounded/MemoryStateManager.cpp @@ -61,12 +61,12 @@ namespace storm { STORM_LOG_ASSERT(dimensionCount > 0, "Invoked MemoryStateManager with zero dimension count."); STORM_LOG_ASSERT(dimensions.size() == dimensionCount, "Invalid size of given bitset."); if (value) { - for (auto const& d : dimensions) { + for (auto d : dimensions) { STORM_LOG_ASSERT(((dimensionBitMask << d) & dimensionsWithoutMemoryMask) == 0, "Tried to set a dimension to 'relevant'-memory state but the dimension is assumed to have no memory."); state |= (dimensionBitMask << d); } } else { - for (auto const& d : dimensions) { + for (auto d : dimensions) { STORM_LOG_ASSERT(((dimensionBitMask << d) & dimensionsWithoutMemoryMask) == 0, "Tried to set a dimension to 'unrelevant'-memory state but the dimension is assumed to have no memory."); state &= ~(dimensionBitMask << d); } diff --git a/src/storm/modelchecker/results/ExplicitQualitativeCheckResult.cpp b/src/storm/modelchecker/results/ExplicitQualitativeCheckResult.cpp index 0313cd8dc..fa2f539ab 100644 --- a/src/storm/modelchecker/results/ExplicitQualitativeCheckResult.cpp +++ b/src/storm/modelchecker/results/ExplicitQualitativeCheckResult.cpp @@ -215,7 +215,7 @@ namespace storm { if (this->isResultForAllStates()) { map_type newMap; - for (auto const& element : filterTruthValues) { + for (auto element : filterTruthValues) { newMap.emplace(element, this->getTruthValuesVector().get(element)); } this->truthValues = newMap; diff --git a/src/storm/solver/TerminationCondition.cpp b/src/storm/solver/TerminationCondition.cpp index db3f12efd..e3d629c65 100644 --- a/src/storm/solver/TerminationCondition.cpp +++ b/src/storm/solver/TerminationCondition.cpp @@ -69,7 +69,7 @@ namespace storm { if (useMinimum) { if (this->strict) { - for (auto const& pos : this->filter) { + for (auto pos : this->filter) { extremum = std::min(valueGetter(pos), extremum); if (extremum <= this->threshold) { cachedExtremumIndex = pos; @@ -77,7 +77,7 @@ namespace storm { } } } else { - for (auto const& pos : this->filter) { + for (auto pos : this->filter) { extremum = std::min(valueGetter(pos), extremum); if (extremum < this->threshold) { cachedExtremumIndex = pos; @@ -86,7 +86,7 @@ namespace storm { } } } else { - for (auto const& pos : this->filter) { + for (auto pos : this->filter) { extremum = std::max(valueGetter(pos), extremum); } } @@ -118,12 +118,12 @@ namespace storm { } if (useMinimum) { - for (auto const& pos : this->filter) { + for (auto pos : this->filter) { extremum = std::min(valueGetter(pos), extremum); } } else { if (this->strict) { - for (auto const& pos : this->filter) { + for (auto pos : this->filter) { extremum = std::max(valueGetter(pos), extremum); if (extremum >= this->threshold) { cachedExtremumIndex = pos; @@ -131,7 +131,7 @@ namespace storm { } } } else { - for (auto const& pos : this->filter) { + for (auto pos : this->filter) { extremum = std::max(valueGetter(pos), extremum); if (extremum > this->threshold) { cachedExtremumIndex = pos; diff --git a/src/storm/storage/expressions/SimpleValuation.cpp b/src/storm/storage/expressions/SimpleValuation.cpp index b91cd1f0f..3e2d6f029 100644 --- a/src/storm/storage/expressions/SimpleValuation.cpp +++ b/src/storm/storage/expressions/SimpleValuation.cpp @@ -122,7 +122,7 @@ namespace storm { sstr << "[" << std::endl; sstr << getManager() << std::endl; if (!booleanValues.empty()) { - for (auto const& element : booleanValues) { + for (auto element : booleanValues) { sstr << element << " "; } sstr << std::endl; diff --git a/src/storm/storage/geometry/ReduceVertexCloud.cpp b/src/storm/storage/geometry/ReduceVertexCloud.cpp index e3042ccaf..71e725d78 100644 --- a/src/storm/storage/geometry/ReduceVertexCloud.cpp +++ b/src/storm/storage/geometry/ReduceVertexCloud.cpp @@ -115,7 +115,7 @@ namespace storm { } if (timeOut > ) #endif - if (timeOut > 0 && totalTime.getTimeInMilliseconds() > timeOut) { + if (timeOut > 0 && static_cast(totalTime.getTimeInMilliseconds()) > timeOut) { for (uint64_t remainingPoint = pointIndex + 1; remainingPoint < input.size(); ++remainingPoint) { vertices.set(remainingPoint); }