Browse Source

Fixed compiler warnings for unused lambda captures

tempestpy_adaptions
Matthias Volk 7 years ago
parent
commit
2658a02604
  1. 2
      src/storm-dft/storage/BucketPriorityQueue.cpp
  2. 2
      src/storm/builder/DdJaniModelBuilder.cpp
  3. 2
      src/storm/modelchecker/exploration/SparseExplorationModelChecker.cpp
  4. 2
      src/storm/storage/bisimulation/DeterministicModelBisimulationDecomposition.cpp
  5. 2
      src/storm/storage/bisimulation/NondeterministicModelBisimulationDecomposition.cpp

2
src/storm-dft/storage/BucketPriorityQueue.cpp

@ -9,7 +9,7 @@ namespace storm {
template<typename ValueType>
BucketPriorityQueue<ValueType>::BucketPriorityQueue(size_t nrBuckets, double lowerValue, double ratio) : lowerValue(lowerValue), logBase(std::log(ratio)), nrBuckets(nrBuckets), nrUnsortedItems(0), buckets(nrBuckets), currentBucket(nrBuckets) {
compare = ([this](HeuristicPointer a, HeuristicPointer b) {
compare = ([](HeuristicPointer a, HeuristicPointer b) {
return *a < *b;
});
}

2
src/storm/builder/DdJaniModelBuilder.cpp

@ -1275,7 +1275,7 @@ namespace storm {
// Finally treat the transient assignments.
std::map<storm::expressions::Variable, storm::dd::Add<Type, ValueType>> transientEdgeAssignments;
if (!this->transientVariables.empty()) {
performTransientAssignments(edge.getAssignments().getTransientAssignments(), [this, &transientEdgeAssignments, &guard, &sourceLocationAndGuard] (storm::jani::Assignment const& assignment) {
performTransientAssignments(edge.getAssignments().getTransientAssignments(), [this, &transientEdgeAssignments, &sourceLocationAndGuard] (storm::jani::Assignment const& assignment) {
transientEdgeAssignments[assignment.getExpressionVariable()] = sourceLocationAndGuard * this->variables.rowExpressionAdapter->translateExpression(assignment.getAssignedExpression());
} );
}

2
src/storm/modelchecker/exploration/SparseExplorationModelChecker.cpp

@ -341,7 +341,7 @@ namespace storm {
});
} else if (explorationInformation.useProbabilityHeuristic()) {
std::transform(row.begin(), row.end(), probabilities.begin(),
[&bounds, &explorationInformation] (storm::storage::MatrixEntry<StateType, ValueType> const& entry) {
[] (storm::storage::MatrixEntry<StateType, ValueType> const& entry) {
return entry.getValue();
});
}

2
src/storm/storage/bisimulation/DeterministicModelBisimulationDecomposition.cpp

@ -419,7 +419,7 @@ namespace storm {
// the sorting is over. Otherwise, this interferes with the data used in the sorting process.
storm::storage::sparse::state_type originalBlockIndex = block.getBeginIndex();
auto split = this->partition.splitBlock(block,
[&weakStateLabels,&block,originalBlockIndex,this] (storm::storage::sparse::state_type state1, storm::storage::sparse::state_type state2) {
[&weakStateLabels, originalBlockIndex,this] (storm::storage::sparse::state_type state1, storm::storage::sparse::state_type state2) {
return weakStateLabels[this->partition.getPosition(state1) - originalBlockIndex] < weakStateLabels[this->partition.getPosition(state2) - originalBlockIndex];
},
[this, &splitterQueue, &block] (bisimulation::Block<BlockDataType>& newBlock) {

2
src/storm/storage/bisimulation/NondeterministicModelBisimulationDecomposition.cpp

@ -367,7 +367,7 @@ namespace storm {
bool result = quotientDistributionsLess(state1, state2);
return result;
},
[this, &block, &splitterQueue, &newBlocks] (Block<BlockDataType>& newBlock) {
[&newBlocks] (Block<BlockDataType>& newBlock) {
newBlocks.push_back(&newBlock);
});

Loading…
Cancel
Save