3 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
4 <title>find_not</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="The Boost Algorithm Library">
8 <link rel="up" href="../../algorithm/Misc.html" title="Other Algorithms">
9 <link rel="prev" href="../../algorithm/Misc.html" title="Other Algorithms">
10 <link rel="next" href="find_backward.html" title="find_backward">
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>
22 <div class="spirit-nav">
23 <a accesskey="p" href="../../algorithm/Misc.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/Misc.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_backward.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
26 <div class="titlepage"><div><div><h3 class="title">
27 <a name="the_boost_algorithm_library.Misc.find_not"></a><a class="link" href="find_not.html" title="find_not">find_not
29 </h3></div></div></div>
31 The header file 'find_not.hpp' contains a variants of a the stl algorithm
32 <code class="computeroutput"><span class="identifier">find</span></code>. The algorithm finds
33 the first value in the given sequence that is not equal to the given value.
36 Consider this use of <code class="computeroutput"><span class="identifier">find</span><span class="special">()</span></code>:
38 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span> <span class="special">=</span> <span class="special">{</span> <span class="number">1</span><span class="special">,</span> <span class="number">1</span><span class="special">,</span> <span class="number">2</span> <span class="special">};</span>
39 <span class="keyword">auto</span> <span class="identifier">it</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">find</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="number">1</span><span class="special">);</span>
42 This gives us the first occurance of <code class="computeroutput"><span class="number">1</span></code>
43 in <code class="computeroutput"><span class="identifier">vec</span></code>. What if we want to
44 find the first occurrance of any number besides <code class="computeroutput"><span class="number">1</span></code>
45 in <code class="computeroutput"><span class="identifier">vec</span></code>? We have to write
46 an unfortunate amount of code:
48 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span> <span class="special">=</span> <span class="special">{</span> <span class="number">1</span><span class="special">,</span> <span class="number">1</span><span class="special">,</span> <span class="number">2</span> <span class="special">};</span>
49 <span class="keyword">auto</span> <span class="identifier">it</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="special">[](</span><span class="keyword">int</span> <span class="identifier">i</span><span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">i</span> <span class="special">!=</span> <span class="number">1</span><span class="special">;</span> <span class="special">});</span>
52 With <code class="computeroutput"><span class="identifier">find_not</span><span class="special">()</span></code>
53 the code gets much more terse:
55 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span> <span class="special">=</span> <span class="special">{</span> <span class="number">1</span><span class="special">,</span> <span class="number">1</span><span class="special">,</span> <span class="number">2</span> <span class="special">};</span>
56 <span class="keyword">auto</span> <span class="identifier">it</span> <span class="special">=</span> <span class="identifier">find_not</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="number">1</span><span class="special">);</span>
59 The existing <code class="computeroutput"><span class="identifier">find</span></code> variants
60 are: <code class="computeroutput"><span class="identifier">find</span><span class="special">()</span></code>,
61 <code class="computeroutput"><span class="identifier">find_if</span><span class="special">()</span></code>,
62 and <code class="computeroutput"><span class="identifier">find_if_not</span><span class="special">()</span></code>.
63 It seems natural to also have <code class="computeroutput"><span class="identifier">find_not</span><span class="special">()</span></code>, for the very reason that we have <code class="computeroutput"><span class="identifier">find_if_not</span><span class="special">()</span></code>
64 -- to avoid having to write a lambda to wrap the negation of the find condition.
67 <a name="the_boost_algorithm_library.Misc.find_not.h0"></a>
68 <span class="phrase"><a name="the_boost_algorithm_library.Misc.find_not.interface"></a></span><a class="link" href="find_not.html#the_boost_algorithm_library.Misc.find_not.interface">interface</a>
70 <pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIter</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Sentinel</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
71 <span class="identifier">InputIter</span> <span class="identifier">find_not</span><span class="special">(</span><span class="identifier">InputIter</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Sentinel</span> <span class="identifier">last</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
73 <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
74 <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">Range</span><span class="special">></span> <span class="identifier">find_not</span><span class="special">(</span><span class="identifier">Range</span> <span class="special">&</span> <span class="identifier">r</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
77 These overloads of <code class="computeroutput"><span class="identifier">find_not</span></code>
78 return the first value that is not equal to <code class="computeroutput"><span class="identifier">x</span></code>
79 in the sequence <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span> <span class="identifier">last</span><span class="special">)</span></code> or <code class="computeroutput"><span class="identifier">r</span></code>,
83 <a name="the_boost_algorithm_library.Misc.find_not.h1"></a>
84 <span class="phrase"><a name="the_boost_algorithm_library.Misc.find_not.examples"></a></span><a class="link" href="find_not.html#the_boost_algorithm_library.Misc.find_not.examples">Examples</a>
87 Given the container <code class="computeroutput"><span class="identifier">c1</span></code> containing
88 <code class="computeroutput"><span class="special">{</span> <span class="number">0</span><span class="special">,</span> <span class="number">1</span><span class="special">,</span>
89 <span class="number">2</span> <span class="special">}</span></code>,
92 <pre class="programlisting"><span class="identifier">find_not</span> <span class="special">(</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="number">1</span> <span class="special">)</span> <span class="special">--></span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span>
93 <span class="identifier">find_not</span> <span class="special">(</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="number">0</span> <span class="special">)</span> <span class="special">--></span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">next</span><span class="special">(</span><span class="identifier">c1</span><span class="special">.</span><span class="identifier">begin</span><span class="special">())</span>
96 <a name="the_boost_algorithm_library.Misc.find_not.h2"></a>
97 <span class="phrase"><a name="the_boost_algorithm_library.Misc.find_not.iterator_requirements"></a></span><a class="link" href="find_not.html#the_boost_algorithm_library.Misc.find_not.iterator_requirements">Iterator
101 <code class="computeroutput"><span class="identifier">find_not</span></code> works on all iterators
102 except output iterators.
105 The template parameter <code class="computeroutput"><span class="identifier">Sentinel</span></code>
106 is allowed to be different from <code class="computeroutput"><span class="identifier">InputIter</span></code>,
107 or they may be the same. For an <code class="computeroutput"><span class="identifier">InputIter</span></code>
108 <code class="computeroutput"><span class="identifier">it</span></code> and a <code class="computeroutput"><span class="identifier">Sentinel</span></code>
109 <code class="computeroutput"><span class="identifier">end</span></code>, <code class="computeroutput"><span class="identifier">it</span>
110 <span class="special">==</span> <span class="identifier">end</span></code>
111 and <code class="computeroutput"><span class="identifier">it</span> <span class="special">!=</span>
112 <span class="identifier">end</span></code> must be well-formed expressions.
115 <a name="the_boost_algorithm_library.Misc.find_not.h3"></a>
116 <span class="phrase"><a name="the_boost_algorithm_library.Misc.find_not.complexity"></a></span><a class="link" href="find_not.html#the_boost_algorithm_library.Misc.find_not.complexity">Complexity</a>
122 <a name="the_boost_algorithm_library.Misc.find_not.h4"></a>
123 <span class="phrase"><a name="the_boost_algorithm_library.Misc.find_not.exception_safety"></a></span><a class="link" href="find_not.html#the_boost_algorithm_library.Misc.find_not.exception_safety">Exception
127 <code class="computeroutput"><span class="identifier">find_not</span></code> takes its parameters
128 by value and do not depend upon any global state. Therefore, it provides
129 the strong exception guarantee.
132 <a name="the_boost_algorithm_library.Misc.find_not.h5"></a>
133 <span class="phrase"><a name="the_boost_algorithm_library.Misc.find_not.notes"></a></span><a class="link" href="find_not.html#the_boost_algorithm_library.Misc.find_not.notes">Notes</a>
136 <code class="computeroutput"><span class="keyword">constexpr</span></code> in C++14 or later.
139 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
140 <td align="left"></td>
141 <td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p>
142 Distributed under the Boost Software License, Version 1.0. (See accompanying
143 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>)
148 <div class="spirit-nav">
149 <a accesskey="p" href="../../algorithm/Misc.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/Misc.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_backward.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>