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

formatting and comments

release/4.3a0
Varun Agrawal 2024-10-23 11:37:55 -04:00
parent 977ac0d762
commit 4c74ec113a
2 changed files with 15 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
gtsam/hybrid/HybridGaussianConditional.cpp
View File

@ -25,12 +25,12 @@
#include <gtsam/hybrid/HybridValues.h>
#include <gtsam/inference/Conditional-inst.h>
#include <gtsam/linear/GaussianBayesNet.h>
#include <gtsam/linear/GaussianConditional.h>
#include <gtsam/linear/GaussianFactorGraph.h>
#include <gtsam/linear/JacobianFactor.h>
#include <cstddef>
#include <memory>
#include "gtsam/linear/GaussianConditional.h"
namespace gtsam {
/* *******************************************************************************/
@ -162,7 +162,7 @@ HybridGaussianConditional::HybridGaussianConditional(
/* *******************************************************************************/
const HybridGaussianConditional::Conditionals
HybridGaussianConditional::conditionals() const {
return Conditionals(factors(), [](const auto& pair) {
return Conditionals(factors(), [](auto &&pair) {
return std::dynamic_pointer_cast<GaussianConditional>(pair.first);
});
}
@ -170,7 +170,7 @@ HybridGaussianConditional::conditionals() const {
/* *******************************************************************************/
size_t HybridGaussianConditional::nrComponents() const {
size_t total = 0;
factors().visit([&total](const auto& node) {
factors().visit([&total](auto &&node) {
if (node.first) total += 1;
});
return total;
@ -196,7 +196,8 @@ bool HybridGaussianConditional::equals(const HybridFactor &lf,
if (e == nullptr) return false;
// Factors existence and scalar values are checked in BaseFactor::equals.
// Here we check additionally that the factors *are* conditionals and are equal.
// Here we check additionally that the factors *are* conditionals
// and are equal.
auto compareFunc = [tol](const GaussianFactorValuePair &pair1,
const GaussianFactorValuePair &pair2) {
auto c1 = std::dynamic_pointer_cast<GaussianConditional>(pair1.first),
@ -222,7 +223,8 @@ void HybridGaussianConditional::print(const std::string &s,
"", [&](Key k) { return formatter(k); },
[&](const GaussianFactorValuePair &pair) -> std::string {
RedirectCout rd;
if (auto gf = std::dynamic_pointer_cast<GaussianConditional>(pair.first)) {
if (auto gf =
std::dynamic_pointer_cast<GaussianConditional>(pair.first)) {
gf->print("", formatter);
return rd.str();
} else {

4
gtsam/hybrid/HybridGaussianFactorGraph.cpp
View File

@ -20,6 +20,7 @@
#include <gtsam/base/utilities.h>
#include <gtsam/discrete/Assignment.h>
#include <gtsam/discrete/DecisionTreeFactor.h>
#include <gtsam/discrete/DiscreteEliminationTree.h>
#include <gtsam/discrete/DiscreteFactorGraph.h>
#include <gtsam/discrete/DiscreteJunctionTree.h>
@ -48,8 +49,6 @@
#include <utility>
#include <vector>
#include "gtsam/discrete/DecisionTreeFactor.h"
namespace gtsam {
/// Specialize EliminateableFactorGraph for HybridGaussianFactorGraph:
@ -367,6 +366,7 @@ HybridGaussianFactorGraph::eliminate(const Ordering &keys) const {
// any difference in noise models used.
HybridGaussianProductFactor productFactor = collectProductFactor();
// Check if a factor is null
auto isNull = [](const GaussianFactor::shared_ptr &ptr) { return !ptr; };
// This is the elimination method on the leaf nodes