adjacent_difference

 /**
   *  @brief  Return differences between adjacent values.
   *
   *  Computes the difference between adjacent values in the range
   *  [first,last) using operator-() and writes the result to @p __result.
   *
   *  @param  __first  Start of input range.
   *  @param  __last  End of input range.
   *  @param  __result  Output sums.
   *  @return  Iterator pointing just beyond the values written to result.
   *
   *  _GLIBCXX_RESOLVE_LIB_DEFECTS
   *  DR 539. partial_sum and adjacent_difference should mention requirements
   */
  template<typename _InputIterator, typename _OutputIterator>
    _OutputIterator
    adjacent_difference(_InputIterator __first,
            _InputIterator __last, _OutputIterator __result)
    {
      typedef typename iterator_traits<_InputIterator>::value_type _ValueType;

      // concept requirements
      __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
      __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
                                         _ValueType>)
      __glibcxx_requires_valid_range(__first, __last);

      if (__first == __last)
    return __result;
      _ValueType __value = *__first;
      *__result = __value;
      while (++__first != __last)
    {
      _ValueType __tmp = *__first;
      *++__result = __tmp - __value;
      __value = _GLIBCXX_MOVE(__tmp);
    }
      return ++__result;
    }

  /**
   *  @brief  Return differences between adjacent values.
   *
   *  Computes the difference between adjacent values in the range
   *  [__first,__last) using the function object @p __binary_op and writes the
   *  result to @p __result.
   *
   *  @param  __first  Start of input range.
   *  @param  __last  End of input range.
   *  @param  __result  Output sum.
   *  @param  __binary_op Function object.
   *  @return  Iterator pointing just beyond the values written to result.
   *
   *  _GLIBCXX_RESOLVE_LIB_DEFECTS
   *  DR 539. partial_sum and adjacent_difference should mention requirements
   */
  template<typename _InputIterator, typename _OutputIterator,
       typename _BinaryOperation>
    _OutputIterator
    adjacent_difference(_InputIterator __first, _InputIterator __last,
            _OutputIterator __result, _BinaryOperation __binary_op)
    {
      typedef typename iterator_traits<_InputIterator>::value_type _ValueType;

      // concept requirements
      __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
      __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
                                         _ValueType>)
      __glibcxx_requires_valid_range(__first, __last);

      if (__first == __last)
    return __result;
      _ValueType __value = *__first;
      *__result = __value;
      while (++__first != __last)
    {
      _ValueType __tmp = *__first;
      *++__result = __binary_op(__tmp, __value);
      __value = _GLIBCXX_MOVE(__tmp);
    }
      return ++__result;
    }

_GLIBCXX_END_NAMESPACE_ALGO
} 

#include <iostream>
#include <numeric>
#include <vector>
#include <iterator>
#include <algorithm>
using namespace std;

class F
{
    public:
        int operator()(int i,int j)
        {
            return i*j;    
        }    
};
int main()
{
    vector<int> v{1,2,3};
    vector<int> v1(v.size());
    adjacent_difference(v.begin(),v.end(),v1.begin(),F());
    for_each(v1.begin(),v1.end(),[](int i)
    {
        cout<<i<<" ";
    });
    cout<<endl;
    return 0;
}