mirror of
https://gitlab.com/fbb-git/cppannotations
synced 2024-11-16 07:48:44 +01:00
6881bc3814
Annotations. The branches and tags directory are empty, since I couldn't svnadmin import a repostitory dump. Many earlier versions exist, though, and if you want the full archive, just let me know and I'll send you the svnadmin dump of my full C++ Annotations archive. Frank B. Brokken <f.b.brokken@rug.nl> git-svn-id: https://cppannotations.svn.sourceforge.net/svnroot/cppannotations/trunk@3 f6dd340e-d3f9-0310-b409-bdd246841980
27 lines
1.2 KiB
Text
27 lines
1.2 KiB
Text
hi(binary_search())
|
|
itemization(
|
|
it() Header file:
|
|
centt(#include <algorithm>)
|
|
it() Function prototypes:
|
|
itemization(
|
|
itt(bool binary_search+OPENPARForwardIterator first,
|
|
ForwardIterator last,)linebreak()tt(Type const &value+CLOSEPAR;)
|
|
itt(bool binary_search+OPENPARForwardIterator first,
|
|
ForwardIterator last,)linebreak()tt(Type const &value, Comparator comp+CLOSEPAR;)
|
|
)
|
|
it() Description:
|
|
itemization(
|
|
it() The first prototype: tt(value) is looked up using binary
|
|
search in the range of elements implied by the iterator range rangett(first,
|
|
last). The elements in the range must have been sorted by the
|
|
tt(Type::operator<()) function. tt(True) is returned if the element was found,
|
|
tt(false) otherwise.
|
|
it() The second prototype: tt(value) is looked up using binary
|
|
search in the range of elements implied by the iterator range rangett(first,
|
|
last). The elements in the range must have been sorted by the
|
|
tt(Comparator) function object. tt(True) is returned if the element was found,
|
|
tt(false) otherwise.
|
|
)
|
|
it() Example:
|
|
verbinclude(stl/cc/binarysearch.cc)
|
|
)
|