misc.h

Go to the documentation of this file.

// g2o - General Graph Optimization
// Copyright (C) 2011 R. Kuemmerle, G. Grisetti, W. Burgard
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright notice,
//   this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright
//   notice, this list of conditions and the following disclaimer in the
//   documentation and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
// IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
// TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
// PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
// TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
#ifndef G2O_STUFF_MISC_H
#define G2O_STUFF_MISC_H
 
#include <cmath>
#include <memory>
 
#include "g2o/config.h"
#include "macros.h"
 
// @{
 
namespace g2o {
 
template <class T1, class T2, class Pred = std::less<T1> >
struct CmpPairFirst {
  bool operator()(const std::pair<T1, T2>& left,
                  const std::pair<T1, T2>& right) {
    return Pred()(left.first, right.first);
  }
};
 
inline constexpr double cst(long double v) { return (double)v; }
 
constexpr double const_pi() { return cst(3.14159265358979323846); }
 
template <typename T>
inline T square(T x) {
  return x * x;
}
 
template <typename T>
inline T hypot(T x, T y) {
  return (T)(std::sqrt(x * x + y * y));
}
 
template <typename T>
inline T hypot_sqr(T x, T y) {
  return x * x + y * y;
}
 
inline double deg2rad(double degree) {
  return degree * cst(0.01745329251994329576);
}
 
inline double rad2deg(double rad) { return rad * cst(57.29577951308232087721); }
 
inline double normalize_theta(double theta) {
  const double result = fmod(theta + const_pi(), 2.0 * const_pi());
  if (result <= 0.0) return result + const_pi();
  return result - const_pi();
}
 
inline double inverse_theta(double th) {
  return normalize_theta(th + const_pi());
}
 
inline double average_angle(double theta1, double theta2) {
  double x, y;
 
  x = std::cos(theta1) + std::cos(theta2);
  y = std::sin(theta1) + std::sin(theta2);
  if (x == 0 && y == 0)
    return 0;
  else
    return std::atan2(y, x);
}
 
template <typename T>
inline int sign(T x) {
  if (x > 0)
    return 1;
  else if (x < 0)
    return -1;
  else
    return 0;
}
 
template <typename T>
inline T clamp(T l, T x, T u) {
  if (x < l) return l;
  if (x > u) return u;
  return x;
}
 
template <typename T>
inline T wrap(T l, T x, T u) {
  T intervalWidth = u - l;
  while (x < l) x += intervalWidth;
  while (x > u) x -= intervalWidth;
  return x;
}
 
inline bool arrayHasNaN(const double* array, int size, int* nanIndex = 0) {
  for (int i = 0; i < size; ++i)
    if (g2o_isnan(array[i])) {
      if (nanIndex) *nanIndex = i;
      return true;
    }
  return false;
}
 
extern "C" {
typedef void (*ForceLinkFunction)(void);
}
 
struct ForceLinker {
  ForceLinker(ForceLinkFunction function) { (function)(); }
};
 
}  // namespace g2o
 
// @}
 
#endif