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

address more review comments 

# Conflicts:
#	gtsam/hybrid/DCGaussianMixtureFactor.h
#	gtsam/hybrid/DCMixtureFactor.h
release/4.3a0
Varun Agrawal 2021-12-30 15:28:07 -05:00 committed by Frank Dellaert
parent b24da8399a
commit 26c48a8c1f
3 changed files with 25 additions and 34 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
gtsam/discrete/AlgebraicDecisionTree.h
View File

@ -30,14 +30,7 @@ namespace gtsam {
template<typename L>
class AlgebraicDecisionTree: public DecisionTree<L, double> {
/**
* @brief Default method for comparison of two doubles upto some tolerance.
*/
static bool DefaultComparator(double a, double b, double tol) {
return std::abs(a - b) < tol;
}
public:
public:
typedef DecisionTree<L, double> Super;
@ -146,9 +139,11 @@ namespace gtsam {
}
/// Equality method customized to node type `double`.
bool equals(const AlgebraicDecisionTree& other, double tol = 1e-9,
const std::function<bool(double, double, double)>& comparator =
&DefaultComparator) const {
bool equals(const AlgebraicDecisionTree& other, double tol = 1e-9) const {
// lambda for comparison of two doubles upto some tolerance.
auto comparator = [](double a, double b, double tol) {
return std::abs(a - b) < tol;
};
return this->root_->equals(*other.root_, tol, comparator);
}
};

21
gtsam/discrete/DecisionTree-inl.h
View File

@ -19,7 +19,6 @@
#pragma once
#include <gtsam/base/Testable.h>
#include <gtsam/discrete/DecisionTree.h>
#include <boost/assign/std/vector.hpp>
@ -78,8 +77,7 @@ namespace gtsam {
/** equality up to tolerance */
bool equals(const Node& q, double tol,
const std::function<bool(const Y&, const Y&, double)>&
comparator) const override {
const ComparatorFunc& comparator) const override {
const Leaf* other = dynamic_cast<const Leaf*>(&q);
if (!other) return false;
return comparator(this->constant_, other->constant_, tol);
@ -87,7 +85,7 @@ namespace gtsam {
/** print */
void print(const std::string& s,
const std::function<std::string(L)>& formatter) const override {
const FormatterFunc& formatter) const override {
bool showZero = true;
if (showZero || constant_) std::cout << s << " Leaf " << constant_ << std::endl;
}
@ -241,7 +239,7 @@ namespace gtsam {
/** print (as a tree) */
void print(const std::string& s,
const std::function<std::string(L)>& formatter) const override {
const FormatterFunc& formatter) const override {
std::cout << s << " Choice(";
std::cout << formatter(label_) << ") " << std::endl;
for (size_t i = 0; i < branches_.size(); i++)
@ -284,8 +282,7 @@ namespace gtsam {
/** equality up to tolerance */
bool equals(const Node& q, double tol,
const std::function<bool(const Y&, const Y&, double)>&
comparator) const override {
const ComparatorFunc& comparator) const override {
const Choice* other = dynamic_cast<const Choice*>(&q);
if (!other) return false;
if (this->label_ != other->label_) return false;
@ -651,16 +648,14 @@ namespace gtsam {
/*********************************************************************************/
template <typename L, typename Y>
bool DecisionTree<L, Y>::equals(
const DecisionTree& other, double tol,
const std::function<bool(const Y&, const Y&, double)>& comparator) const {
bool DecisionTree<L, Y>::equals(const DecisionTree& other, double tol,
const ComparatorFunc& comparator) const {
return root_->equals(*other.root_, tol, comparator);
}
template <typename L, typename Y>
void DecisionTree<L, Y>::print(
const std::string& s,
const std::function<std::string(L)>& formatter) const {
void DecisionTree<L, Y>::print(const std::string& s,
const FormatterFunc& formatter) const {
root_->print(s, formatter);
}

21
gtsam/discrete/DecisionTree.h
View File

@ -53,6 +53,9 @@ namespace gtsam {
public:
using FormatterFunc = std::function<std::string(L)>;
using ComparatorFunc = std::function<bool(const Y&, const Y&, double)>;
/** Handy typedefs for unary and binary function types */
typedef std::function<Y(const Y&)> Unary;
typedef std::function<Y(const Y&, const Y&)> Binary;
@ -91,15 +94,15 @@ namespace gtsam {
const void* id() const { return this; }
// everything else is virtual, no documentation here as internal
virtual void print(const std::string& s = "",
const std::function<std::string(L)>& formatter =
&DefaultFormatter) const = 0;
virtual void print(
const std::string& s = "",
const FormatterFunc& formatter = &DefaultFormatter) const = 0;
virtual void dot(std::ostream& os, bool showZero) const = 0;
virtual bool sameLeaf(const Leaf& q) const = 0;
virtual bool sameLeaf(const Node& q) const = 0;
virtual bool equals(const Node& other, double tol = 1e-9,
const std::function<bool(const Y&, const Y&, double)>&
comparator = &DefaultComparator) const = 0;
virtual bool equals(
const Node& other, double tol = 1e-9,
const ComparatorFunc& comparator = &DefaultComparator) const = 0;
virtual const Y& operator()(const Assignment<L>& x) const = 0;
virtual Ptr apply(const Unary& op) const = 0;
virtual Ptr apply_f_op_g(const Node&, const Binary&) const = 0;
@ -181,13 +184,11 @@ namespace gtsam {
/** GTSAM-style print */
void print(const std::string& s = "DecisionTree",
const std::function<std::string(L)>& formatter =
&DefaultFormatter) const;
const FormatterFunc& formatter = &DefaultFormatter) const;
// Testable
bool equals(const DecisionTree& other, double tol = 1e-9,
const std::function<bool(const Y&, const Y&, double)>&
comparator = &DefaultComparator) const;
const ComparatorFunc& comparator = &DefaultComparator) const;
/// @}
/// @name Standard Interface