OLD | NEW |
| (Empty) |
1 <?xml version="1.0" encoding="UTF-8" standalone="no"?> | |
2 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.or
g/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.74.0" /><meta name="keywor
ds" content=" ISO C++ , library " /><link r
el="home" href="../spine.html" title="The GNU C++ Library Documentation" /><link
rel="up" href="extensions.html" title="Part XII. Extensions" /><link rel="prev
" href="ext_utilities.html" title="Chapter 34. Utilities" /><link rel="next" hre
f="ext_numerics.html" title="Chapter 36. Numerics" /></head><body><div class="na
vheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" ali
gn="center">Chapter 35. Algorithms</th></tr><tr><td width="20%" align="left"><a
accesskey="p" href="ext_utilities.html">Prev</a> </td><th width="60%" align="cen
ter">Part XII. | |
4 Extensions | |
5 | |
6 </th><td width="20%" align="right"> <a accesskey="n" href="ext_numerics.html">Ne
xt</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) i
s extended with two more versions of count | |
7 and count_if. The standard versions return their results. The | |
8 additional signatures return void, but take a final parameter by | |
9 reference to which they assign their results, e.g., | |
10 </p><pre class="programlisting"> | |
11 void count (first, last, value, n);</pre><p>25.2 (mutating algorithms) is ext
ended with two families of signatures, | |
12 random_sample and random_sample_n. | |
13 </p><p>25.2.1 (copy) is extended with | |
14 </p><pre class="programlisting"> | |
15 copy_n (_InputIter first, _Size count, _OutputIter result);</pre><p>which cop
ies the first 'count' elements at 'first' into 'result'. | |
16 </p><p>25.3 (sorting 'n' heaps 'n' stuff) is extended with some helper | |
17 predicates. Look in the doxygen-generated pages for notes on these. | |
18 </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 | |
19 nondescending order.</p></li></ul></div><p>25.3.8 (lexicographical_compa
re) is extended with | |
20 </p><pre class="programlisting"> | |
21 lexicographical_compare_3way(_InputIter1 first1, _InputIter1 last1, | |
22 _InputIter2 first2, _InputIter2 last2)</pre><p>
which does... what? | |
23 </p></div><div class="navfooter"><hr /><table width="100%" summary="Navigation f
ooter"><tr><td width="40%" align="left"><a accesskey="p" href="ext_utilities.htm
l">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="extension
s.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="ext_num
erics.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Chap
ter 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> | |
OLD | NEW |