1<html> 2<head> 3<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> 4<title>mismatch</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="min_element.html" title="min_element"> 10<link rel="next" href="search.html" title="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="min_element.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="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.mismatch"></a><a class="link" href="mismatch.html" title="mismatch">mismatch</a> 28</h5></div></div></div> 29<h6> 30<a name="range.reference.algorithms.non_mutating.mismatch.h0"></a> 31 <span class="phrase"><a name="range.reference.algorithms.non_mutating.mismatch.prototype"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.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">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">></span> 36<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> 37 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span> 38 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span> 39<span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">);</span> 40 41<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">></span> 42<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> 43 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span> 44 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span> 45<span class="identifier">mismatch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">);</span> 46 47<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">></span> 48<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> 49 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span> 50 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span> 51<span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">);</span> 52 53<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">></span> 54<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> 55 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span> 56 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span> 57<span class="identifier">mismatch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">);</span> 58 59 60<span class="keyword">template</span><span class="special"><</span> 61 <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> 62 <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span> 63 <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> 64 <span class="special">></span> 65<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> 66 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span> 67 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span> 68<span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">,</span> 69 <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span> 70 71<span class="keyword">template</span><span class="special"><</span> 72 <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> 73 <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span> 74 <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> 75 <span class="special">></span> 76<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> 77 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span> 78 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span> 79<span class="identifier">mismatch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">,</span> 80 <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span> 81 82<span class="keyword">template</span><span class="special"><</span> 83 <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> 84 <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span> 85 <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> 86 <span class="special">></span> 87<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> 88 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span> 89 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span> 90<span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">,</span> 91 <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span> 92 93<span class="keyword">template</span><span class="special"><</span> 94 <span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> 95 <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span> 96 <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> 97 <span class="special">></span> 98<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> 99 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span> 100 <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span> 101<span class="identifier">mismatch</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">,</span> 102 <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span> 103</pre> 104<p> 105 </p> 106<h6> 107<a name="range.reference.algorithms.non_mutating.mismatch.h1"></a> 108 <span class="phrase"><a name="range.reference.algorithms.non_mutating.mismatch.description"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a> 109 </h6> 110<p> 111 <code class="computeroutput"><span class="identifier">mismatch</span></code> finds the first 112 position where the corresponding elements from the two ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> 113 are not equal. 114 </p> 115<p> 116 Equality 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">mismatch</span></code>, and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code> in the predicate versions. 117 </p> 118<h6> 119<a name="range.reference.algorithms.non_mutating.mismatch.h2"></a> 120 <span class="phrase"><a name="range.reference.algorithms.non_mutating.mismatch.definition"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.definition">Definition</a> 121 </h6> 122<p> 123 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">mismatch</span><span class="special">.</span><span class="identifier">hpp</span></code> 124 </p> 125<h6> 126<a name="range.reference.algorithms.non_mutating.mismatch.h3"></a> 127 <span class="phrase"><a name="range.reference.algorithms.non_mutating.mismatch.requirements"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a> 128 </h6> 129<p> 130 <span class="bold"><strong>For the non-predicate versions:</strong></span> 131 </p> 132<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> 133<li class="listitem"> 134 <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> 135 is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single 136 Pass Range</a> Concept. 137 </li> 138<li class="listitem"> 139 <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> 140 is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single 141 Pass Range</a> Concept. 142 </li> 143<li class="listitem"> 144 <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s 145 value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>. 146 </li> 147<li class="listitem"> 148 <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s 149 value type is a model of the <code class="computeroutput"><span class="identifier">EqualityComparableConcept</span></code>. 150 </li> 151<li class="listitem"> 152 <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>s 153 value type can be compared for equality with <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s 154 value type. 155 </li> 156</ul></div> 157<p> 158 <span class="bold"><strong>For the predicate versions:</strong></span> 159 </p> 160<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> 161<li class="listitem"> 162 <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code> 163 is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single 164 Pass Range</a> Concept. 165 </li> 166<li class="listitem"> 167 <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code> 168 is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single 169 Pass Range</a> Concept. 170 </li> 171<li class="listitem"> 172 <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code> is 173 a model of the <code class="computeroutput"><span class="identifier">BinaryPredicateConcept</span></code>. 174 </li> 175<li class="listitem"> 176 <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s 177 value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s 178 first argument type. 179 </li> 180<li class="listitem"> 181 <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s 182 value type is convertible to <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s 183 second argument type. 184 </li> 185</ul></div> 186<h6> 187<a name="range.reference.algorithms.non_mutating.mismatch.h4"></a> 188 <span class="phrase"><a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.precondition_">Precondition:</a> 189 </h6> 190<p> 191 <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">>=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> 192 </p> 193<h6> 194<a name="range.reference.algorithms.non_mutating.mismatch.h5"></a> 195 <span class="phrase"><a name="range.reference.algorithms.non_mutating.mismatch.complexity"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a> 196 </h6> 197<p> 198 Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> comparisons. 199 </p> 200</div> 201<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> 202<td align="left"></td> 203<td align="right"><div class="copyright-footer">Copyright © 2003-2010 Thorsten Ottosen, 204 Neil Groves<p> 205 Distributed under the Boost Software License, Version 1.0. (See accompanying 206 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>) 207 </p> 208</div></td> 209</tr></table> 210<hr> 211<div class="spirit-nav"> 212<a accesskey="p" href="min_element.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="search.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> 213</div> 214</body> 215</html> 216
