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

The search( ) algorithm searches for a subsequence within a sequence. The sequence being searched is defined by start1 and end1. The subsequence being sought is specified by start2 and end2. If the subsequence is found, an iterator to its beginning is returned. Otherwise, end1 is returned.

The second form allows you to specify a binary predicate that determines when one element is equal to another.

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: