template <class ForIter1, class ForIter2>    ForIter1 find_end(ForIter1 start1, ForIter1 end1,                      ForIter2 start2, ForIter2 end2); template <class ForIter1, class ForIter2, class BinPred>     ForIter1 find_end(ForIter1 start1, ForIter1 end1,                       ForIter2 start2, ForIter2 end2,                       BinPred pfn); 

The find_end( ) algorithm finds the last iterator of the subsequence defined by start2 and end2 within the range start1 and end1. If the sequence is found, an iterator to the last element in the sequence is returned. Otherwise, the iterator end1 is returned.

The second form allows you to specify a binary predicate that determines when elements match.

C(s)C++ Programmer's Reference
C Programming on the IBM PC (C Programmers Reference Guide Series)
ISBN: 0673462897
EAN: 2147483647
Year: 2002
Pages: 539 © 2008-2017.
If you may any questions please contact us: