algorithms.h

Go to the documentation of this file.

/*
 *
 *    Copyright (c) 2014-2020
 *      SMASH Team
 *
 *    GNU General Public License (GPLv3 or later)
 *
 */
 
#ifndef SRC_INCLUDE_SMASH_ALGORITHMS_H_
#define SRC_INCLUDE_SMASH_ALGORITHMS_H_
 
#include <algorithm>
#include <cmath>
#include <utility>
 
namespace smash {
 
template <typename Iterator>
static bool enforce_periodic_boundaries(
    Iterator begin, const Iterator &end,
    typename std::iterator_traits<Iterator>::value_type length) {
  bool had_to_wrap = false;
  for (; begin != end; ++begin) {
    auto &x = *begin;
    if (x < 0) {
      had_to_wrap = true;
      x += length;
    } else if (x >= length) {
      had_to_wrap = true;
      x -= length;
    }
  }
  return had_to_wrap;
}
 
template <typename Container, typename UnaryPredicate>
inline bool all_of(Container &&c, UnaryPredicate &&p) {
  return std::all_of(std::begin(c), std::end(c),
                     std::forward<UnaryPredicate>(p));
}
 
template <typename Container, typename UnaryFunction>
inline UnaryFunction for_each(Container &&c, UnaryFunction &&f) {
  return std::for_each(std::begin(c), std::end(c),
                       std::forward<UnaryFunction>(f));
}
 
}  // namespace smash
 
#endif  // SRC_INCLUDE_SMASH_ALGORITHMS_H_