1<html> 2<head> 3<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> 4<title>adjacent_find</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. Range 2.0"> 8<link rel="up" href="../non_mutating.html" title="Non-mutating algorithms"> 9<link rel="prev" href="../non_mutating.html" title="Non-mutating algorithms"> 10<link rel="next" href="binary_search.html" title="binary_search"> 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="../non_mutating.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><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="binary_search.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> 24</div> 25<div class="section"> 26<div class="titlepage"><div><div><h5 class="title"> 27<a name="range.reference.algorithms.non_mutating.adjacent_find"></a><a class="link" href="adjacent_find.html" title="adjacent_find">adjacent_find</a> 28</h5></div></div></div> 29<h6> 30<a name="range.reference.algorithms.non_mutating.adjacent_find.h0"></a> 31 <span class="phrase"><a name="range.reference.algorithms.non_mutating.adjacent_find.prototype"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.prototype">Prototype</a> 32 </h6> 33<p> 34</p> 35<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">></span> 36<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> 37<span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span> 38 39<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">></span> 40<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> 41<span class="identifier">adjacent_find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span> 42 43<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">></span> 44<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> 45<span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPred</span> <span class="identifier">pred</span><span class="special">);</span> 46 47<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">></span> 48<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> 49<span class="identifier">adjacent_find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPred</span> <span class="identifier">pred</span><span class="special">);</span> 50 51<span class="keyword">template</span><span class="special"><</span><span class="identifier">range_return_value_re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">></span> 52<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">>::</span><span class="identifier">type</span> 53<span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span> 54 55<span class="keyword">template</span><span class="special"><</span><span class="identifier">range_return_value_re</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">></span> 56<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">>::</span><span class="identifier">type</span> 57<span class="identifier">adjacent_find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span> 58 59<span class="keyword">template</span><span class="special"><</span> 60 <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span> 61 <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> 62 <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> 63 <span class="special">></span> 64<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">>::</span><span class="identifier">type</span> 65<span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span> 66 67<span class="keyword">template</span><span class="special"><</span> 68 <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span> 69 <span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> 70 <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> 71 <span class="special">></span> 72<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">re</span><span class="special">>::</span><span class="identifier">type</span> 73<span class="identifier">adjacent_find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span> 74</pre> 75<p> 76 </p> 77<h6> 78<a name="range.reference.algorithms.non_mutating.adjacent_find.h1"></a> 79 <span class="phrase"><a name="range.reference.algorithms.non_mutating.adjacent_find.description"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.description">Description</a> 80 </h6> 81<p> 82 <span class="bold"><strong>Non-predicate versions:</strong></span> 83 </p> 84<p> 85 <code class="computeroutput"><span class="identifier">adjacent_find</span></code> finds the 86 first adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code> 87 in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">x</span> <span class="special">==</span> <span class="identifier">y</span></code> 88 </p> 89<p> 90 <span class="bold"><strong>Predicate versions:</strong></span> 91 </p> 92<p> 93 <code class="computeroutput"><span class="identifier">adjacent_find</span></code> finds the 94 first adjacent elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code> 95 in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code> 96 is <code class="computeroutput"><span class="keyword">true</span></code>. 97 </p> 98<h6> 99<a name="range.reference.algorithms.non_mutating.adjacent_find.h2"></a> 100 <span class="phrase"><a name="range.reference.algorithms.non_mutating.adjacent_find.definition"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.definition">Definition</a> 101 </h6> 102<p> 103 Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">adjacent_find</span><span class="special">.</span><span class="identifier">hpp</span></code> 104 </p> 105<h6> 106<a name="range.reference.algorithms.non_mutating.adjacent_find.h3"></a> 107 <span class="phrase"><a name="range.reference.algorithms.non_mutating.adjacent_find.requirements"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.requirements">Requirements</a> 108 </h6> 109<p> 110 <span class="bold"><strong>For the non-predicate versions of adjacent_find:</strong></span> 111 </p> 112<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> 113<li class="listitem"> 114 <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a 115 model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward 116 Range</a> Concept. 117 </li> 118<li class="listitem"> 119 <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value 120 type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>. 121 </li> 122</ul></div> 123<p> 124 <span class="bold"><strong>For the predicate versions of adjacent_find:</strong></span> 125 </p> 126<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> 127<li class="listitem"> 128 <code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a 129 model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward 130 Range</a> Concept. 131 </li> 132<li class="listitem"> 133 <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is 134 a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>. 135 </li> 136<li class="listitem"> 137 <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value 138 type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s 139 first argument type and to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s 140 second argument type. 141 </li> 142</ul></div> 143<h6> 144<a name="range.reference.algorithms.non_mutating.adjacent_find.h4"></a> 145 <span class="phrase"><a name="range.reference.algorithms.non_mutating.adjacent_find.complexity"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.complexity">Complexity</a> 146 </h6> 147<p> 148 Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> 149 then no comparisons are performed; otherwise, at most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code> 150 comparisons. 151 </p> 152</div> 153<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> 154<td align="left"></td> 155<td align="right"><div class="copyright-footer">Copyright © 2003-2010 Thorsten Ottosen, 156 Neil Groves<p> 157 Distributed under the Boost Software License, Version 1.0. (See accompanying 158 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>) 159 </p> 160</div></td> 161</tr></table> 162<hr> 163<div class="spirit-nav"> 164<a accesskey="p" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><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="binary_search.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> 165</div> 166</body> 167</html> 168
