Removing extraneous commented code from ISAM
							parent
							
								
									6da44cf80a
								
							
						
					
					
						commit
						43e3f865e9
					
				| 
						 | 
				
			
			@ -434,7 +434,6 @@ namespace gtsam {
 | 
			
		|||
	  newKeys[0] = key;
 | 
			
		||||
	  std::copy((*clique)->begin(), (*clique)->end(), newKeys.begin()+1);
 | 
			
		||||
	  clique->conditional_ = CONDITIONAL::FromKeys(newKeys, (*clique)->nrFrontals() + 1);
 | 
			
		||||
//	  clique->conditional_->addFrontal(conditional);
 | 
			
		||||
	  if(debug) clique->print("Expanded clique is ");
 | 
			
		||||
	  clique->assertInvariants();
 | 
			
		||||
	}
 | 
			
		||||
| 
						 | 
				
			
			
 | 
			
		|||
| 
						 | 
				
			
			@ -30,15 +30,10 @@ namespace gtsam {
 | 
			
		|||
 | 
			
		||||
  using namespace std;
 | 
			
		||||
 | 
			
		||||
  /** Create an empty Bayes Tree */
 | 
			
		||||
  /* ************************************************************************* */
 | 
			
		||||
  template<class CONDITIONAL>
 | 
			
		||||
  ISAM<CONDITIONAL>::ISAM() : BayesTree<CONDITIONAL>() {}
 | 
			
		||||
 | 
			
		||||
  /** Create a Bayes Tree from a Bayes Net */
 | 
			
		||||
//  template<class CONDITIONAL>
 | 
			
		||||
//  ISAM<CONDITIONAL>::ISAM(const BayesNet<CONDITIONAL>& bayesNet) :
 | 
			
		||||
//    BayesTree<CONDITIONAL>(bayesNet) {}
 | 
			
		||||
 | 
			
		||||
  /* ************************************************************************* */
 | 
			
		||||
  template<class CONDITIONAL>
 | 
			
		||||
	template<class FG> void ISAM<CONDITIONAL>::update_internal(
 | 
			
		||||
| 
						 | 
				
			
			@ -53,13 +48,6 @@ namespace gtsam {
 | 
			
		|||
    factors.push_back(newFactors);
 | 
			
		||||
 | 
			
		||||
    // eliminate into a Bayes net
 | 
			
		||||
//    GenericSequentialSolver<typename CONDITIONAL::FactorType> solver(factors);
 | 
			
		||||
//    typename BayesNet<CONDITIONAL>::shared_ptr bayesNet = solver.eliminate(function);
 | 
			
		||||
//
 | 
			
		||||
//    // insert conditionals back in, straight into the topless bayesTree
 | 
			
		||||
//    typename BayesNet<CONDITIONAL>::const_reverse_iterator rit;
 | 
			
		||||
//    for ( rit=bayesNet->rbegin(); rit != bayesNet->rend(); ++rit )
 | 
			
		||||
//      BayesTree<CONDITIONAL>::insert(*this,*rit);
 | 
			
		||||
    GenericMultifrontalSolver<typename CONDITIONAL::FactorType, JunctionTree<FG> > solver(factors);
 | 
			
		||||
    boost::shared_ptr<BayesTree<CONDITIONAL> > bayesTree;
 | 
			
		||||
    bayesTree = solver.eliminate(function);
 | 
			
		||||
| 
						 | 
				
			
			
 | 
			
		|||
| 
						 | 
				
			
			@ -38,9 +38,6 @@ namespace gtsam {
 | 
			
		|||
		/** Create an empty Bayes Tree */
 | 
			
		||||
		ISAM();
 | 
			
		||||
 | 
			
		||||
		/** Create a Bayes Tree from a Bayes Net */
 | 
			
		||||
		ISAM(const BayesNet<CONDITIONAL>& bayesNet);
 | 
			
		||||
 | 
			
		||||
		/** Copy constructor */
 | 
			
		||||
		ISAM(const Base& bayesTree) :
 | 
			
		||||
				Base(bayesTree) {
 | 
			
		||||
| 
						 | 
				
			
			
 | 
			
		|||
		Loading…
	
		Reference in New Issue