FastSet.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/base/FastDefaultAllocator.h>

#include <set>
#include <iostream>
#include <string>
#include <cmath>
#include <boost/mpl/has_xxx.hpp>
#include <boost/utility/enable_if.hpp>
#include <boost/serialization/nvp.hpp>
#include <boost/serialization/set.hpp>

BOOST_MPL_HAS_XXX_TRAIT_DEF(print)

namespace gtsam {

// This is used internally to allow this container to be Testable even when it
// contains non-testable elements.
template<typename VALUE, class ENABLE = void>
struct FastSetTestableHelper;

template<typename VALUE, class ENABLE = void>
class FastSet: public std::set<VALUE, std::less<VALUE>, typename internal::FastDefaultAllocator<VALUE>::type> {

public:

  typedef std::set<VALUE, std::less<VALUE>, typename internal::FastDefaultAllocator<VALUE>::type> Base;

  FastSet() {
  }

  template<typename INPUTITERATOR>
  explicit FastSet(INPUTITERATOR first, INPUTITERATOR last) :
      Base(first, last) {
  }

  template<typename INPUTCONTAINER>
  explicit FastSet(const INPUTCONTAINER& container) :
      Base(container.begin(), container.end()) {
  }

  FastSet(const FastSet<VALUE>& x) :
      Base(x) {
  }

  FastSet(const Base& x) :
      Base(x) {
  }

#ifdef GTSAM_ALLOCATOR_BOOSTPOOL

  FastSet(const std::set<VALUE>& x) {
    // This if statement works around a bug in boost pool allocator and/or
    // STL vector where if the size is zero, the pool allocator will allocate
    // huge amounts of memory.
    if(x.size() > 0)
      Base::insert(x.begin(), x.end());
  }
#endif

  operator std::set<VALUE>() const {
    return std::set<VALUE>(this->begin(), this->end());
  }

  bool exists(const VALUE& e) const { return this->find(e) != this->end(); }

  void print(const std::string& str = "") const { FastSetTestableHelper<VALUE>::print(*this, str); }

  bool equals(const FastSet<VALUE>& other, double tol = 1e-9) const { return FastSetTestableHelper<VALUE>::equals(*this, other, tol); }

  void merge(const FastSet& other) {
    Base::insert(other.begin(),other.end());
  }

private:
  friend class boost::serialization::access;
  template<class ARCHIVE>
  void serialize(ARCHIVE & ar, const unsigned int version) {
    ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(Base);
  }
};

// This is the default Testable interface for *non*Testable elements, which
// uses stream operators.
template<typename VALUE, class ENABLE>
struct FastSetTestableHelper {

  typedef FastSet<VALUE> Set;

  static void print(const Set& set, const std::string& str) {
    std::cout << str << "\n";
    for (typename Set::const_iterator it = set.begin(); it != set.end(); ++it)
      std::cout << "  " << *it << "\n";
    std::cout.flush();
  }

  static bool equals(const Set& set1, const Set& set2, double tol) {
    typename Set::const_iterator it1 = set1.begin();
    typename Set::const_iterator it2 = set2.begin();
    while (it1 != set1.end()) {
      if (it2 == set2.end() ||
          fabs((double)(*it1) - (double)(*it2)) > tol)
        return false;
      ++it1;
      ++it2;
    }
    return true;
  }
};

// This is the Testable interface for Testable elements
template<typename VALUE>
struct FastSetTestableHelper<VALUE, typename boost::enable_if<has_print<VALUE> >::type> {

  typedef FastSet<VALUE> Set;

  static void print(const Set& set, const std::string& str) {
    std::cout << str << "\n";
    for (typename Set::const_iterator it = set.begin(); it != set.end(); ++it)
      it->print("  ");
    std::cout.flush();
  }

  static bool equals(const Set& set1, const Set& set2, double tol) {
    typename Set::const_iterator it1 = set1.begin();
    typename Set::const_iterator it2 = set2.begin();
    while (it1 != set1.end()) {
      if (it2 == set2.end() ||
          !it1->equals(*it2, tol))
        return false;
      ++it1;
      ++it2;
    }
    return true;
  }
};

}