1<html> 2<head> 3<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> 4<title>find_end</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="find.html" title="find"> 10<link rel="next" href="find_first_of.html" title="find_first_of"> 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="find.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="find_first_of.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.find_end"></a><a class="link" href="find_end.html" title="find_end">find_end</a> 28</h5></div></div></div> 29<h6> 30<a name="range.reference.algorithms.non_mutating.find_end.h0"></a> 31 <span class="phrase"><a name="range.reference.algorithms.non_mutating.find_end.prototype"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.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">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">></span> 36<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange1</span><span class="special">>::</span><span class="identifier">type</span> 37<span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">);</span> 38 39<span class="keyword">template</span><span class="special"><</span> 40 <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> 41 <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span> 42 <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> 43 <span class="special">></span> 44<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange1</span><span class="special">>::</span><span class="identifier">type</span> 45<span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span> 46 47<span class="keyword">template</span><span class="special"><</span> 48 <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span> 49 <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> 50 <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> 51 <span class="special">></span> 52<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special"><</span><span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">>::</span><span class="identifier">type</span> 53<span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">);</span> 54 55<span class="keyword">template</span><span class="special"><</span> 56 <span class="identifier">range_return_value</span> <span class="identifier">re</span><span class="special">,</span> 57 <span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> 58 <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">,</span> 59 <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> 60 <span class="special">></span> 61<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special"><</span><span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="identifier">re</span><span class="special">>::</span><span class="identifier">type</span> 62<span class="identifier">find_end</span><span class="special">(</span><span class="identifier">ForwardRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span> 63</pre> 64<p> 65 </p> 66<h6> 67<a name="range.reference.algorithms.non_mutating.find_end.h1"></a> 68 <span class="phrase"><a name="range.reference.algorithms.non_mutating.find_end.description"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.description">Description</a> 69 </h6> 70<p> 71 The versions of <code class="computeroutput"><span class="identifier">find_end</span></code> 72 that return an iterator, return an iterator to the beginning of the last 73 sub-sequence equal to <code class="computeroutput"><span class="identifier">rng2</span></code> 74 within <code class="computeroutput"><span class="identifier">rng1</span></code>. Equality 75 is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code> for non-predicate versions of <code class="computeroutput"><span class="identifier">find_end</span></code>, and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code> in the predicate versions. The 76 versions of <code class="computeroutput"><span class="identifier">find_end</span></code> 77 that return a <code class="computeroutput"><span class="identifier">range_return</span></code>, 78 defines <code class="computeroutput"><span class="identifier">found</span></code> in the 79 same manner as the returned iterator described above. 80 </p> 81<h6> 82<a name="range.reference.algorithms.non_mutating.find_end.h2"></a> 83 <span class="phrase"><a name="range.reference.algorithms.non_mutating.find_end.definition"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.definition">Definition</a> 84 </h6> 85<p> 86 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">find_end</span><span class="special">.</span><span class="identifier">hpp</span></code> 87 </p> 88<h6> 89<a name="range.reference.algorithms.non_mutating.find_end.h3"></a> 90 <span class="phrase"><a name="range.reference.algorithms.non_mutating.find_end.requirements"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.requirements">Requirements</a> 91 </h6> 92<p> 93 <span class="bold"><strong>For the non-predicate versions:</strong></span> 94 </p> 95<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> 96<li class="listitem"> 97 <code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is 98 a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward 99 Range</a> Concept. 100 </li> 101<li class="listitem"> 102 <code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is 103 a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward 104 Range</a> Concept. 105 </li> 106<li class="listitem"> 107 <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value 108 type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>. 109 </li> 110<li class="listitem"> 111 <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value 112 type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>. 113 </li> 114<li class="listitem"> 115 Objects of <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s 116 value type can be compared for equality with objects of <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value type. 117 </li> 118</ul></div> 119<p> 120 <span class="bold"><strong>For the predicate versions:</strong></span> 121 </p> 122<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> 123<li class="listitem"> 124 <code class="computeroutput"><span class="identifier">ForwardRange1</span></code> is 125 a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward 126 Range</a> Concept. 127 </li> 128<li class="listitem"> 129 <code class="computeroutput"><span class="identifier">ForwardRange2</span></code> is 130 a model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward 131 Range</a> Concept. 132 </li> 133<li class="listitem"> 134 <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is 135 a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>. 136 </li> 137<li class="listitem"> 138 <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>'s value 139 type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s 140 first argument type. 141 </li> 142<li class="listitem"> 143 <code class="computeroutput"><span class="identifier">ForwardRange2</span></code>'s value 144 type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s 145 second argument type. 146 </li> 147</ul></div> 148<h6> 149<a name="range.reference.algorithms.non_mutating.find_end.h4"></a> 150 <span class="phrase"><a name="range.reference.algorithms.non_mutating.find_end.complexity"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.complexity">Complexity</a> 151 </h6> 152<p> 153 The number of comparisons is proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>. If both <code class="computeroutput"><span class="identifier">ForwardRange1</span></code> 154 and <code class="computeroutput"><span class="identifier">ForwardRange2</span></code> are 155 models of <code class="computeroutput"><span class="identifier">BidirectionalRangeConcept</span></code> 156 then the average complexity is linear and the worst case is <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>. 157 </p> 158</div> 159<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> 160<td align="left"></td> 161<td align="right"><div class="copyright-footer">Copyright © 2003-2010 Thorsten Ottosen, 162 Neil Groves<p> 163 Distributed under the Boost Software License, Version 1.0. (See accompanying 164 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>) 165 </p> 166</div></td> 167</tr></table> 168<hr> 169<div class="spirit-nav"> 170<a accesskey="p" href="find.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="find_first_of.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> 171</div> 172</body> 173</html> 174
