Assignment.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 <functional>
#include <iostream>
#include <map>
#include <sstream>
#include <utility>
#include <vector>
 
namespace gtsam {
 
template <class L>
class Assignment : public std::map<L, size_t> {
  static std::string DefaultFormatter(const L& x) {
    std::stringstream ss;
    ss << x;
    return ss.str();
  }
 
 public:
  using std::map<L, size_t>::operator=;
 
  // Define the implicit default constructor.
  Assignment() = default;
 
  // Construct from initializer list.
  Assignment(std::initializer_list<std::pair<const L, size_t>> init)
      : std::map<L, size_t>{init} {}
 
  void print(const std::string& s = "Assignment: ",
             const std::function<std::string(L)>& labelFormatter =
                 &DefaultFormatter) const {
    std::cout << s << ": ";
    for (const typename Assignment::value_type& keyValue : *this) {
      std::cout << "(" << labelFormatter(keyValue.first) << ", "
                << keyValue.second << ")";
    }
    std::cout << std::endl;
  }
 
  bool equals(const Assignment& other, double tol = 1e-9) const {
    return (*this == other);
  }
 
  template <typename Derived = Assignment<L>>
  static std::vector<Derived> CartesianProduct(
      const std::vector<std::pair<L, size_t>>& keys) {
    std::vector<Derived> allPossValues;
    Derived values;
    typedef std::pair<L, size_t> DiscreteKey;
    for (const DiscreteKey& key : keys)
      values[key.first] = 0;  // Initialize from 0
    while (1) {
      allPossValues.push_back(values);
      size_t j = 0;
      for (j = 0; j < keys.size(); j++) {
        L idx = keys[j].first;
        values[idx]++;
        if (values[idx] < keys[j].second) break;
        // Wrap condition
        values[idx] = 0;
      }
      if (j == keys.size()) break;
    }
    return allPossValues;
  }
};  // Assignment
 
}  // namespace gtsam