Skip to content

R
riscv-gcc-1
Switch branch/tag
Find file
Normal viewHistoryPermalink
ext_algorithms.html 3.06 KB
Newer Older
html: Regenerate.
6ae8f77d
 
Benjamin Kosnik committed
1 
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
*: Regenerate.
df2c31ee
 
Benjamin Kosnik committed
2 
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN" "http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
status_cxx200x.xml: Update.
604e39b1
 
Jonathan Wakely committed
3 
<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Chapter 23. Algorithms</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.75.2"/><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    "/><link rel="home" href="../spine.html" title="The GNU C++ Library"/><link rel="up" href="extensions.html" title="Part III.  Extensions"/><link rel="prev" href="ext_utilities.html" title="Chapter 22. Utilities"/><link rel="next" href="ext_numerics.html" title="Chapter 24. Numerics"/></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 23. Algorithms</th></tr><tr><td align="left"><a accesskey="p" href="ext_utilities.html">Prev</a> </td><th width="60%" align="center">Part III. 
html: Regenerate.
6ae8f77d
 
Benjamin Kosnik committed
4 5 
  Extensions
status_cxx200x.xml: Update.
604e39b1
 
Jonathan Wakely committed
6 
</th><td align="right"> <a accesskey="n" href="ext_numerics.html">Next</a></td></tr></table><hr/></div><div class="chapter" title="Chapter 23. Algorithms"><div class="titlepage"><div><div><h1 class="title"><a id="manual.ext.algorithms"/>Algorithms</h1></div></div></div><p>25.1.6 (count, count_if) is extended with two more versions of count
html: Regenerate.
6ae8f77d
 
Benjamin Kosnik committed
7 8 9 10 11 12 13 14 15 16 17 
   and count_if.  The standard versions return their results.  The
   additional signatures return void, but take a final parameter by
   reference to which they assign their results, e.g.,
</p><pre class="programlisting">
   void count (first, last, value, n);</pre><p>25.2 (mutating algorithms) is extended with two families of signatures,
   random_sample and random_sample_n.
</p><p>25.2.1 (copy) is extended with
</p><pre class="programlisting">
   copy_n (_InputIter first, _Size count, _OutputIter result);</pre><p>which copies the first 'count' elements at 'first' into 'result'.
</p><p>25.3 (sorting 'n' heaps 'n' stuff) is extended with some helper
   predicates.  Look in the doxygen-generated pages for notes on these.
*: Regenerate.
df2c31ee
 
Benjamin Kosnik committed
18 
</p><div class="itemizedlist"><ul class="itemizedlist"><li class="listitem"><p><code class="code">is_heap</code> tests whether or not a range is a heap.</p></li><li class="listitem"><p><code class="code">is_sorted</code> tests whether or not a range is sorted in
faq.xml: Link to manual.
18246ced
 
Jonathan Wakely committed
19 
	nondescending order.</p></li></ul></div><p>25.3.8 (lexicographical_compare) is extended with
html: Regenerate.
6ae8f77d
 
Benjamin Kosnik committed
20 21 
</p><pre class="programlisting">
   lexicographical_compare_3way(_InputIter1 first1, _InputIter1 last1,
faq.xml: Link to manual.
18246ced
 
Jonathan Wakely committed
22 
				 _InputIter2 first2, _InputIter2 last2)</pre><p>which does... what?
*: Regenerate.
df2c31ee
 
Benjamin Kosnik committed
23 
</p></div><div class="navfooter"><hr/><table width="100%" summary="Navigation footer"><tr><td align="left"><a accesskey="p" href="ext_utilities.html">Prev</a> </td><td align="center"><a accesskey="u" href="extensions.html">Up</a></td><td align="right"> <a accesskey="n" href="ext_numerics.html">Next</a></td></tr><tr><td align="left" valign="top">Chapter 22. Utilities </td><td align="center"><a accesskey="h" href="../spine.html">Home</a></td><td align="right" valign="top"> Chapter 24. Numerics</td></tr></table></div></body></html>