12345qiupeng
/
gtsam
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Use dict notation in print

release/4.3a0
Frank dellaert 2020-07-11 13:19:48 -04:00
parent 4c7ba2a98f
commit 33f0457298
1 changed files with 35 additions and 33 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

68
gtsam/discrete/Potentials.cpp
View File

@ -15,50 +15,52 @@
* @author Frank Dellaert * @author Frank Dellaert
*/ */
#include <gtsam/discrete/Potentials.h>
#include <gtsam/discrete/DecisionTree-inl.h> #include <gtsam/discrete/DecisionTree-inl.h>
#include <gtsam/discrete/Potentials.h>
#include <boost/format.hpp> #include <boost/format.hpp>
#include <string>
using namespace std; using namespace std;
namespace gtsam { namespace gtsam {
// explicit instantiation // explicit instantiation
template class DecisionTree<Key, double> ; template class DecisionTree<Key, double>;
template class AlgebraicDecisionTree<Key> ; template class AlgebraicDecisionTree<Key>;
/* ************************************************************************* */ /* ************************************************************************* */
double Potentials::safe_div(const double& a, const double& b) { double Potentials::safe_div(const double& a, const double& b) {
// cout << boost::format("%g / %g = %g\n") % a % b % ((a == 0) ? 0 : (a / b)); // cout << boost::format("%g / %g = %g\n") % a % b % ((a == 0) ? 0 : (a / b));
// The use for safe_div is when we divide the product factor by the sum factor. // The use for safe_div is when we divide the product factor by the sum
// If the product or sum is zero, we accord zero probability to the event. // factor. If the product or sum is zero, we accord zero probability to the
return (a == 0 || b == 0) ? 0 : (a / b); // event.
} return (a == 0 || b == 0) ? 0 : (a / b);
}
/* ******************************************************************************** */ /* ********************************************************************************
Potentials::Potentials() : */
ADT(1.0) { Potentials::Potentials() : ADT(1.0) {}
}
/* ******************************************************************************** */ /* ********************************************************************************
Potentials::Potentials(const DiscreteKeys& keys, const ADT& decisionTree) : */
ADT(decisionTree), cardinalities_(keys.cardinalities()) { Potentials::Potentials(const DiscreteKeys& keys, const ADT& decisionTree)
} : ADT(decisionTree), cardinalities_(keys.cardinalities()) {}
/* ************************************************************************* */ /* ************************************************************************* */
bool Potentials::equals(const Potentials& other, double tol) const { bool Potentials::equals(const Potentials& other, double tol) const {
return ADT::equals(other, tol); return ADT::equals(other, tol);
} }
/* ************************************************************************* */ /* ************************************************************************* */
void Potentials::print(const string& s, void Potentials::print(const string& s, const KeyFormatter& formatter) const {
const KeyFormatter& formatter) const { cout << s << "\n Cardinalities: {";
cout << s << "\n Cardinalities: "; for (const DiscreteKey& key : cardinalities_)
for(const DiscreteKey& key: cardinalities_) cout << formatter(key.first) << ":" << key.second << ", ";
cout << formatter(key.first) << "=" << formatter(key.second) << " "; cout << "}" << endl;
cout << endl; ADT::print(" ");
ADT::print(" "); }
}
// //
// /* ************************************************************************* */ // /* ************************************************************************* */
// template<class P> // template<class P>
@ -95,4 +97,4 @@ namespace gtsam {
/* ************************************************************************* */ /* ************************************************************************* */
} // namespace gtsam } // namespace gtsam