| 1 |
742 |
jeremybenn |
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
| 2 |
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN" "http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
|
| 3 |
|
|
<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Chapter 26. Numerics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.76.1"/><meta name="keywords" content=" ISO C++ , library "/><meta name="keywords" content=" ISO C++ , runtime , library "/><link rel="home" href="../index.html" title="The GNU C++ Library"/><link rel="up" href="extensions.html" title="Part III. Extensions"/><link rel="prev" href="ext_algorithms.html" title="Chapter 25. Algorithms"/><link rel="next" href="ext_iterators.html" title="Chapter 27. Iterators"/></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 26. Numerics</th></tr><tr><td align="left"><a accesskey="p" href="ext_algorithms.html">Prev</a> </td><th width="60%" align="center">Part III.
|
| 4 |
|
|
Extensions
|
| 5 |
|
|
|
| 6 |
|
|
</th><td align="right"> <a accesskey="n" href="ext_iterators.html">Next</a></td></tr></table><hr/></div><div class="chapter" title="Chapter 26. Numerics"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.numerics"/>Chapter 26. Numerics</h2></div></div></div><p>26.4, the generalized numeric operations such as <code class="code">accumulate</code>,
|
| 7 |
|
|
are extended with the following functions:
|
| 8 |
|
|
</p><pre class="programlisting">
|
| 9 |
|
|
power (x, n);
|
| 10 |
|
|
power (x, n, monoid_operation);</pre><p>Returns, in FORTRAN syntax, "<code class="code">x ** n</code>" where
|
| 11 |
|
|
<code class="code">n >= 0</code>. In the
|
| 12 |
|
|
case of <code class="code">n == 0</code>, returns the identity element for the
|
| 13 |
|
|
monoid operation. The two-argument signature uses multiplication (for
|
| 14 |
|
|
a true "power" implementation), but addition is supported as well.
|
| 15 |
|
|
The operation functor must be associative.
|
| 16 |
|
|
</p><p>The <code class="code">iota</code> function wins the award for Extension With the
|
| 17 |
|
|
Coolest Name (the name comes from Ken Iverson's APL language.) As
|
| 18 |
|
|
described in the <a class="link" href="http://www.sgi.com/tech/stl/iota.html">SGI
|
| 19 |
|
|
documentation</a>, it "assigns sequentially increasing values to a range.
|
| 20 |
|
|
That is, it assigns <code class="code">value</code> to <code class="code">*first</code>,
|
| 21 |
|
|
<code class="code">value + 1</code> to<code class="code"> *(first + 1)</code> and so on."
|
| 22 |
|
|
</p><pre class="programlisting">
|
| 23 |
|
|
void iota(_ForwardIter first, _ForwardIter last, _Tp value);</pre><p>The <code class="code">iota</code> function is included in the ISO C++ 2011 standard.
|
| 24 |
|
|
</p></div><div class="navfooter"><hr/><table width="100%" summary="Navigation footer"><tr><td align="left"><a accesskey="p" href="ext_algorithms.html">Prev</a> </td><td align="center"><a accesskey="u" href="extensions.html">Up</a></td><td align="right"> <a accesskey="n" href="ext_iterators.html">Next</a></td></tr><tr><td align="left" valign="top">Chapter 25. Algorithms </td><td align="center"><a accesskey="h" href="../index.html">Home</a></td><td align="right" valign="top"> Chapter 27. Iterators</td></tr></table></div></body></html>
|
