Algorithm.hpp

#pragma once

#include <algorithm>
#include <functional>
#include <utility>

namespace AMDiS
{
  template <class InputIter, class Tp, class BinaryFunc>
  void split(InputIter first, InputIter last, Tp sep, BinaryFunc f)
  {
    if (first == last)
      return;

    while (true) {
      InputIter found = std::find(first, last, sep);
      f(first, found);
      if (found == last)
        break;
      first = ++found;
    }
  }

  template <class InputIter, class SeparaterIter, class BinaryFunc>
  void split(InputIter first, InputIter last, SeparaterIter s_first, SeparaterIter s_last, BinaryFunc f)
  {
    if (first == last)
      return;

    while (true) {
      InputIter found = std::find_first_of(first, last, s_first, s_last);
      f(first, found);
      if (found == last)
        break;
      first = ++found;
    }
  }

  // NOTE: backport of std::exclusive_scan from c++17
  template <class InputIter, class OutputIter, class Tp, class BinaryOperation>
  OutputIter exclusive_scan(InputIter first, InputIter last,
                            OutputIter result, Tp init, BinaryOperation binary_op)
  {
    while (first != last) {
      auto v = init;
      init = binary_op(init, *first);
      ++first;
      *result++ = std::move(v);
    }
    return result;
  }

  // NOTE: backport of std::exclusive_scan from c++17
  template <class InputIter, class OutputIter, class Tp>
  inline OutputIter exclusive_scan(InputIter first, InputIter last,
                                   OutputIter result, Tp init)
  {
    return AMDiS::exclusive_scan(first, last, result, std::move(init), std::plus<>());
  }

}