Function adjacent_remove_if

src/include/migraphx/algorithm.hpp:144–161

/// Similiar to std::remove_if but instead pass adjacent pairs to the predicate
template <class Iterator, class Predicate>
Iterator adjacent_remove_if(Iterator first, Iterator last, Predicate p)
{
    first = std::adjacent_find(first, last, p);
    if(first == last)
        return first;
    auto i = first;
    while(std::next(++i) != last)
    {
        if(not p(*i, *std::next(i)))
        {
            *first = std::move(*i);
            ++first;
        }
    }
    *first = std::move(*i);
    ++first;
    return first;
}

/// Similiar to std::for_each but instead pass adjacent pairs to the function
template <class Iterator, class F>