Removed extra 'typename'
parent
1a0c484a48
commit
afd2f6902f
|
@ -283,7 +283,7 @@ namespace gtsam {
|
||||||
/* ************************************************************************* */
|
/* ************************************************************************* */
|
||||||
template<>
|
template<>
|
||||||
inline BayesTree<IndexConditional>::BayesTree(const BayesNet<IndexConditional>& bayesNet) {
|
inline BayesTree<IndexConditional>::BayesTree(const BayesNet<IndexConditional>& bayesNet) {
|
||||||
typename BayesNet<IndexConditional>::const_reverse_iterator rit;
|
BayesNet<IndexConditional>::const_reverse_iterator rit;
|
||||||
for ( rit=bayesNet.rbegin(); rit != bayesNet.rend(); ++rit )
|
for ( rit=bayesNet.rbegin(); rit != bayesNet.rend(); ++rit )
|
||||||
insert(*this, *rit);
|
insert(*this, *rit);
|
||||||
}
|
}
|
||||||
|
@ -352,19 +352,6 @@ namespace gtsam {
|
||||||
typename CONTAINER::const_iterator lowestOrderedParent = min_element(parents.begin(), parents.end());
|
typename CONTAINER::const_iterator lowestOrderedParent = min_element(parents.begin(), parents.end());
|
||||||
assert(lowestOrderedParent != parents.end());
|
assert(lowestOrderedParent != parents.end());
|
||||||
return *lowestOrderedParent;
|
return *lowestOrderedParent;
|
||||||
|
|
||||||
// boost::optional<Index> parentCliqueRepresentative;
|
|
||||||
// boost::optional<size_t> lowest;
|
|
||||||
// BOOST_FOREACH(Index p, parents) {
|
|
||||||
// size_t i = index(p);
|
|
||||||
// if (!lowest || i<*lowest) {
|
|
||||||
// lowest.reset(i);
|
|
||||||
// parentCliqueRepresentative.reset(p);
|
|
||||||
// }
|
|
||||||
// }
|
|
||||||
// if (!lowest) throw
|
|
||||||
// invalid_argument("BayesTree::findParentClique: no parents given or key not present in index");
|
|
||||||
// return *parentCliqueRepresentative;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ************************************************************************* */
|
/* ************************************************************************* */
|
||||||
|
|
Loading…
Reference in New Issue