1<html> 2<head> 3<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> 4<title>Function adjacent_difference</title> 5<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> 6<meta name="generator" content="DocBook XSL Stylesheets V1.79.1"> 7<link rel="home" href="../../index.html" title="Chapter 1. Boost.Compute"> 8<link rel="up" href="../../boost_compute/reference.html#header.boost.compute.algorithm.adjacent_difference_hpp" title="Header <boost/compute/algorithm/adjacent_difference.hpp>"> 9<link rel="prev" href="accumulate.html" title="Function accumulate"> 10<link rel="next" href="adjacent_find.html" title="Function adjacent_find"> 11</head> 12<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> 13<table cellpadding="2" width="100%"><tr> 14<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> 15<td align="center"><a href="../../../../../../index.html">Home</a></td> 16<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> 17<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> 18<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> 19<td align="center"><a href="../../../../../../more/index.htm">More</a></td> 20</tr></table> 21<hr> 22<div class="spirit-nav"> 23<a accesskey="p" href="accumulate.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_compute/reference.html#header.boost.compute.algorithm.adjacent_difference_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="adjacent_find.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> 24</div> 25<div class="refentry"> 26<a name="boost.compute.adjacent_difference"></a><div class="titlepage"></div> 27<div class="refnamediv"> 28<h2><span class="refentrytitle">Function adjacent_difference</span></h2> 29<p>boost::compute::adjacent_difference</p> 30</div> 31<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> 32<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../boost_compute/reference.html#header.boost.compute.algorithm.adjacent_difference_hpp" title="Header <boost/compute/algorithm/adjacent_difference.hpp>">boost/compute/algorithm/adjacent_difference.hpp</a>> 33 34</span> 35<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">,</span> 36 <span class="keyword">typename</span> BinaryFunction<span class="special">></span> 37 <span class="identifier">OutputIterator</span> 38 <span class="identifier">adjacent_difference</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span> 39 <span class="identifier">OutputIterator</span> result<span class="special">,</span> <span class="identifier">BinaryFunction</span> op<span class="special">,</span> 40 <span class="identifier">command_queue</span> <span class="special">&</span> queue <span class="special">=</span> <span class="identifier">system</span><span class="special">::</span><span class="identifier">default_queue</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span> 41<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> 42 <span class="identifier">OutputIterator</span> 43 <span class="identifier">adjacent_difference</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span> 44 <span class="identifier">OutputIterator</span> result<span class="special">,</span> 45 <span class="identifier">command_queue</span> <span class="special">&</span> queue <span class="special">=</span> <span class="identifier">system</span><span class="special">::</span><span class="identifier">default_queue</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre></div> 46<div class="refsect1"> 47<a name="idm45849523343152"></a><h2>Description</h2> 48<p>Stores the difference of each pair of consecutive values in the range [<code class="computeroutput">first</code>, <code class="computeroutput">last</code>) to the range beginning at <code class="computeroutput">result</code>. If <code class="computeroutput">op</code> is not provided, <code class="computeroutput">minus<T></code> is used.</p> 49<p> 50 51Space complexity: \Omega(1)<br> 52 Space complexity when <code class="computeroutput">result</code> == <code class="computeroutput">first:</code> \Omega(n)</p> 53<p><span class="bold"><strong>See Also:</strong></span></p> 54<p>adjacent_find() </p> 55<p> 56</p> 57<p> 58</p> 59<div class="variablelist"><table border="0" class="variablelist compact"> 60<colgroup> 61<col align="left" valign="top"> 62<col> 63</colgroup> 64<tbody> 65<tr> 66<td><p><span class="term">Parameters:</span></p></td> 67<td><div class="variablelist"><table border="0" class="variablelist compact"> 68<colgroup> 69<col align="left" valign="top"> 70<col> 71</colgroup> 72<tbody> 73<tr> 74<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> 75<td><p>first element in the input range </p></td> 76</tr> 77<tr> 78<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> 79<td><p>last element in the input range </p></td> 80</tr> 81<tr> 82<td><p><span class="term"><code class="computeroutput">op</code></span></p></td> 83<td><p>binary difference function </p></td> 84</tr> 85<tr> 86<td><p><span class="term"><code class="computeroutput">queue</code></span></p></td> 87<td><p>command queue to perform the operation</p></td> 88</tr> 89<tr> 90<td><p><span class="term"><code class="computeroutput">result</code></span></p></td> 91<td><p>first element in the output range </p></td> 92</tr> 93</tbody> 94</table></div></td> 95</tr> 96<tr> 97<td><p><span class="term">Returns:</span></p></td> 98<td><p><code class="computeroutput">OutputIterator</code> to the end of the result range</p></td> 99</tr> 100</tbody> 101</table></div> 102</div> 103</div> 104<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> 105<td align="left"></td> 106<td align="right"><div class="copyright-footer">Copyright © 2013, 2014 Kyle Lutz<p> 107 Distributed under the Boost Software License, Version 1.0. (See accompanying 108 file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) 109 </p> 110</div></td> 111</tr></table> 112<hr> 113<div class="spirit-nav"> 114<a accesskey="p" href="accumulate.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_compute/reference.html#header.boost.compute.algorithm.adjacent_difference_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="adjacent_find.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> 115</div> 116</body> 117</html> 118
