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

Fixed compile errors on Linux

release/4.3a0
Richard Roberts 2013-08-11 00:56:50 +00:00
parent 4e2f2c3822
commit 094fffeea7
3 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
gtsam/base/FastMap.h
View File

@ -59,7 +59,7 @@ public:
}
/** Handy 'exists' function */
bool exists(const KEY& e) const { return find(e) != end(); }
bool exists(const KEY& e) const { return this->find(e) != this->end(); }
private:
/** Serialization function */

2
gtsam/base/FastSet.h
View File

@ -92,7 +92,7 @@ public:
}
/** Handy 'exists' function */
bool exists(const VALUE& e) const { return find(e) != end(); }
bool exists(const VALUE& e) const { return this->find(e) != this->end(); }
/** Print to implement Testable */
void print(const std::string& str = "") const { FastSetTestableHelper<VALUE>::print(*this, str); }

4
gtsam/inference/BayesTree-inst.h
View File

@ -339,7 +339,7 @@ namespace gtsam {
// Factor the shortcuts to be conditioned on the full root
// Get the set of variables to eliminate, which is C1\B.
gttic(Full_root_factoring);
boost::shared_ptr<EliminationTraitsType::BayesTreeType> p_C1_B; {
boost::shared_ptr<typename EliminationTraitsType::BayesTreeType> p_C1_B; {
std::vector<Index> C1_minus_B; {
FastSet<Index> C1_minus_B_set(C1->conditional()->beginParents(), C1->conditional()->endParents());
BOOST_FOREACH(const Index j, *B->conditional()) {
@ -351,7 +351,7 @@ namespace gtsam {
boost::tie(p_C1_B, temp_remaining) =
FactorGraphType(p_C1_Bred).eliminatePartialMultifrontal(Ordering(C1_minus_B), function);
}
boost::shared_ptr<EliminationTraitsType::BayesTreeType> p_C2_B; {
boost::shared_ptr<typename EliminationTraitsType::BayesTreeType> p_C2_B; {
std::vector<Index> C2_minus_B; {
FastSet<Index> C2_minus_B_set(C2->conditional()->beginParents(), C2->conditional()->endParents());
BOOST_FOREACH(const Index j, *B->conditional()) {