| <!-- |
| Licensed to the Apache Software Foundation (ASF) under one or more |
| contributor license agreements. See the NOTICE file distributed |
| with this work for additional information regarding copyright |
| ownership. The ASF licenses this file to you under the Apache |
| License, Version 2.0 (the License); you may not use this file |
| except in compliance with the License. You may obtain a copy of |
| the License at |
| |
| http://www.apache.org/licenses/LICENSE-2.0 |
| |
| Unless required by applicable law or agreed to in writing, software |
| distributed under the License is distributed on an "AS IS" BASIS, |
| WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or |
| implied. See the License for the specific language governing |
| permissions and limitations under the License. |
| |
| Copyright 1999-2007 Rogue Wave Software, Inc. |
| --> |
| |
| <HTML> |
| <HEAD> |
| <TITLE>find_end()</TITLE> |
| <LINK REL=StyleSheet HREF="../rw.css" TYPE="text/css" TITLE="Apache stdcxx Stylesheet"></HEAD> |
| <BODY BGCOLOR=#FFFFFF> |
| <A HREF="find.html"><IMG SRC="images/bprev.gif" WIDTH=20 HEIGHT=21 ALT="Previous file" BORDER=O></A><A HREF="noframes.html"><IMG SRC="images/btop.gif" WIDTH=56 HEIGHT=21 ALT="Top of Document" BORDER=O></A><A HREF="booktoc.html"><IMG SRC="images/btoc.gif" WIDTH=56 HEIGHT=21 ALT="Contents" BORDER=O></A><A HREF="tindex.html"><IMG SRC="images/bindex.gif" WIDTH=56 HEIGHT=21 ALT="Index page" BORDER=O></A><A HREF="find-first-of.html"><IMG SRC="images/bnext.gif" WIDTH=25 HEIGHT=21 ALT="Next file" BORDER=O></A><DIV CLASS="DOCUMENTNAME"><B>Apache C++ Standard Library Reference Guide</B></DIV> |
| <H2>find_end()</H2> |
| <P><B>Library:</B> <A HREF="2-9.html">Algorithms</A></P> |
| |
| <PRE><HR><B><I>Function</I></B><HR></PRE> |
| |
| <UL> |
| <LI><A HREF="#sec1">Local Index</A></LI> |
| <LI><A HREF="#sec2">Summary</A></LI> |
| <LI><A HREF="#sec3">Synopsis</A></LI> |
| <LI><A HREF="#sec4">Description</A></LI> |
| <LI><A HREF="#sec5">Complexity</A></LI> |
| <LI><A HREF="#sec6">Example</A></LI> |
| <LI><A HREF="#sec7">See Also</A></LI> |
| <LI><A HREF="#sec8">Standards Conformance</A></LI> |
| </UL> |
| <A NAME="sec1"><H3>Local Index</H3></A> |
| No Entries |
| <A NAME="sec2"><H3>Summary</H3></A> |
| <P>Algorithm that finds the last occurrence of a sub-sequence in a sequence</P> |
| <A NAME="sec3"><H3>Synopsis</H3></A> |
| |
| <PRE>#include <algorithm> |
| |
| namespace std { |
| template <class ForwardIterator1, class ForwardIterator2> |
| ForwardIterator1 find_end(ForwardIterator1 start1, |
| ForwardIterator1 finish1, |
| ForwardIterator2 start2, |
| ForwardIterator2 finish2); |
| template <class Forward Iterator1, class ForwardIterator2, |
| class BinaryPredicate> |
| ForwardIterator1 find_end(ForwardIterator1 start1, |
| ForwardIterator1 finish1, |
| ForwardIterator2 start2, |
| ForwardIterator2 finish2, |
| BinaryPredicate binary_pred); |
| } |
| </PRE> |
| <A NAME="sec4"><H3>Description</H3></A> |
| <P>The <SAMP>find_end()</SAMP> algorithm finds the last occurrence of a sub-sequence, indicated by <SAMP>[start2, finish2)</SAMP>, in a sequence, <SAMP>[start1,finish1)</SAMP>. The algorithm returns an iterator pointing to the first element of the found sub-sequence, or <SAMP>finish1</SAMP> if no match is found.</P> |
| <P>More precisely, the <SAMP>find_end()</SAMP> algorithm returns the last iterator <SAMP>i</SAMP> in the range <SAMP>[start1, finish1 - (finish2-start2))</SAMP> such that for any non-negative integer <SAMP>n < (finish2-start2)</SAMP>, the following corresponding conditions hold: </P> |
| |
| <UL><PRE>*(i+n) == *(start2+n), |
| binary_pred(*(i+n),*(start2+n)) == true. |
| </PRE></UL> |
| <P>Or returns <SAMP>finish1</SAMP> if no such iterator is found.</P> |
| <P>Two versions of the algorithm exist. The first uses the equality operator as the default binary predicate, and the second allows you to specify a binary predicate.</P> |
| <A NAME="sec5"><H3>Complexity</H3></A> |
| <P>At most <SAMP>(finish2-start2)*(finish1-start1-(finish2-start2)+1)</SAMP> applications of the corresponding predicate are done.</P> |
| <A NAME="sec6"><H3>Example</H3></A> |
| |
| <UL><PRE>// |
| // find_end.cpp |
| // |
| |
| #include <algorithm> // for find_first_of, find_end |
| #include <functional> // for equal_to |
| #include <iostream> // for cout, endl |
| #include <list> // for list |
| |
| |
| int main () |
| { |
| typedef std::list<int, std::allocator<int> > list; |
| |
| const list::value_type a1[] = { |
| 0, 1, 6, 5, 3, 2, 2, 6, 5, 7 |
| }; |
| const list::value_type a2[] = { |
| 6, 5, 0, 0 |
| }; |
| |
| // Set up two sequences. |
| const list l1 (a1, a1 + sizeof a1 / sizeof *a1); |
| const list l2 (a2, a2 + 2); |
| |
| // Try both find_first_of variants. |
| list::const_iterator it1 = |
| std::find_first_of(l1.begin(), l1.end(), |
| l2.begin(), l2.end()); |
| |
| list::const_iterator it2 = |
| std::find_first_of(l1.begin(), l1.end(), |
| l2.begin(), l2.end(), |
| std::equal_to<list::value_type>()); |
| |
| // Try both find_end variants. |
| list::const_iterator it3 = |
| std::find_end(l1.begin(), l1.end(), |
| l2.begin(), l2.end()); |
| |
| list::const_iterator it4 = |
| std::find_end(l1.begin(), l1.end(), |
| l2.begin(), l2.end(), |
| std::equal_to<list::value_type>()); |
| |
| // Output results of find_first_of. |
| // Iterator now points to the first element that matches |
| // one of a set of values. |
| |
| std::ostream_iterator<list::value_type, char, |
| std::char_traits<char> > out(std::cout, " " ); |
| |
| if(it3 == it4 && it1 == it2) { |
| |
| std::cout << "For the sequences { "; |
| std::copy(l1.begin(), l1.end(), out); |
| |
| std::cout << "} and { "; |
| std::copy(l2.begin(), l2.end(), out); |
| |
| std::cout << "} \nboth versions of " |
| << "find_first_of point to: " |
| << *it1 << std::endl; |
| |
| // Output results of find_end. |
| // Iterator now points to the first element of the last |
| // find subsequence. |
| |
| std::cout << "both versions of find_end point to: " |
| << *it3 << std::endl; |
| } |
| |
| return 0; |
| } |
| |
| |
| Program Output: |
| </PRE></UL> |
| <UL><PRE>For the sequences { 0 1 6 5 3 2 2 6 5 7 } and { 6 5 } |
| both versions of find_first_of point to: 6 |
| both versions of find_end point to: 6 |
| </PRE></UL> |
| <A NAME="sec7"><H3>See Also</H3></A> |
| <P><A HREF="algorithms.html">Algorithms</A>, <SAMP><A HREF="find.html">find()</A></SAMP>, <SAMP><A HREF="find-if.html">find_if()</A></SAMP>, <SAMP><A HREF="adjacent-find.html">adjacent_find()</A></SAMP></P> |
| <A NAME="sec8"><H3>Standards Conformance</H3></A> |
| <P><I>ISO/IEC 14882:1998 -- International Standard for Information Systems -- Programming Language C++, Section 25.1.3</I></P> |
| |
| <BR> |
| <HR> |
| <A HREF="find.html"><IMG SRC="images/bprev.gif" WIDTH=20 HEIGHT=21 ALT="Previous file" BORDER=O></A><A HREF="noframes.html"><IMG SRC="images/btop.gif" WIDTH=56 HEIGHT=21 ALT="Top of Document" BORDER=O></A><A HREF="booktoc.html"><IMG SRC="images/btoc.gif" WIDTH=56 HEIGHT=21 ALT="Contents" BORDER=O></A><A HREF="tindex.html"><IMG SRC="images/bindex.gif" WIDTH=56 HEIGHT=21 ALT="Index page" BORDER=O></A><A HREF="find-first-of.html"><IMG SRC="images/bnext.gif" WIDTH=20 HEIGHT=21 ALT="Next file" BORDER=O></A> |
| |
| <!-- Google Analytics tracking code --> |
| <script src="http://www.google-analytics.com/urchin.js" type="text/javascript"> |
| </script> |
| <script type="text/javascript"> |
| _uacct = "UA-1775151-1"; |
| urchinTracker(); |
| </script> |
| <!-- end of Google Analytics tracking code --> |
| |
| </BODY> |
| </HTML> |
