mirror of
https://gitlab.com/fbb-git/cppannotations
synced 2024-11-18 10:06:54 +01:00
79023426de
git-svn-id: https://cppannotations.svn.sourceforge.net/svnroot/cppannotations/trunk@112 f6dd340e-d3f9-0310-b409-bdd246841980
27 lines
1.1 KiB
Text
27 lines
1.1 KiB
Text
hi(search_n())
|
|
itemization(
|
|
it() Header file:
|
|
centt(#include <algorithm>)
|
|
it() Function prototypes:
|
|
itemization(
|
|
itt(ForwardIterator1 search_n(ForwardIterator1 first1,
|
|
ForwardIterator1 last1, Size count, Type const &value);)
|
|
itt(ForwardIterator1 search_n(ForwardIterator1 first1,
|
|
ForwardIterator1 last1, Size count, Type const &value, BinaryPredicate
|
|
pred);)
|
|
)
|
|
it() Description:
|
|
itemization(
|
|
it() The first prototype: an iterator into the first range
|
|
rangett(first1, last1) is returned where tt(n) consecutive elements having
|
|
value tt(value) are found using ti(operator==()) of the data type to which
|
|
the iterators point to compare the elements. If no such location exists,
|
|
tt(last1) is returned.
|
|
it() The second prototype: an iterator into the first range
|
|
rangett(first1, last1) is returned where tt(n) consecutive elements having
|
|
value tt(value) are found using the provided binary predicate tt(pred) to
|
|
compare the elements. If no such location exists, tt(last1) is returned.
|
|
)
|
|
it() Example:
|
|
verbinclude(stl/cc/searchn.cc)
|
|
)
|