| 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 | <!-- Copyright Aleksey Gurtovoy 2006. Distributed under the Boost --> |
|---|
| 5 | <!-- Software License, Version 1.0. (See accompanying --> |
|---|
| 6 | <!-- file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) --> |
|---|
| 7 | <head> |
|---|
| 8 | <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> |
|---|
| 9 | <meta name="generator" content="Docutils 0.3.6: http://docutils.sourceforge.net/" /> |
|---|
| 10 | <title>The MPL Reference Manual: Iteration Algorithms</title> |
|---|
| 11 | <link rel="stylesheet" href="../style.css" type="text/css" /> |
|---|
| 12 | </head> |
|---|
| 13 | <body class="docframe refmanual"> |
|---|
| 14 | <table class="header"><tr class="header"><td class="header-group navigation-bar"><span class="navigation-group"><a href="./inserters-inserter.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> |
|---|
| 15 | <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> |
|---|
| 16 | </tr></table><div class="header-separator"></div> |
|---|
| 17 | <div class="section" id="iteration-algorithms"> |
|---|
| 18 | <h1><a class="toc-backref" href="./algorithms.html#id396" name="iteration-algorithms">Iteration Algorithms</a></h1> |
|---|
| 19 | <a class="target" id="id90" name="id90"></a><p>Iteration algorithms are the basic building blocks behind many of the |
|---|
| 20 | MPL's algorithms, and are usually the first place to look at when |
|---|
| 21 | starting to build a new one. Abstracting away the details of sequence |
|---|
| 22 | iteration and employing various optimizations such as recursion |
|---|
| 23 | unrolling, they provide significant advantages over a hand-coded |
|---|
| 24 | approach.</p> |
|---|
| 25 | <!-- Of all of iteration algorithms, ``iter_fold_if`` is the |
|---|
| 26 | most complex and at the same time the most fundamental. The rest of |
|---|
| 27 | the algorithms from the category |- -| ``iter_fold``, ``reverse_iter_fold``, |
|---|
| 28 | ``fold``, and ``reverse_fold`` |- -| simply provide a more high-level |
|---|
| 29 | (and more restricted) interface to the core ``iter_fold_if`` |
|---|
| 30 | functionality [#performace]_. |
|---|
| 31 | |
|---|
| 32 | .. [#performace] That's not to say that they are *implemented* |
|---|
| 33 | through ``iter_fold_if`` |- -| they are often not, in particular |
|---|
| 34 | because the restricted functionality allows for more |
|---|
| 35 | optimizations. --> |
|---|
| 36 | <!-- modtime: November 08, 2004 10:55:02 +0000 --> |
|---|
| 37 | <!-- Algorithms/Iteration Algorithms//fold --> |
|---|
| 38 | <ul class="toc simple" id="outline"> |
|---|
| 39 | <li><a class="reference" href="./fold.html" id="id397" name="id397">fold</a></li> |
|---|
| 40 | <li><a class="reference" href="./iter-fold.html" id="id398" name="id398">iter_fold</a></li> |
|---|
| 41 | <li><a class="reference" href="./reverse-fold.html" id="id399" name="id399">reverse_fold</a></li> |
|---|
| 42 | <li><a class="reference" href="./reverse-iter-fold.html" id="id400" name="id400">reverse_iter_fold</a></li> |
|---|
| 43 | <li><a class="reference" href="./accumulate.html" id="id401" name="id401">accumulate</a></li> |
|---|
| 44 | </ul> |
|---|
| 45 | </div> |
|---|
| 46 | |
|---|
| 47 | <div class="footer-separator"></div> |
|---|
| 48 | <table class="footer"><tr class="footer"><td class="header-group navigation-bar"><span class="navigation-group"><a href="./inserters-inserter.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> |
|---|
| 49 | </tr></table></body> |
|---|
| 50 | </html> |
|---|
