Additional arithmetic

gtsam/discrete/AlgebraicDecisionTree.h

@@ -70,6 +70,7 @@ namespace gtsam {
         return a / b;
       }
       static inline double id(const double& x) { return x; }
+      static inline double negate(const double& x) { return -x; }
     };
 
     AlgebraicDecisionTree(double leaf = 1.0) : Base(leaf) {}
@@ -186,6 +187,16 @@ namespace gtsam {
       return this->apply(g, &Ring::add);
     }
 
+    /** negation */
+    AlgebraicDecisionTree operator-() const {
+      return this->apply(&Ring::negate);
+    }
+
+    /** subtract */
+    AlgebraicDecisionTree operator-(const AlgebraicDecisionTree& g) const {
+      return *this + (-g);
+    }
+
     /** product */
     AlgebraicDecisionTree operator*(const AlgebraicDecisionTree& g) const {
       return this->apply(g, &Ring::mul);

gtsam/discrete/tests/testAlgebraicDecisionTree.cpp

@@ -10,10 +10,10 @@
  * -------------------------------------------------------------------------- */
 
 /*
- * @file    testDecisionTree.cpp
+ * @file   testAlgebraicDecisionTree.cpp
- * @brief    Develop DecisionTree
+ * @brief  Unit tests for Algebraic decision tree
- * @author  Frank Dellaert
+ * @author Frank Dellaert
- * @date  Mar 6, 2011
+ * @date   Mar 6, 2011
  */
 
 #include <gtsam/base/Testable.h>
@@ -46,23 +46,35 @@ void dot(const T& f, const string& filename) {
 #endif
 }
 
-/** I can't get this to work !
+/* ************************************************************************** */
- class Mul: std::function<double(const double&, const double&)> {
+// Test arithmetic:
- inline double operator()(const double& a, const double& b) {
+TEST(ADT, arithmetic) {
- return a * b;
+  DiscreteKey A(0, 2), B(1, 2);
- }
+  ADT zero{0}, one{1};
- };
+  ADT a(A, 1, 2);
+  ADT b(B, 3, 4);
 
- // If second argument of binary op is Leaf
+  // Addition
- template<typename L>
+  CHECK(assert_equal(a, zero + a));
- typename DecisionTree<L, double>::Node::Ptr DecisionTree<L,
+
- double>::Choice::apply_fC_op_gL( Cache& cache, const Leaf& gL, Mul op) const {
+  // Negate and subtraction
- Ptr h(new Choice(label(), cardinality()));
+  CHECK(assert_equal(-a, zero - a));
- for(const NodePtr& branch: branches_)
+  CHECK(assert_equal({zero}, a - a));
- h->push_back(branch->apply_f_op_g(cache, gL, op));
+  CHECK(assert_equal(a + b, b + a));
- return Unique(cache, h);
+  CHECK(assert_equal({A, 3, 4}, a + 2));
- }
+  CHECK(assert_equal({B, 1, 2}, b - 2));
- */
+
+  // Multiplication
+  CHECK(assert_equal(zero, zero * a));
+  CHECK(assert_equal(zero, a * zero));
+  CHECK(assert_equal(a, one * a));
+  CHECK(assert_equal(a, a * one));
+  CHECK(assert_equal(a * b, b * a));
+
+  // division
+  // CHECK(assert_equal(a, (a * b) / b)); // not true because no pruning
+  CHECK(assert_equal(b, (a * b) / a));
+}
 
 /* ************************************************************************** */
 // instrumented operators