<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en"
lang="en" dir="ltr">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>
mismatch [C++ Reference]
</title>
<meta name="generator" content="DokuWiki Release 2009-12-25c "Lemming"" />
<meta name="robots" content="index,follow" />
<meta name="date" content="2009-10-09T01:00:54-0700" />
<meta name="keywords" content="stl,algorithm,mismatch" />
<link rel="search" type="application/opensearchdescription+xml" href="/wiki/lib/exe/opensearch.php" title="C++ Reference" />
<link rel="start" href="/wiki/" />
<link rel="contents" href="/wiki/stl/algorithm/mismatch?do=index" title="Index" />
<link rel="alternate" type="application/rss+xml" title="Recent Changes" href="/wiki/feed.php" />
<link rel="alternate" type="application/rss+xml" title="Current Namespace" href="/wiki/feed.php?mode=list&ns=stl:algorithm" />
<link rel="edit" title="Edit this page" href="/wiki/stl/algorithm/mismatch?do=edit" />
<link rel="alternate" type="text/html" title="Plain HTML" href="/wiki/_export/xhtml/stl/algorithm/mismatch" />
<link rel="alternate" type="text/plain" title="Wiki Markup" href="/wiki/_export/raw/stl/algorithm/mismatch" />
<link rel="canonical" href="http://www.cppreference.com/wiki/stl/algorithm/mismatch" />
<link rel="stylesheet" media="all" type="text/css" href="/wiki/lib/exe/css.php?s=all&t=custom1&tseed=1272971091" />
<link rel="stylesheet" media="screen" type="text/css" href="/wiki/lib/exe/css.php?t=custom1&tseed=1272971091" />
<link rel="stylesheet" media="print" type="text/css" href="/wiki/lib/exe/css.php?s=print&t=custom1&tseed=1272971091" />
<script type="text/javascript" charset="utf-8" ><!--//--><![CDATA[//><!--
var NS='stl:algorithm';var JSINFO = {"id":"stl:algorithm:mismatch","namespace":"stl:algorithm"};
//--><!]]></script>
<script type="text/javascript" charset="utf-8" src="/wiki/lib/exe/js.php?tseed=1272971091" ></script>
<link rel="shortcut icon" href="/wiki/lib/tpl/custom1/images/favicon.png" />
</head>
<body>
<div class="dokuwiki">
<div class="stylehead">
<div class="breadcrumbs">
<span class="bchead">You are here: </span><a href="../../start.html" title="start">C++ Reference</a> » <a href="../../stl/start.html" title="stl:start">C++ Standard Template Library</a> » <a href="../../stl/algorithm/start.html" title="stl:algorithm:start">C++ Algorithms</a> » <a href="../../stl/algorithm/mismatch.html" title="stl:algorithm:mismatch">mismatch</a> </div>
</div>
<div class="page">
<script src="http://www.google-analytics.com/urchin.js" type="text/javascript">
</script>
<script type="text/javascript">
_uacct = "UA-2828341-1";
urchinTracker();
</script>
<!-- wikipage start -->
<h2><a name="mismatch" id="mismatch">mismatch</a></h2>
<div class="level2">
<p>
Syntax:
</p>
<pre class="c code c++" style="font-family:monospace;"> <span class="co2">#include <algorithm></span>
pair <span class="sy0"><</span>input_iterator1<span class="sy0">,</span>input_iterator2<span class="sy0">></span> mismatch<span class="br0">(</span> input_iterator1 start1<span class="sy0">,</span> input_iterator1 end1<span class="sy0">,</span> input_iterator2 start2 <span class="br0">)</span><span class="sy0">;</span>
pair <span class="sy0"><</span>input_iterator1<span class="sy0">,</span>input_iterator2<span class="sy0">></span> mismatch<span class="br0">(</span> input_iterator1 start1<span class="sy0">,</span> input_iterator1 end1<span class="sy0">,</span> input_iterator2 start2<span class="sy0">,</span> BinPred p <span class="br0">)</span><span class="sy0">;</span></pre>
<p>
The mismatch() function compares the elements in the range defined by
[start1,end1) to the elements in a range of the same size starting at start2.
</p>
<p>
The return value of <code>mismatch()</code> is either:
</p>
<ul>
<li class="level1"><div class="li"> The first location where the two ranges differ.</div>
</li>
<li class="level1"><div class="li"> If the ranges are equal, <code>end1</code> and the corresponding element in second range.</div>
</li>
</ul>
<p>
If the optional binary predicate <code>p</code> is given, then it is used to compare
elements from the two ranges.
</p>
<p>
The <code>mismatch()</code> algorithm runs in <a href="../../complexity.html" class="wikilink1" title="complexity">linear time</a>.
</p>
<p>
Related Topics: <a href="../../stl/algorithm/equal.html" class="wikilink1" title="stl:algorithm:equal">equal</a>, <a href="../../stl/algorithm/find.html" class="wikilink1" title="stl:algorithm:find">find</a>, <a href="../../stl/algorithm/lexicographical_compare.html" class="wikilink1" title="stl:algorithm:lexicographical_compare">lexicographical_compare</a>, <a href="../../stl/algorithm/search.html" class="wikilink1" title="stl:algorithm:search">search</a>
</p>
</div>
<!-- wikipage stop -->
</div>
<div class="clearer"> </div>
<div class="stylefoot">
<div class="meta">
<div class="user">
</div>
<!--
<div class="doc">
stl/algorithm/mismatch.txt · Last modified: 10/09/2009 01:00 by 124.255.102.233 </div>
-->
</div>
</div></div></body>
</html>