1 <?xml version=
"1.0" encoding=
"UTF-8" standalone=
"no"?>
2 <!DOCTYPE html PUBLIC
"-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
3 <html xmlns=
"http://www.w3.org/1999/xhtml"><head><meta http-equiv=
"Content-Type" content=
"text/html; charset=UTF-8" /><title>Chapter
35. Algorithms
</title><meta name=
"generator" content=
"DocBook XSL Stylesheets V1.73.2" /><meta name=
"keywords" content=
" ISO C++ , library " /><link rel=
"start" href=
"../spine.html" title=
"The GNU C++ Library Documentation" /><link rel=
"up" href=
"extensions.html" title=
"Part XII. Extensions" /><link rel=
"prev" href=
"bk01pt12ch34.html" title=
"Chapter 34. Utilities" /><link rel=
"next" href=
"bk01pt12ch36.html" title=
"Chapter 36. Numerics" /></head><body><div class=
"navheader"><table width=
"100%" summary=
"Navigation header"><tr><th colspan=
"3" align=
"center">Chapter
35. Algorithms
</th></tr><tr><td width=
"20%" align=
"left"><a accesskey=
"p" href=
"bk01pt12ch34.html">Prev
</a> </td><th width=
"60%" align=
"center">Part XII. Extensions
</th><td width=
"20%" align=
"right"> <a accesskey=
"n" href=
"bk01pt12ch36.html">Next
</a></td></tr></table><hr /></div><div class=
"chapter" lang=
"en" xml:
lang=
"en"><div class=
"titlepage"><div><div><h2 class=
"title"><a id=
"manual.ext.algorithms"></a>Chapter
35. Algorithms
</h2></div></div></div><p>25.1.6 (count, count_if) is extended with two more versions of count
4 and count_if. The standard versions return their results. The
5 additional signatures return void, but take a final parameter by
6 reference to which they assign their results, e.g.,
7 </p><pre class=
"programlisting">
8 void count (first, last, value, n);
</pre><p>25.2 (mutating algorithms) is extended with two families of signatures,
9 random_sample and random_sample_n.
10 </p><p>25.2.1 (copy) is extended with
11 </p><pre class=
"programlisting">
12 copy_n (_InputIter first, _Size count, _OutputIter result);
</pre><p>which copies the first 'count' elements at 'first' into 'result'.
13 </p><p>25.3 (sorting 'n' heaps 'n' stuff) is extended with some helper
14 predicates. Look in the doxygen-generated pages for notes on these.
15 </p><div class=
"itemizedlist"><ul type=
"disc"><li><p><code class=
"code">is_heap
</code> tests whether or not a range is a heap.
</p></li><li><p><code class=
"code">is_sorted
</code> tests whether or not a range is sorted in
16 nondescending order.
</p></li></ul></div><p>25.3.8 (lexicographical_compare) is extended with
17 </p><pre class=
"programlisting">
18 lexicographical_compare_3way(_InputIter1 first1, _InputIter1 last1,
19 _InputIter2 first2, _InputIter2 last2)
</pre><p>which does... what?
20 </p></div><div class=
"navfooter"><hr /><table width=
"100%" summary=
"Navigation footer"><tr><td width=
"40%" align=
"left"><a accesskey=
"p" href=
"bk01pt12ch34.html">Prev
</a> </td><td width=
"20%" align=
"center"><a accesskey=
"u" href=
"extensions.html">Up
</a></td><td width=
"40%" align=
"right"> <a accesskey=
"n" href=
"bk01pt12ch36.html">Next
</a></td></tr><tr><td width=
"40%" align=
"left" valign=
"top">Chapter
34. Utilities
</td><td width=
"20%" align=
"center"><a accesskey=
"h" href=
"../spine.html">Home
</a></td><td width=
"40%" align=
"right" valign=
"top"> Chapter
36. Numerics
</td></tr></table></div></body></html>