<!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>
includes [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-10T10:52:31-0700" />
<meta name="keywords" content="stl,algorithm,includes" />
<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/includes?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/includes?do=edit" />
<link rel="alternate" type="text/html" title="Plain HTML" href="/wiki/_export/xhtml/stl/algorithm/includes" />
<link rel="alternate" type="text/plain" title="Wiki Markup" href="/wiki/_export/raw/stl/algorithm/includes" />
<link rel="canonical" href="http://www.cppreference.com/wiki/stl/algorithm/includes" />
<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:includes","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/includes.html" title="stl:algorithm:includes">includes</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="includes" id="includes">includes</a></h2>
<div class="level2">
<p>
Syntax:
</p>
<pre class="c code c++" style="font-family:monospace;"> <span class="co2">#include <algorithm></span>
template<span class="sy0"><</span> typename InIterA<span class="sy0">,</span> typename InIterB <span class="sy0">></span>
bool includes<span class="br0">(</span> InIterA start1<span class="sy0">,</span> InIterA end1<span class="sy0">,</span> InIterB start2<span class="sy0">,</span> InIterB end2 <span class="br0">)</span><span class="sy0">;</span>
template<span class="sy0"><</span> typename InIterA<span class="sy0">,</span> typename InIterB<span class="sy0">,</span> typename StrictWeakOrdering <span class="sy0">></span>
bool includes<span class="br0">(</span> InIterA start1<span class="sy0">,</span> InIterA end1<span class="sy0">,</span> InIterB start2<span class="sy0">,</span> InIterB end2<span class="sy0">,</span> StrictWeakOrdering cmp <span class="br0">)</span><span class="sy0">;</span></pre>
<p>
The includes() algorithm returns <code>true</code> if every element in [start2,end2) is also
in [start1,end1). Both of the given ranges must be sorted in ascending order. There is no requirement that every element in [start1,end1) or [start2,end2) be unique. If some element appears <em>n</em> times in [start2,end2), [start1,end1) must contain the equivalent element at least <em>n</em> times.
</p>
<p>
By default, the < operator is used to compare elements. If the strict weak
ordering function object cmp is given, then it is used instead.
</p>
<p>
includes() runs in <a href="../../complexity.html" class="wikilink1" title="complexity">linear time</a>.
</p>
<pre class="c code c++" style="font-family:monospace;"> <span class="co2">#include <iostream></span>
<span class="co2">#include <vector></span>
<span class="co2">#include <list></span>
<span class="co2">#include <algorithm></span>
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
<span class="br0">{</span>
std<span class="sy0">::</span><span class="me2">vector</span><span class="sy0"><</span>int<span class="sy0">></span> vec<span class="sy0">;</span>
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">int</span> i <span class="sy0">=</span> <span class="nu0">0</span><span class="sy0">;</span> i <span class="sy0"><</span> <span class="nu0">10</span><span class="sy0">;</span> <span class="sy0">++</span>i<span class="br0">)</span>
vec.<span class="me1">push_back</span><span class="br0">(</span>i<span class="br0">)</span><span class="sy0">;</span>
std<span class="sy0">::</span><span class="me2">list</span><span class="sy0"><</span>int<span class="sy0">></span> lst<span class="sy0">;</span>
lst.<span class="me1">push_back</span><span class="br0">(</span>2<span class="br0">)</span><span class="sy0">;</span>
lst.<span class="me1">push_back</span><span class="br0">(</span>4<span class="br0">)</span><span class="sy0">;</span>
lst.<span class="me1">push_back</span><span class="br0">(</span>6<span class="br0">)</span><span class="sy0">;</span>
<span class="kw1">if</span> <span class="br0">(</span>std<span class="sy0">::</span><span class="me2">includes</span><span class="br0">(</span>vec.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="sy0">,</span> vec.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="sy0">,</span> lst.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="sy0">,</span> lst.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="br0">)</span>
std<span class="sy0">::</span><a href="http://www.opengroup.org/onlinepubs/009695399/functions/cout.html"><span class="kw3">cout</span></a> <span class="sy0"><<</span> <span class="st0">"lst is a subset of vec."</span> <span class="sy0"><<</span> std<span class="sy0">::</span><span class="me2">endl</span><span class="sy0">;</span>
<span class="kw1">else</span>
std<span class="sy0">::</span><a href="http://www.opengroup.org/onlinepubs/009695399/functions/cout.html"><span class="kw3">cout</span></a> <span class="sy0"><<</span> <span class="st0">"lst is NOT a subset of vec."</span> <span class="sy0"><<</span> std<span class="sy0">::</span><span class="me2">endl</span><span class="sy0">;</span>
<span class="kw1">return</span> <span class="nu0">0</span><span class="sy0">;</span>
<span class="br0">}</span></pre>
<p>
Related Topics: <a href="../../stl/algorithm/set_difference.html" class="wikilink1" title="stl:algorithm:set_difference">set_difference</a>, <a href="../../stl/algorithm/set_intersection.html" class="wikilink1" title="stl:algorithm:set_intersection">set_intersection</a>, <a href="../../stl/algorithm/set_symmetric_difference.html" class="wikilink1" title="stl:algorithm:set_symmetric_difference">set_symmetric_difference</a>, <a href="../../stl/algorithm/set_union.html" class="wikilink1" title="stl:algorithm:set_union">set_union</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/includes.txt · Last modified: 10/10/2009 10:52 by 124.255.102.233 </div>
-->
</div>
</div></div></body>
</html>