https://svn.boost.org/trac10/ticket/8582 <p> The documentation for the string algorithm library states: </p> <p> "Algorithm stacking: Copy versions return a transformed input as a result, thus allow a simple chaining of transformations within one expression (i.e. one can write trim_copy(to_upper_copy(s))). Mutable versions have void return, to avoid misuse. " </p> <p> I'm not sure what they mean by misuse but if all of the mutable version returned a reference to the object you are manipulating then you could chain them together without paying the price of copying the string over and over again. </p> en-us /htdocs/site/boost.png https://svn.boost.org/trac10/ticket/8582 Trac 1.4.3 Ray Logel <rlogel@…> Fri, 17 May 2013 18:04:32 GMT https://svn.boost.org/trac10/ticket/8582#comment:1 https://svn.boost.org/trac10/ticket/8582#comment:1 <ul> <li><strong>cc</strong> <span class="trac-author">rlogel@…</span> added </li> </ul> Ticket