mirror of
https://gitlab.com/fbb-git/cppannotations
synced 2024-11-18 10:06:54 +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
30 lines
1.4 KiB
Text
30 lines
1.4 KiB
Text
hi(partial_sort_copy())
|
|
itemization(
|
|
it() Header file:
|
|
centt(#include <algorithm>)
|
|
it() Function prototypes:
|
|
itemization(
|
|
itt(void partial_sort_copy+OPENPARInputIterator first,
|
|
InputIterator last,)linebreak()
|
|
tt(RandomAccessIterator dest_first, RandomAccessIterator
|
|
dest_last+CLOSEPAR;)
|
|
itt(void partial_sort_copy+OPENPARInputIterator first,
|
|
InputIterator last,)linebreak()
|
|
tt(RandomAccessIterator dest_first, RandomAccessIterator dest_last,
|
|
Compare comp+CLOSEPAR;)
|
|
)
|
|
it() Description:
|
|
itemization(
|
|
it() The first prototype: the smallest elements in the range
|
|
rangett(first, last) are copied to the range rangett(dest_first, dest_last),
|
|
using the ti(operator<()) of the data type to which the iterators point. Only
|
|
the number of elements in the smaller range are copied to the second range.
|
|
it() The second prototype: the elements in the range
|
|
rangett(first, last) are are sorted by the binary predicate tt(comp). The
|
|
elements for which the predicate returns most often tt(true) are copied to the
|
|
range rangett(dest_first, dest_last). Only the number of elements in the
|
|
smaller range are copied to the second range.
|
|
)
|
|
it() Example:
|
|
verbinclude(stl/cc/partialsortcopy.cc)
|
|
)
|