Fixes to make new merged library compile
parent
1d52ff90a8
commit
76f400232f
|
|
@ -6,6 +6,7 @@
|
||||||
*/
|
*/
|
||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
|
#include <stdio.h>
|
||||||
#include <string>
|
#include <string>
|
||||||
|
|
||||||
// simple class for accumulating execution timing information by name
|
// simple class for accumulating execution timing information by name
|
||||||
|
|
|
||||||
|
|
@ -47,7 +47,7 @@ Conditional::shared_ptr Factor::eliminateFirst() {
|
||||||
boost::shared_ptr<BayesNet<Conditional> > Factor::eliminate(varid_t nFrontals) {
|
boost::shared_ptr<BayesNet<Conditional> > Factor::eliminate(varid_t nFrontals) {
|
||||||
assert(keys_.size() >= nFrontals);
|
assert(keys_.size() >= nFrontals);
|
||||||
checkSorted();
|
checkSorted();
|
||||||
typename BayesNet<Conditional>::shared_ptr fragment(new BayesNet<Conditional>());
|
BayesNet<Conditional>::shared_ptr fragment(new BayesNet<Conditional>());
|
||||||
const_iterator nextFrontal = this->begin();
|
const_iterator nextFrontal = this->begin();
|
||||||
for(varid_t n = 0; n < nFrontals; ++n, ++nextFrontal)
|
for(varid_t n = 0; n < nFrontals; ++n, ++nextFrontal)
|
||||||
fragment->push_back(Conditional::shared_ptr(new Conditional(nextFrontal, const_iterator(this->end()), 1)));
|
fragment->push_back(Conditional::shared_ptr(new Conditional(nextFrontal, const_iterator(this->end()), 1)));
|
||||||
|
|
|
||||||
|
|
@ -18,8 +18,8 @@ Inference::EliminateOneSymbolic(FactorGraph<Factor>& factorGraph, VariableIndex<
|
||||||
tic("EliminateOne");
|
tic("EliminateOne");
|
||||||
|
|
||||||
// Get the factors involving the eliminated variable
|
// Get the factors involving the eliminated variable
|
||||||
typename VariableIndex<>::mapped_type& varIndexEntry(variableIndex[var]);
|
VariableIndex<>::mapped_type& varIndexEntry(variableIndex[var]);
|
||||||
typedef typename VariableIndex<>::mapped_factor_type mapped_factor_type;
|
typedef VariableIndex<>::mapped_factor_type mapped_factor_type;
|
||||||
|
|
||||||
if(!varIndexEntry.empty()) {
|
if(!varIndexEntry.empty()) {
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -1,4 +1,4 @@
|
||||||
/*
|
/**
|
||||||
* GaussianJunctionTree.cpp
|
* GaussianJunctionTree.cpp
|
||||||
* Created on: Jul 12, 2010
|
* Created on: Jul 12, 2010
|
||||||
* @author Kai Ni
|
* @author Kai Ni
|
||||||
|
|
@ -34,7 +34,7 @@ namespace gtsam {
|
||||||
}
|
}
|
||||||
|
|
||||||
// solve the bayes nets in the child nodes
|
// solve the bayes nets in the child nodes
|
||||||
BOOST_FOREACH(const typename BayesTree::sharedClique& child, current->children()) {
|
BOOST_FOREACH(const BayesTree::sharedClique& child, current->children()) {
|
||||||
btreeBackSubstitue(child, config);
|
btreeBackSubstitue(child, config);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue