12345qiupeng
/
gtsam
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix gcc warnings

release/4.3a0
cbeall3 2014-11-24 12:37:17 -05:00
parent 7aa07a9e16
commit 6fd24118be
2 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
gtsam/inference/MetisIndex-inl.h
View File

@ -42,7 +42,7 @@ void MetisIndex::augment(const FactorGraph<FACTOR>& factors)
// First: Record a copy of each key inside the factorgraph and create a // First: Record a copy of each key inside the factorgraph and create a
// key to integer mapping. This is referenced during the adjaceny step // key to integer mapping. This is referenced during the adjaceny step
for (size_t i = 0; i < factors.size(); i++){ for (size_t i = 0; i < factors.size(); i++){
if (factors[i]) if (factors[i]) {
BOOST_FOREACH(const Key& key, *factors[i]){ BOOST_FOREACH(const Key& key, *factors[i]){
keySet.insert(keySet.end(), key); // Keep a track of all unique keys keySet.insert(keySet.end(), key); // Keep a track of all unique keys
if (intKeyBMap_.left.find(key) == intKeyBMap_.left.end()){ if (intKeyBMap_.left.find(key) == intKeyBMap_.left.end()){
@ -51,6 +51,7 @@ void MetisIndex::augment(const FactorGraph<FACTOR>& factors)
} }
} }
} }
}
// Create an adjacency mapping that stores the set of all adjacent keys for every key // Create an adjacency mapping that stores the set of all adjacent keys for every key
for (size_t i = 0; i < factors.size(); i++){ for (size_t i = 0; i < factors.size(); i++){

2
gtsam/inference/Ordering.cpp
View File

@ -227,7 +227,7 @@ namespace gtsam {
} }
result.resize(size); result.resize(size);
for (size_t j = 0; j < size; ++j){ for (size_t j = 0; j < (size_t)size; ++j){
// We have to add the minKey value back to obtain the original key in the Values // We have to add the minKey value back to obtain the original key in the Values
result[j] = met.intToKey(perm[j]); result[j] = met.intToKey(perm[j]);
} }