Imported Upstream version 1.57.0
[platform/upstream/boost.git] / libs / range / doc / html / range / reference / algorithms / non_mutating / mismatch.html
index cbfad8a..511eb52 100644 (file)
@@ -3,7 +3,7 @@
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
 <title>mismatch</title>
 <link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.78.1">
 <link rel="home" href="../../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
 <link rel="up" href="../non_mutating.html" title="Non-mutating algorithms">
 <link rel="prev" href="min_element.html" title="min_element">
 <div class="titlepage"><div><div><h5 class="title">
 <a name="range.reference.algorithms.non_mutating.mismatch"></a><a class="link" href="mismatch.html" title="mismatch">mismatch</a>
 </h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.mismatch.prototype"></a><h6>
-<a name="id726777"></a>
-            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h0"></a>
+            <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>
           </h6>
 <p>
-            
 </p>
 <pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</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">&gt;</span>
 <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span>
 </pre>
 <p>
           </p>
-<a name="range.reference.algorithms.non_mutating.mismatch.description"></a><h6>
-<a name="id728481"></a>
-            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h1"></a>
+            <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>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">mismatch</span></code> finds the first
-            position where the correseponding elements from the two ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>
+            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>
             are not equal.
           </p>
 <p>
             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.
           </p>
-<a name="range.reference.algorithms.non_mutating.mismatch.definition"></a><h6>
-<a name="id728578"></a>
-            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h2"></a>
+            <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>
           </h6>
 <p>
             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>
           </p>
-<a name="range.reference.algorithms.non_mutating.mismatch.requirements"></a><h6>
-<a name="id728648"></a>
-            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h3"></a>
+            <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>
           </h6>
 <p>
             <span class="bold"><strong>For the non-predicate versions:</strong></span>
           </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
 <li class="listitem">
                 <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
                 is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
 <p>
             <span class="bold"><strong>For the predicate versions:</strong></span>
           </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
 <li class="listitem">
                 <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>
                 is a model of the <a class="link" href="../../../concepts/single_pass_range.html" title="Single Pass Range">Single
                 second argument type.
               </li>
 </ul></div>
-<a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a><h6>
-<a name="id728960"></a>
-            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h4"></a>
+            <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>
           </h6>
 <p>
             <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">&gt;=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
           </p>
-<a name="range.reference.algorithms.non_mutating.mismatch.complexity"></a><h6>
-<a name="id729032"></a>
-            <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h5"></a>
+            <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>
           </h6>
 <p>
             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.
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
 <td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
+<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
+      Neil Groves<p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         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>)
       </p>