Function adjacent_for_each

src/include/migraphx/algorithm.hpp:165–177

/// Similiar to std::for_each but instead pass adjacent pairs to the function
template <class Iterator, class F>
Iterator adjacent_for_each(Iterator first, Iterator last, F f)
{
    if(first == last)
        return last;

    Iterator next = first;
    ++next;

    for(; next != last; ++next, ++first)
        f(*first, *next);

    return last;
}

/// Like std::for_each but can pass in another range like std::transform
template <class Iterator1, class Iterator2, class F>