summaryrefslogtreecommitdiff
path: root/doc/html/lambda/s07.html
diff options
context:
space:
mode:
authorAnas Nashif <anas.nashif@intel.com>2013-08-26 08:15:55 -0400
committerAnas Nashif <anas.nashif@intel.com>2013-08-26 08:15:55 -0400
commitbb4dd8289b351fae6b55e303f189127a394a1edd (patch)
tree77c9c35a31b1459dd7988c2448e797d142530c41 /doc/html/lambda/s07.html
parent1a78a62555be32868418fe52f8e330c9d0f95d5a (diff)
downloadboost-bb4dd8289b351fae6b55e303f189127a394a1edd.tar.gz
boost-bb4dd8289b351fae6b55e303f189127a394a1edd.tar.bz2
boost-bb4dd8289b351fae6b55e303f189127a394a1edd.zip
Imported Upstream version 1.51.0upstream/1.51.0
Diffstat (limited to 'doc/html/lambda/s07.html')
-rw-r--r--[-rwxr-xr-x]doc/html/lambda/s07.html18
1 files changed, 9 insertions, 9 deletions
diff --git a/doc/html/lambda/s07.html b/doc/html/lambda/s07.html
index ead4f2d729..efa963124e 100755..100644
--- a/doc/html/lambda/s07.html
+++ b/doc/html/lambda/s07.html
@@ -24,15 +24,15 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="id2379999"></a>Practical considerations</h2></div></div></div>
+<a name="id2419740"></a>Practical considerations</h2></div></div></div>
<div class="toc"><dl>
-<dt><span class="section"><a href="s07.html#id2380004">Performance</a></span></dt>
-<dt><span class="section"><a href="s07.html#id2380393">About compiling</a></span></dt>
-<dt><span class="section"><a href="s07.html#id2380436">Portability</a></span></dt>
+<dt><span class="section"><a href="s07.html#id2419745">Performance</a></span></dt>
+<dt><span class="section"><a href="s07.html#id2420135">About compiling</a></span></dt>
+<dt><span class="section"><a href="s07.html#id2420185">Portability</a></span></dt>
</dl></div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="id2380004"></a>Performance</h3></div></div></div>
+<a name="id2419745"></a>Performance</h3></div></div></div>
<p>In theory, all overhead of using STL algorithms and lambda functors
compared to hand written loops can be optimized away, just as the overhead
from standard STL function objects and binders can.
@@ -216,7 +216,7 @@ library is described
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="id2380393"></a>About compiling</h3></div></div></div>
+<a name="id2420135"></a>About compiling</h3></div></div></div>
<p>The BLL uses templates rather heavily, performing numerous recursive instantiations of the same templates.
This has (at least) three implications:
</p>
@@ -240,8 +240,8 @@ Most compilers allow a greater number of nested templates, but commonly require
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="id2380436"></a>Portability</h3></div></div></div>
-<div class="toc"><dl><dt><span class="section"><a href="s07.html#id2380468">Test coverage</a></span></dt></dl></div>
+<a name="id2420185"></a>Portability</h3></div></div></div>
+<div class="toc"><dl><dt><span class="section"><a href="s07.html#id2420217">Test coverage</a></span></dt></dl></div>
<p>
The BLL works with the following compilers, that is, the compilers are capable of compiling the test cases that are included with the BLL:
@@ -260,7 +260,7 @@ The BLL works with the following compilers, that is, the compilers are capable o
</p>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="id2380468"></a>Test coverage</h4></div></div></div>
+<a name="id2420217"></a>Test coverage</h4></div></div></div>
<p>The following list describes the test files included and the features that each file covers:
</p>