Fixes to make new merged library compile

release/4.3a0
Alex Cunningham 2010-10-08 22:21:48 +00:00
parent 1d52ff90a8
commit 76f400232f
4 changed files with 6 additions and 5 deletions

View File

@ -6,6 +6,7 @@
*/
#pragma once
#include <stdio.h>
#include <string>
// simple class for accumulating execution timing information by name

View File

@ -47,7 +47,7 @@ Conditional::shared_ptr Factor::eliminateFirst() {
boost::shared_ptr<BayesNet<Conditional> > Factor::eliminate(varid_t nFrontals) {
assert(keys_.size() >= nFrontals);
checkSorted();
typename BayesNet<Conditional>::shared_ptr fragment(new BayesNet<Conditional>());
BayesNet<Conditional>::shared_ptr fragment(new BayesNet<Conditional>());
const_iterator nextFrontal = this->begin();
for(varid_t n = 0; n < nFrontals; ++n, ++nextFrontal)
fragment->push_back(Conditional::shared_ptr(new Conditional(nextFrontal, const_iterator(this->end()), 1)));

View File

@ -18,8 +18,8 @@ Inference::EliminateOneSymbolic(FactorGraph<Factor>& factorGraph, VariableIndex<
tic("EliminateOne");
// Get the factors involving the eliminated variable
typename VariableIndex<>::mapped_type& varIndexEntry(variableIndex[var]);
typedef typename VariableIndex<>::mapped_factor_type mapped_factor_type;
VariableIndex<>::mapped_type& varIndexEntry(variableIndex[var]);
typedef VariableIndex<>::mapped_factor_type mapped_factor_type;
if(!varIndexEntry.empty()) {

View File

@ -1,4 +1,4 @@
/*
/**
* GaussianJunctionTree.cpp
* Created on: Jul 12, 2010
* @author Kai Ni
@ -34,7 +34,7 @@ namespace gtsam {
}
// 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);
}
}