boostorg/tuple
1
0
Fork 1
mirror of https://github.com/boostorg/tuple.git synced 2025-07-30 04:37:15 +02:00
Code Issues Packages Projects Releases Wiki Activity

added praise for Dave for improving tuple support on non-partial

Browse Source 
template specialization compilers


[SVN r19965]
This commit is contained in:
Jaakko Järvi
2003-09-08 15:10:04 +00:00
parent e4b869219b
commit c8e03a518b
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
doc/tuple_users_guide.html
View File

@ -460,8 +460,8 @@ f1(i,d); // #1
tie(i,d) = f2(); // #2 tie(i,d) = f2(); // #2
</code></pre> </code></pre>
See See
[<a href=#publ_1>1</a>, [<a href="#publ_1">1</a>,
<a href=#publ_2>2</a>] <a href="#publ_2">2</a>]
for more in-depth discussions about efficiency. for more in-depth discussions about efficiency.
<h4>Effect on Compile Time</h4> <h4>Effect on Compile Time</h4>
@ -472,8 +472,8 @@ Depending on the compiler and the tuple length, it may be more than 10 times slo
However, as a realistic program is likely to contain a lot of code in addition to tuple definitions, the difference is probably unnoticeable. However, as a realistic program is likely to contain a lot of code in addition to tuple definitions, the difference is probably unnoticeable.
Compile time increases between 5 to 10 percentages were measured for programs which used tuples very frequently. Compile time increases between 5 to 10 percentages were measured for programs which used tuples very frequently.
With the same test programs, memory consumption of compiling increased between 22% to 27%. See With the same test programs, memory consumption of compiling increased between 22% to 27%. See
[<a href=#publ_1>1</a>, [<a href="#publ_1">1</a>,
<a href=#publ_2>2</a>] <a href="#publ_2">2</a>]
for details. for details.
</p> </p>
@ -492,7 +492,7 @@ Below is a list of compilers and known problems with each compiler:
</table> </table>
<h2><a name = "thanks">Acknowledgements</a></h2> <h2><a name = "thanks">Acknowledgements</a></h2>
Gary Powell has been an indispensable helping hand. In particular, stream manipulators for tuples were his idea. Doug Gregor came up with a working version for MSVC. Thanks to Jeremy Siek, William Kempf and Jens Maurer for their help and suggestions. Gary Powell has been an indispensable helping hand. In particular, stream manipulators for tuples were his idea. Doug Gregor came up with a working version for MSVC, David Abrahams found a way to get rid of most of the restrictions for compilers not supporting partial specialization. Thanks to Jeremy Siek, William Kempf and Jens Maurer for their help and suggestions.
The comments by Vesa Karvonen, John Max Skaller, Ed Brey, Beman Dawes, David Abrahams and Hartmut Kaiser helped to improve the The comments by Vesa Karvonen, John Max Skaller, Ed Brey, Beman Dawes, David Abrahams and Hartmut Kaiser helped to improve the
library. library.
The idea for the tie mechanism came from an old usenet article by Ian McCulloch, where he proposed something similar for std::pairs. The idea for the tie mechanism came from an old usenet article by Ian McCulloch, where he proposed something similar for std::pairs.
@ -514,7 +514,7 @@ J&auml;rvi J.: <i>ML-Style Tuple Assignment in Standard C++ - Extending the Mult
<hr> <hr>
<p>Last modified 2001-09-13</p> <p>Last modified 2003-09-07</p>
<p>&copy; Copyright <a href="../../../people/jaakko_jarvi.htm"> Jaakko J&auml;rvi</a> 2001. <p>&copy; Copyright <a href="../../../people/jaakko_jarvi.htm"> Jaakko J&auml;rvi</a> 2001.