projects / ceph.git / blame
| Commit | Line | Data |
|---|---|---|
| 7c673cae FG |
1 | <?xml version="1.0" encoding="utf-8" ?> |
| 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" xml:lang="en" lang="en"> | |
| 4 | <head> | |
| 5 | <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> | |
| 6 | <meta name="generator" content="Docutils 0.7: http://docutils.sourceforge.net/" /> | |
| 7 | <title>The MPL Reference Manual: Iteration Algorithms</title> | |
| 8 | <link rel="stylesheet" href="../style.css" type="text/css" /> | |
| 9 | </head> | |
| 10 | <body class="docframe refmanual"> | |
| 11 | <table class="header"><tr class="header"><td class="header-group navigation-bar"><span class="navigation-group"><a href="./inserter-class.html" class="navigation-link">Prev</a> <a href="./fold.html" class="navigation-link">Next</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./inserters.html" class="navigation-link">Back</a> <a href="./querying-algorithms.html" class="navigation-link">Along</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./algorithms.html" class="navigation-link">Up</a> <a href="../refmanual.html" class="navigation-link">Home</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./refmanual_toc.html" class="navigation-link">Full TOC</a></span></td> | |
| 12 | <td class="header-group page-location"><a href="../refmanual.html" class="navigation-link">Front Page</a> / <a href="./algorithms.html" class="navigation-link">Algorithms</a> / <a href="./iteration-algorithms.html" class="navigation-link">Iteration Algorithms</a></td> | |
| 13 | </tr></table><div class="header-separator"></div> | |
| 14 | <div class="section" id="iteration-algorithms"> | |
| 15 | <h1><a class="toc-backref" href="./algorithms.html#id1468">Iteration Algorithms</a></h1> | |
| 16 | <p id="label-algorithms-iteration-algorithms">Iteration algorithms are the basic building blocks behind many of the | |
| 17 | MPL's algorithms, and are usually the first place to look at when | |
| 18 | starting to build a new one. Abstracting away the details of sequence | |
| 19 | iteration and employing various optimizations such as recursion | |
| 20 | unrolling, they provide significant advantages over a hand-coded | |
| 21 | approach.</p> | |
| 22 | <!-- Of all of iteration algorithms, ``iter_fold_if`` is the | |
| 23 | most complex and at the same time the most fundamental. The rest of | |
| 24 | the algorithms from the category |- -| ``iter_fold``, ``reverse_iter_fold``, | |
| 25 | ``fold``, and ``reverse_fold`` |- -| simply provide a more high-level | |
| 26 | (and more restricted) interface to the core ``iter_fold_if`` | |
| 27 | functionality [#performace]_. | |
| 28 | ||
| 29 | .. [#performace] That's not to say that they are *implemented* | |
| 30 | through ``iter_fold_if`` |- -| they are often not, in particular | |
| 31 | because the restricted functionality allows for more | |
| 32 | optimizations. --> | |
| 33 | <!-- Algorithms/Iteration Algorithms//fold --> | |
| 34 | <ul class="toc simple" id="outline"> | |
| 35 | <li><a class="reference internal" href="./fold.html" id="id1469">fold</a></li> | |
| 36 | <li><a class="reference internal" href="./iter-fold.html" id="id1470">iter_fold</a></li> | |
| 37 | <li><a class="reference internal" href="./reverse-fold.html" id="id1471">reverse_fold</a></li> | |
| 38 | <li><a class="reference internal" href="./reverse-iter-fold.html" id="id1472">reverse_iter_fold</a></li> | |
| 39 | <li><a class="reference internal" href="./accumulate.html" id="id1473">accumulate</a></li> | |
| 40 | </ul> | |
| 41 | </div> | |
| 42 | ||
| 43 | <div class="footer-separator"></div> | |
| 44 | <table class="footer"><tr class="footer"><td class="header-group navigation-bar"><span class="navigation-group"><a href="./inserter-class.html" class="navigation-link">Prev</a> <a href="./fold.html" class="navigation-link">Next</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./inserters.html" class="navigation-link">Back</a> <a href="./querying-algorithms.html" class="navigation-link">Along</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./algorithms.html" class="navigation-link">Up</a> <a href="../refmanual.html" class="navigation-link">Home</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./refmanual_toc.html" class="navigation-link">Full TOC</a></span></td> | |
| 45 | <td><div class="copyright-footer"><div class="copyright">Copyright © 2001-2009 Aleksey Gurtovoy and David Abrahams</div> | |
| 46 | Distributed under the Boost Software License, Version 1.0. (See accompanying | |
| 47 | file LICENSE_1_0.txt or copy at <a class="reference external" href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)</div></td></tr></table></body> | |
| 48 | </html> |