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

Fix compilation error

release/4.3a0
Fan Jiang 2022-03-12 10:49:11 -05:00
parent efa37ff315
commit 3aac52c3d3
2 changed files with 27 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gtsam/hybrid/HybridFactor.h
View File

@ -36,8 +36,6 @@ typedef HybridFactor This; ///< This class
typedef boost::shared_ptr<HybridFactor> shared_ptr; ///< shared_ptr to this class typedef boost::shared_ptr<HybridFactor> shared_ptr; ///< shared_ptr to this class
typedef Factor Base; ///< Our base class typedef Factor Base; ///< Our base class
using Values = Values; ///< backwards compatibility
public: public:
/// @name Standard Constructors /// @name Standard Constructors
@ -78,6 +76,7 @@ Base::print(s, formatter);
// HybridFactor // HybridFactor
// traits // traits
template<> struct traits<HybridFactor> : public Testable<HybridFactor> {}; template<>
struct traits<HybridFactor> : public Testable<HybridFactor> {};
}// namespace gtsam }// namespace gtsam

3
gtsam/hybrid/HybridFactorGraph.cpp
View File

@ -29,6 +29,9 @@ EliminateHybrid(const HybridFactorGraph &factors,
// The issue here is that, how can we know which variable is discrete if we // The issue here is that, how can we know which variable is discrete if we
// unify Values? Obviously we can tell using the factors, but is that fast? // unify Values? Obviously we can tell using the factors, but is that fast?
// In the case of multifrontal, we will need to use a constrained ordering
// so that the discrete parts will be guaranteed to be eliminated last!
// PRODUCT: multiply all factors // PRODUCT: multiply all factors
gttic(product); gttic(product);
KeySet allKeys; KeySet allKeys;