From f6f782a08801e428a2c846aa0f7de05a49562839 Mon Sep 17 00:00:00 2001 From: Frank Dellaert Date: Sat, 31 Dec 2022 14:41:26 -0500 Subject: [PATCH] Add static --- gtsam/hybrid/HybridGaussianFactorGraph.cpp | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) diff --git a/gtsam/hybrid/HybridGaussianFactorGraph.cpp b/gtsam/hybrid/HybridGaussianFactorGraph.cpp index eaf2d2966..05b617fce 100644 --- a/gtsam/hybrid/HybridGaussianFactorGraph.cpp +++ b/gtsam/hybrid/HybridGaussianFactorGraph.cpp @@ -81,7 +81,7 @@ static GaussianMixtureFactor::Sum &addGaussian( } /* ************************************************************************ */ -GaussianMixtureFactor::Sum sumFrontals( +static GaussianMixtureFactor::Sum sumFrontals( const HybridGaussianFactorGraph &factors) { // sum out frontals, this is the factor on the separator gttic(sum); @@ -136,7 +136,7 @@ GaussianMixtureFactor::Sum sumFrontals( } /* ************************************************************************ */ -std::pair +static std::pair continuousElimination(const HybridGaussianFactorGraph &factors, const Ordering &frontalKeys) { GaussianFactorGraph gfg; @@ -157,7 +157,7 @@ continuousElimination(const HybridGaussianFactorGraph &factors, } /* ************************************************************************ */ -std::pair +static std::pair discreteElimination(const HybridGaussianFactorGraph &factors, const Ordering &frontalKeys) { DiscreteFactorGraph dfg; @@ -182,7 +182,7 @@ discreteElimination(const HybridGaussianFactorGraph &factors, } /* ************************************************************************ */ -std::pair +static std::pair hybridElimination(const HybridGaussianFactorGraph &factors, const Ordering &frontalKeys, const KeySet &continuousSeparator, @@ -302,6 +302,7 @@ hybridElimination(const HybridGaussianFactorGraph &factors, return {boost::make_shared(conditional), factor}; } } + /* ************************************************************************ * Function to eliminate variables **under the following assumptions**: * 1. When the ordering is fully continuous, and the graph only contains