AlgebraicDecisionTree.h

Go to the documentation of this file.

/* ----------------------------------------------------------------------------

 * GTSAM Copyright 2010, Georgia Tech Research Corporation,
 * Atlanta, Georgia 30332-0415
 * All Rights Reserved
 * Authors: Frank Dellaert, et al. (see THANKS for the full author list)

 * See LICENSE for the license information

 * -------------------------------------------------------------------------- */

#pragma once

#include <gtsam/discrete/DecisionTree-inl.h>

namespace gtsam {

  template<typename L>
  class AlgebraicDecisionTree: public DecisionTree<L, double> {

  public:

    typedef DecisionTree<L, double> Super;

    struct Ring {
      static inline double zero() {
        return 0.0;
      }
      static inline double one() {
        return 1.0;
      }
      static inline double add(const double& a, const double& b) {
        return a + b;
      }
      static inline double max(const double& a, const double& b) {
        return std::max(a, b);
      }
      static inline double mul(const double& a, const double& b) {
        return a * b;
      }
      static inline double div(const double& a, const double& b) {
        return a / b;
      }
      static inline double id(const double& x) {
        return x;
      }
    };

    AlgebraicDecisionTree() :
        Super(1.0) {
    }

    AlgebraicDecisionTree(const Super& add) :
        Super(add) {
    }

    AlgebraicDecisionTree(const L& label, double y1, double y2) :
        Super(label, y1, y2) {
    }

    AlgebraicDecisionTree(const typename Super::LabelC& labelC, double y1, double y2) :
        Super(labelC, y1, y2) {
    }

    AlgebraicDecisionTree //
    (const std::vector<typename Super::LabelC>& labelCs, const std::vector<double>& ys) {
      this->root_ = Super::create(labelCs.begin(), labelCs.end(), ys.begin(),
          ys.end());
    }

    AlgebraicDecisionTree //
    (const std::vector<typename Super::LabelC>& labelCs, const std::string& table) {
      // Convert string to doubles
      std::vector<double> ys;
      std::istringstream iss(table);
      std::copy(std::istream_iterator<double>(iss),
          std::istream_iterator<double>(), std::back_inserter(ys));

      // now call recursive Create
      this->root_ = Super::create(labelCs.begin(), labelCs.end(), ys.begin(),
          ys.end());
    }

    template<typename Iterator>
    AlgebraicDecisionTree(Iterator begin, Iterator end, const L& label) :
        Super(nullptr) {
      this->root_ = compose(begin, end, label);
    }

    template<typename M>
    AlgebraicDecisionTree(const AlgebraicDecisionTree<M>& other,
        const std::map<M, L>& map) {
      this->root_ = this->template convert<M, double>(other.root_, map,
          Ring::id);
    }

    AlgebraicDecisionTree operator+(const AlgebraicDecisionTree& g) const {
      return this->apply(g, &Ring::add);
    }

    AlgebraicDecisionTree operator*(const AlgebraicDecisionTree& g) const {
      return this->apply(g, &Ring::mul);
    }

    AlgebraicDecisionTree operator/(const AlgebraicDecisionTree& g) const {
      return this->apply(g, &Ring::div);
    }

    AlgebraicDecisionTree sum(const L& label, size_t cardinality) const {
      return this->combine(label, cardinality, &Ring::add);
    }

    AlgebraicDecisionTree sum(const typename Super::LabelC& labelC) const {
      return this->combine(labelC, &Ring::add);
    }

  };
// AlgebraicDecisionTree

}
// namespace gtsam