Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r66545 - in sandbox/statistics/support/libs/assign/v2/doc/html: . boost_assign_v2 boost_assign_v2/users_guide
From: erwann.rogard_at_[hidden]
Date: 2010-11-12 12:29:32

Next message: erwann.rogard_at_[hidden]: "[Boost-commit] svn:boost r66546 - sandbox/statistics/support/libs/assign/v2/doc"
Previous message: erwann.rogard_at_[hidden]: "[Boost-commit] svn:boost r66544 - sandbox/statistics/support/libs/assign/v2/doc/html"

Author: e_r
Date: 2010-11-12 12:29:28 EST (Fri, 12 Nov 2010)
New Revision: 66545
URL: http://svn.boost.org/trac/boost/changeset/66545

Log:
re-adding libs/assign/v2/doc/html
Added:
   sandbox/statistics/support/libs/assign/v2/doc/html/
   sandbox/statistics/support/libs/assign/v2/doc/html/boost_assign_v2/
   sandbox/statistics/support/libs/assign/v2/doc/html/boost_assign_v2/users_guide/
   sandbox/statistics/support/libs/assign/v2/doc/html/boost_assign_v2/users_guide.html (contents, props changed)
   sandbox/statistics/support/libs/assign/v2/doc/html/boost_assign_v2/users_guide/anonymous_container_of_references.html (contents, props changed)
   sandbox/statistics/support/libs/assign/v2/doc/html/boost_assign_v2/users_guide/working_assumptions.html (contents, props changed)
   sandbox/statistics/support/libs/assign/v2/doc/html/index.html (contents, props changed)

Added: sandbox/statistics/support/libs/assign/v2/doc/html/boost_assign_v2/users_guide.html
==============================================================================
--- (empty file)
+++ sandbox/statistics/support/libs/assign/v2/doc/html/boost_assign_v2/users_guide.html 2010-11-12 12:29:28 EST (Fri, 12 Nov 2010)
@@ -0,0 +1,254 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>User's guide</title>
+<link rel="stylesheet" href="..//usr/local/trunk/libs/assign/v2/doc/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Assign 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Assign 2.0">
+<link rel="prev" href="../index.html" title="Chapter 1. Boost.Assign 2.0">
+<link rel="next" href="users_guide/working_assumptions.html" title="Working assumptions">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../index.html"><img src="../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="users_guide/working_assumptions.html"><img src="../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="User's guide">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_assign_v2.users_guide"></a><a class="link" href="users_guide.html" title="User's guide"> User's guide</a>
+</h2></div></div></div>
+<div class="toc"><dl>
+<dt>Notation</dt>
+<dt><a href="users_guide/working_assumptions.html">Working
+ assumptions</a></dt>
+<dt><a href="users_guide/anonymous_container_of_references.html">Anonymous
+ container of references</a></dt>
+<dd><dl>
+<dt><a href="users_guide/anonymous_container_of_references.html#boost_assign_v2.users_guide.anonymous_container_of_references.assign_copy">Assign
+ copy</a></dt>
+<dt><a href="users_guide/anonymous_container_of_references.html#boost_assign_v2.users_guide.anonymous_container_of_references.assign_rebind">Assign
+ rebind</a></dt>
+<dt><a href="users_guide/anonymous_container_of_references.html#boost_assign_v2.users_guide.anonymous_container_of_references.the_functor_interface">The
+ functor interface</a></dt>
+</dl></dd>
+</dl></div>
+
+ This section describes the usage of the tools of this library. For specific
+ details, check the reference section.
+ 
+
+ All the examples given therein are in the <code class="computeroutput">/libs/assign/v2/example/</code>
+ directory.
+ 
+<div class="section" title="Notation">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.users_guide.notation"></a><a class="link" href="users_guide.html#boost_assign_v2.users_guide.notation" title="Notation">Notation</a>
+</h3></div></div></div>
+<div class="table">
+<a name="boost_assign_v2.users_guide.notation.symbols"></a>Table 1.1. Symbols
+<div class="table-contents"><table class="table" summary="Symbols">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Symbol
+ 
+ </th>
+<th>
+ 
+ Description
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput">cont</code>
+ 
+ </td>
+<td>
+ 
+ A container
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">s</code>
+ 
+ </td>
+<td>
+ 
+ A key
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">t</code>
+ 
+ </td>
+<td>
+ 
+ A data
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">u</code>
+ 
+ </td>
+<td>
+ 
+ A key data pair
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">arg</code>
+ 
+ </td>
+<td>
+ 
+ An argument to a function
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+ <div class="table">
+<a name="boost_assign_v2.users_guide.notation.indexes"></a>Table 1.2. Indexes
+<div class="table-contents"><table class="table" summary="Indexes">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Expression
+ 
+ </th>
+<th>
+ 
+ Description
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="literal"> <code class="literal">i</code> = 0, ..., <code class="literal">n</code>-1</code>
+ 
+ </td>
+<td>
+ 
+ Indexes a sequences of <code class="computeroutput">t</code>'s
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="literal"> <code class="literal">j</code> = 0, ..., <code class="literal">k</code>-1</code>
+ 
+ </td>
+<td>
+ 
+ Indexes arguments associated with a <code class="computeroutput">t</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="literal"> <code class="literal">k</code>[<code class="literal">i</code>] </code>
+ 
+ </td>
+<td>
+ 
+ Number of function arguments at <code class="literal">i</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="literal"> <code class="computeroutput">arg</code>[<code class="literal">i</code>] </code>
+ 
+ </td>
+<td>
+ 
+ Set of arguments at <code class="literal">i</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="literal"> <code class="computeroutput">arg</code>[<code class="literal">i</code>,<code class="literal">j</code>]</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">j</code> th argument at <code class="literal">i</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="literal">a</code>[<code class="literal">i</code>] , <code class="literal">b</code>[<code class="literal">i</code>]
+ , <code class="literal">c</code>[<code class="literal">i</code>] etc.
+ 
+ </td>
+<td>
+ 
+ Shorthand for <code class="literal">arg</code>[<code class="literal">i</code>,<code class="literal">0</code>],
+ <code class="literal">arg</code>[<code class="literal">i</code>,<code class="literal">1</code>],
+ <code class="literal">arg</code>[<code class="literal">i</code>,<code class="literal">2</code>]
+ etc.
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+ 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2004 Thorsten Ottosen, 2010 Erwann Rogard
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../index.html"><img src="../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="users_guide/working_assumptions.html"><img src="../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/statistics/support/libs/assign/v2/doc/html/boost_assign_v2/users_guide/anonymous_container_of_references.html
==============================================================================
--- (empty file)
+++ sandbox/statistics/support/libs/assign/v2/doc/html/boost_assign_v2/users_guide/anonymous_container_of_references.html 2010-11-12 12:29:28 EST (Fri, 12 Nov 2010)
@@ -0,0 +1,188 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Anonymous container of references</title>
+<link rel="stylesheet" href="../..//usr/local/trunk/libs/assign/v2/doc/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Assign 2.0">
+<link rel="up" href="../users_guide.html" title="User's guide">
+<link rel="prev" href="working_assumptions.html" title="Working assumptions">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="working_assumptions.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../users_guide.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a>
+</div>
+<div class="section" title="Anonymous container of references">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.users_guide.anonymous_container_of_references"></a><a class="link" href="anonymous_container_of_references.html" title="Anonymous container of references">Anonymous
+ container of references</a>
+</h3></div></div></div>
+<div class="toc"><dl>
+<dt><a href="anonymous_container_of_references.html#boost_assign_v2.users_guide.anonymous_container_of_references.assign_copy">Assign
+ copy</a></dt>
+<dt><a href="anonymous_container_of_references.html#boost_assign_v2.users_guide.anonymous_container_of_references.assign_rebind">Assign
+ rebind</a></dt>
+<dt><a href="anonymous_container_of_references.html#boost_assign_v2.users_guide.anonymous_container_of_references.the_functor_interface">The
+ functor interface</a></dt>
+</dl></div>
+<div class="section" title="Assign copy">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.users_guide.anonymous_container_of_references.assign_copy"></a><a class="link" href="anonymous_container_of_references.html#boost_assign_v2.users_guide.anonymous_container_of_references.assign_copy" title="Assign copy">Assign
+ copy</a>
+</h4></div></div></div>
+
+ To work with references, the relevant <code class="computeroutput">namespace</code>
+ is <code class="computeroutput">ref</code>, but we also need
+ a nested <code class="computeroutput">namespace</code> that specifies
+ an assignment policy. For example,
+ 
+
+
+
+<pre class="programlisting">namespace ns = ref::assign_copy;
+boost::for_each( ns::csv_anon( x, y, z ), printer(std::cout) );
+//outputs (1,0)(NULL,0)(1,5)
+</pre>
+
+ 
+
+ 
+
+ The result from <code class="computeroutput">ns::csv_anon()</code>
+ is more than just a range. It has much of the functionality of the static
+ array, boost::array<>,
+ such as <code class="computeroutput">assign()</code>,
+ as we now illustrate,
+ 
+
+
+
+<pre class="programlisting">T x1, y1, z1;
+ns::csv_anon( x1, y1, z1 ).assign( T( b, a ) );
+BOOST_ASSERT( y1 == T( b, a ) );
+</pre>
+
+ 
+
+ 
+
+ Here's how to create an empty array of <code class="computeroutput">const
+ T</code> references:
+ 
+
+
+
+<pre class="programlisting">ns::csv_anon<T const>( _nil );
+</pre>
+
+ 
+
+ 
+</div>
+<div class="section" title="Assign rebind">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.users_guide.anonymous_container_of_references.assign_rebind"></a><a class="link" href="anonymous_container_of_references.html#boost_assign_v2.users_guide.anonymous_container_of_references.assign_rebind" title="Assign rebind">Assign
+ rebind</a>
+</h4></div></div></div>
+
+ We now turn to the rebind assignment policy. Here, it will be necessary
+ to save the result:
+ 
+
+
+
+<pre class="programlisting">namespace ns = ref::assign_rebind;
+typedef ns::nth_result_of::csv_anon<3, T const>::type result_;
+result_ result = ns::csv_anon( x, y, z );
+BOOST_ASSERT( &result[ 1 ] == &y );
+</pre>
+
+ 
+
+ Thus far, the side effect would be the same under the <code class="computeroutput">assign_copy</code>
+ policy. The effect of assigning a new object to each element of our result,
+ however, is different:
+ 
+
+
+
+<pre class="programlisting">T w = T( b, a ); result.assign( w );
+BOOST_ASSERT( &result[ 1 ] == &w );
+</pre>
+
+ 
+
+ 
+</div>
+<div class="section" title="The functor interface">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.users_guide.anonymous_container_of_references.the_functor_interface"></a><a class="link" href="anonymous_container_of_references.html#boost_assign_v2.users_guide.anonymous_container_of_references.the_functor_interface" title="The functor interface">The
+ functor interface</a>
+</h4></div></div></div>
+
+ The functor interface works as follows:
+ 
+
+
+
+<pre class="programlisting">namespace ns = ref::assign_rebind;
+typedef ns::nth_result_of::anon<2, T const>::type result1_;
+result1_ result1 = ns::anon( x )( y );
+</pre>
+
+ 
+
+ and <code class="computeroutput">result1</code> has all the
+ functionality of that resulting from <code class="computeroutput">csv_anon(x, y)</code>.
+ Unlike the latter, it's possible to append an element:
+ 
+
+
+
+<pre class="programlisting">typedef ns::nth_result_of::anon<3, T const>::type result2_;
+result2_ result2 = result1( z );
+</pre>
+
+ 
+
+ Internally, <code class="computeroutput">result2</code> keeps
+ a reference to <code class="computeroutput">result1</code>,
+ and not until the boost::array<>
+ interface is called, as in
+ 
+
+
+
+<pre class="programlisting">boost::for_each( result2, printer(std::cout) );
+</pre>
+
+ 
+
+ is a static array allocated, with reference wrappers, in this case, for
+ <code class="computeroutput">x</code>, <code class="computeroutput">y</code> and <code class="computeroutput">z</code>,
+ 
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2004 Thorsten Ottosen, 2010 Erwann Rogard
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="working_assumptions.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../users_guide.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a>
+</div>
+</body>
+</html>

Added: sandbox/statistics/support/libs/assign/v2/doc/html/boost_assign_v2/users_guide/working_assumptions.html
==============================================================================
--- (empty file)
+++ sandbox/statistics/support/libs/assign/v2/doc/html/boost_assign_v2/users_guide/working_assumptions.html 2010-11-12 12:29:28 EST (Fri, 12 Nov 2010)
@@ -0,0 +1,174 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Working assumptions</title>
+<link rel="stylesheet" href="../..//usr/local/trunk/libs/assign/v2/doc/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Assign 2.0">
+<link rel="up" href="../users_guide.html" title="User's guide">
+<link rel="prev" href="../users_guide.html" title="User's guide">
+<link rel="next" href="anonymous_container_of_references.html" title="Anonymous container of references">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../users_guide.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../users_guide.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="anonymous_container_of_references.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+<div class="section" title="Working assumptions">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.users_guide.working_assumptions"></a><a class="link" href="working_assumptions.html" title="Working assumptions">Working
+ assumptions</a>
+</h3></div></div></div>
+
+ Here we give some pieces of code that will be assumed throughout. The chosen
+ set up is such that, by appealing to deduction, a broad range of needs, including
+ the basic ones, are adressed. What we mean by a basic need, is filling a
+ container with <code class="computeroutput">int</code>s. What we
+ mean by a need that is at the complexity boundary of our set up, is working
+ with a collection of <code class="computeroutput">boost::tuple</code>s
+ of references.
+ 
+
+ The first piece of code are include statements:
+ 
+
+ 
+
+
+
+<pre class="programlisting">#include <iostream>
+#include <utility> // std::pair
+#include <boost/assert.hpp>
+#include <boost/range/algorithm.hpp>
+#include <boost/assign/v2/v2.hpp>
+</pre>
+
+ 
+
+ 
+
+ Next, we define a <code class="computeroutput">struct</code>, <code class="computeroutput">foo</code> :
+ 
+
+ 
+
+
+
+<pre class="programlisting">struct foo
+{
+ foo():ptr_a( 0 ), b( 0 ){}
+ foo( int& a) : ptr_a( &a ), b( 0 ){}
+ foo( int& a, int const& b_): ptr_a( &a ), b( b_ ){}
+
+ bool operator==(foo const& other)const
+ {
+ return (this->ptr_a == other.ptr_a) && (this->b == other.b);
+ }
+
+ foo& operator+=(int const& delta){ this->b += delta; return (*this); }
+
+ private:
+ friend std::ostream & operator<<(std::ostream &os, const foo& p);
+ int* ptr_a;
+ int b;
+};
+
+struct make_foo
+{
+ typedef foo result_type;
+ result_type operator()(int& a, int const& b)const
+ {
+ return result_type( a, b );
+ }
+};
+
+std::ostream& operator<<( std::ostream& os, foo const& t);
+
+struct printer
+{
+ typedef void result_type;
+
+ printer(std::ostream& os_) : os( os_ ){}
+
+ result_type operator()( foo const& t)const
+ {
+ this->os << t;
+ }
+
+ private:
+ mutable std::ostream& os;
+};
+</pre>
+
+ 
+
+ The exact definition of <code class="computeroutput">operator<<</code> can be found in the file foo.cpp
+ .
+ 
+
+ Then come some dependent types,
+ 
+
+
+
+<pre class="programlisting">typedef const char* S; // key
+typedef foo T; // data
+typedef std::pair<S,T> U; //key-data pair
+</pre>
+
+ 
+
+ and finally a set of constants :
+ 
+
+
+
+<pre class="programlisting">namespace{
+
+int a = 1, b = 5;
+
+S key_x = "x" ;
+S key_y = "y" ;
+S key_z = "z" ;
+
+const T x( a ); // (1, 0)
+const T y; // (NULL, 0)
+const T z( a, b ); //(1, 5)
+
+}
+</pre>
+
+ 
+
+ 
+
+ In terms of our notation, by seeing <code class="computeroutput">x</code>, <code class="computeroutput">y</code>, and
+ <code class="computeroutput">z</code> as forming a sequence, <code class="computeroutput">n =
+ 3</code>, <code class="computeroutput">k[0] =
+ 1</code>, <code class="computeroutput">k[1] =
+ 0</code>, and <code class="computeroutput">k[2] =
+ 2</code>.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2003 -2004 Thorsten Ottosen, 2010 Erwann Rogard
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../users_guide.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../users_guide.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="anonymous_container_of_references.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox/statistics/support/libs/assign/v2/doc/html/index.html
==============================================================================
--- (empty file)
+++ sandbox/statistics/support/libs/assign/v2/doc/html/index.html 2010-11-12 12:29:28 EST (Fri, 12 Nov 2010)
@@ -0,0 +1,3306 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Chapter 1. Boost.Assign 2.0</title>
+<link rel="stylesheet" href="/usr/local/trunk/libs/assign/v2/doc/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="index.html" title="Chapter 1. Boost.Assign 2.0">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav"></div>
+<div class="chapter" title="Chapter 1. Boost.Assign 2.0">
+<div class="titlepage"><div>
+<div><h2 class="title">
+<a name="boost_assign_v2"></a>Chapter 1. Boost.Assign 2.0</h2></div>
+<div><div class="author"><h3 class="author">
+Ottosen Thorsten
+</h3></div></div>
+<div><div class="author"><h3 class="author">
+Erwann Rogard
+</h3></div></div>
+<div>Copyright © 2003 -2004 Thorsten Ottosen, 2010 Erwann Rogard</div>
+<div><div class="legalnotice" title="Legal Notice">
+<a name="id36154309"></a>
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></div>
+</div></div>
+<div class="toc">
+Table of Contents
+<dl>
+<dt><a href="index.html#boost_assign_v2.dummy"> Help with qbk : without this enclosing
+ section, the layout messes up! </a></dt>
+<dd><dl>
+<dt>Preface</dt>
+<dt> User's guide</dt>
+<dd><dl>
+<dt>Notation</dt>
+<dt> Working assumptions</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.ref_anon"> Anonymous container
+ of references</a></dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt> Assign copy</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.ref_anon.rebind"> Assign
+ rebind</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.ref_anon.functor"> The functor
+ interface</a></dt>
+</dl></dd>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put"> Adaptors <code class="computeroutput">_csv_put</code> and <code class="computeroutput">_put</code>
+ </a></dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.usage"> Basic usage
+ </a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.std_modifier"> Standard
+ modifier</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.arg_forwarding"> Argument
+ forwarding</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.ptr_container"> Pointer
+ container</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.ext_func"> Extended
+ functionality</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.test_knowledge"> Test
+ your knowledge</a></dt>
+</dl></dd>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.anon"> Anonymous container
+ of values</a></dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt>Usage</dt>
+</dl></dd>
+<dt> Adaptor _put_range</dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt>Usage</dt>
+</dl></dd>
+<dt> Adaptor _chain</dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt>Usage</dt>
+</dl></dd>
+<dt> Conversion</dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.conversion.anonymous_containers">Anonymous
+ containers</a></dt>
+<dt>_chain adaptor</dt>
+<dt>Inter-STL-categories</dt>
+</dl></dd>
+<dt> Configuring arity</dt>
+</dl></dd>
+<dt>Reference</dt>
+<dt>Runtime efficiency</dt>
+<dt> Testing platform</dt>
+<dt>Portability</dt>
+<dt>Dependencies</dt>
+<dt>Change log</dt>
+<dd><dl>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__">[Proposal
+ for] Upgrading from Boost v1.4x
+ : Boost.Assign 2.0</a></dt>
+<dd><dl>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.the_new_organization">The
+ new organization</a></dt>
+<dt>Rationale</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.the_new_interface">The
+ new interface</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.code_reuse">Code
+ reuse</a></dt>
+</dl></dd>
+</dl></dd>
+<dt>Support</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.history_and_acknowledgement">History
+ and acknowledgement</a></dt>
+<dd><dl>
+<dt><a href="index.html#boost_assign_v2.dummy.history_and_acknowledgement.__boost_assign_v1__">Boost.Assign
+ 1.0</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.history_and_acknowledgement.__boost_assign_v2___">Boost.Assign
+ 2.0 </a></dt>
+</dl></dd>
+<dt>Bibliography</dt>
+</dl></dd>
+</dl>
+</div>
+<div class="section" title="Help with qbk : without this enclosing section, the layout messes up!">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_assign_v2.dummy"></a><a class="link" href="index.html#boost_assign_v2.dummy" title="Help with qbk : without this enclosing section, the layout messes up!"> Help with qbk : without this enclosing
+ section, the layout messes up! </a>
+</h2></div></div></div>
+<div class="toc"><dl>
+<dt>Preface</dt>
+<dt> User's guide</dt>
+<dd><dl>
+<dt>Notation</dt>
+<dt> Working assumptions</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.ref_anon"> Anonymous container
+ of references</a></dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt> Assign copy</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.ref_anon.rebind"> Assign
+ rebind</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.ref_anon.functor"> The functor
+ interface</a></dt>
+</dl></dd>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put"> Adaptors <code class="computeroutput">_csv_put</code> and <code class="computeroutput">_put</code>
+ </a></dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.usage"> Basic usage
+ </a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.std_modifier"> Standard
+ modifier</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.arg_forwarding"> Argument
+ forwarding</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.ptr_container"> Pointer
+ container</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.ext_func"> Extended
+ functionality</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.test_knowledge"> Test
+ your knowledge</a></dt>
+</dl></dd>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.anon"> Anonymous container
+ of values</a></dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt>Usage</dt>
+</dl></dd>
+<dt> Adaptor _put_range</dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt>Usage</dt>
+</dl></dd>
+<dt> Adaptor _chain</dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt>Usage</dt>
+</dl></dd>
+<dt> Conversion</dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.conversion.anonymous_containers">Anonymous
+ containers</a></dt>
+<dt>_chain adaptor</dt>
+<dt>Inter-STL-categories</dt>
+</dl></dd>
+<dt> Configuring arity</dt>
+</dl></dd>
+<dt>Reference</dt>
+<dt>Runtime efficiency</dt>
+<dt> Testing platform</dt>
+<dt>Portability</dt>
+<dt>Dependencies</dt>
+<dt>Change log</dt>
+<dd><dl>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__">[Proposal
+ for] Upgrading from Boost v1.4x
+ : Boost.Assign 2.0</a></dt>
+<dd><dl>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.the_new_organization">The
+ new organization</a></dt>
+<dt>Rationale</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.the_new_interface">The
+ new interface</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.code_reuse">Code
+ reuse</a></dt>
+</dl></dd>
+</dl></dd>
+<dt>Support</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.history_and_acknowledgement">History
+ and acknowledgement</a></dt>
+<dd><dl>
+<dt><a href="index.html#boost_assign_v2.dummy.history_and_acknowledgement.__boost_assign_v1__">Boost.Assign
+ 1.0</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.history_and_acknowledgement.__boost_assign_v2___">Boost.Assign
+ 2.0 </a></dt>
+</dl></dd>
+<dt>Bibliography</dt>
+</dl></div>
+<div class="section" title="Preface">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.dummy.preface"></a><a class="link" href="index.html#boost_assign_v2.dummy.preface" title="Preface">Preface</a>
+</h3></div></div></div>
+
+ The Boost.Assign 2.0 framework offers the following tools:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ Putting elements in a container with an interface that is uniform across
+ container types.
+ </li>
+<li class="listitem">
+ Assignment between containers of different categories, such as from a
+ <code class="computeroutput">std::vector<></code>,
+ which models Sequence,
+ to a <code class="computeroutput">std::stack<></code>,
+ which is an <a href="http://www.sgi.com/tech/stl/Sequence.html" target="_top">adapter
+ container</a>
+</li>
+<li class="listitem">
+ An anonymous container (i.e. constructed in place) of values, whose interface
+ is akin to a <code class="computeroutput">std::deque<></code>.
+ </li>
+<li class="listitem">
+ An anonymous container (i.e. constructed in place) of references, whose
+ interface is akin to boost::array<>.
+ </li>
+<li class="listitem">
+ Forming the union of (chaining) ranges while preserving the properties
+ of the underlying iterator types, which is non-trivial if at least one
+ range is that of an anonymous container (a temporary) of lvalue references.
+ </li>
+</ul></div>
+
+ These tools are for the most part available through adaptors, a concept borrowed
+ from <a href="http://www.boost.org/doc/libs/1_44_0/libs/range/doc/html/range/reference/adaptors.html" target="_top">range
+ adaptors</a> so that they work together nicely with <a href="http://www.boost.org/doc/libs/1_44_0/libs/range/doc/html/range/reference/algorithms.html" target="_top">range
+ algorithms</a>.
+ 
+</div>
+<div class="section" title="User's guide">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.dummy.ug"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug" title="User's guide"> User's guide</a>
+</h3></div></div></div>
+<div class="toc"><dl>
+<dt>Notation</dt>
+<dt> Working assumptions</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.ref_anon"> Anonymous container
+ of references</a></dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt> Assign copy</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.ref_anon.rebind"> Assign
+ rebind</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.ref_anon.functor"> The functor
+ interface</a></dt>
+</dl></dd>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put"> Adaptors <code class="computeroutput">_csv_put</code> and <code class="computeroutput">_put</code>
+ </a></dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.usage"> Basic usage
+ </a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.std_modifier"> Standard
+ modifier</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.arg_forwarding"> Argument
+ forwarding</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.ptr_container"> Pointer
+ container</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.ext_func"> Extended
+ functionality</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.test_knowledge"> Test
+ your knowledge</a></dt>
+</dl></dd>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.anon"> Anonymous container
+ of values</a></dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt>Usage</dt>
+</dl></dd>
+<dt> Adaptor _put_range</dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt>Usage</dt>
+</dl></dd>
+<dt> Adaptor _chain</dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt>Usage</dt>
+</dl></dd>
+<dt> Conversion</dt>
+<dd><dl>
+<dt>Synopsis</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.conversion.anonymous_containers">Anonymous
+ containers</a></dt>
+<dt>_chain adaptor</dt>
+<dt>Inter-STL-categories</dt>
+</dl></dd>
+<dt> Configuring arity</dt>
+</dl></div>
+
+ This section describes the usage of the tools of this library. For specific
+ details, check the reference section.
+ 
+
+ All the examples given therein are in the <code class="computeroutput">/libs/assign/v2/example/</code>
+ directory.
+ 
+<div class="section" title="Notation">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.dummy.ug.notation"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.notation" title="Notation">Notation</a>
+</h4></div></div></div>
+<div class="table">
+<a name="boost_assign_v2.dummy.ug.notation.symbols"></a>Table 1.1. Symbols
+<div class="table-contents"><table class="table" summary="Symbols">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Symbol
+ 
+ </th>
+<th>
+ 
+ Description
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput">cont</code>
+ 
+ </td>
+<td>
+ 
+ A container
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">s</code>
+ 
+ </td>
+<td>
+ 
+ A key
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">t</code>
+ 
+ </td>
+<td>
+ 
+ A data
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">u</code>
+ 
+ </td>
+<td>
+ 
+ A key data pair
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">arg</code>
+ 
+ </td>
+<td>
+ 
+ An argument to a function
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">obj</code>
+ 
+ </td>
+<td>
+ 
+ An object defined in this library
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">p</code>
+ 
+ </td>
+<td>
+ 
+ A parameter for mutating an object
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+ 
+ To represent the types of the above, we typically use the a capital letter.
+ For example <code class="computeroutput">T</code> is the type
+ of <code class="computeroutput">t</code>.
+ 
+<div class="table">
+<a name="boost_assign_v2.dummy.ug.notation.indexes"></a>Table 1.2. Indexes
+<div class="table-contents"><table class="table" summary="Indexes">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Expression
+ 
+ </th>
+<th>
+ 
+ Description
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="literal"> <code class="literal">i</code> = 0, ..., <code class="literal">n</code>-1</code>
+ 
+ </td>
+<td>
+ 
+ Indexes a sequences of <code class="computeroutput">t</code>'s
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="literal"> <code class="literal">j</code> = 0, ..., <code class="literal">k</code>-1</code>
+ 
+ </td>
+<td>
+ 
+ Indexes arguments associated with a <code class="computeroutput">t</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="literal"> <code class="literal">k</code>[<code class="literal">i</code>] </code>
+ 
+ </td>
+<td>
+ 
+ Number of function arguments at <code class="literal">i</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="literal"> <code class="computeroutput">arg</code>[<code class="literal">i</code>] </code>
+ 
+ </td>
+<td>
+ 
+ Set of arguments at <code class="literal">i</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="literal"> <code class="computeroutput">arg</code>[<code class="literal">i</code>,<code class="literal">j</code>]</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">j</code> th argument at <code class="literal">i</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="literal">a</code>[<code class="literal">i</code>] , <code class="literal">b</code>[<code class="literal">i</code>]
+ , <code class="literal">c</code>[<code class="literal">i</code>] etc.
+ 
+ </td>
+<td>
+ 
+ Shorthand for <code class="literal">arg</code>[<code class="literal">i</code>,<code class="literal">0</code>],
+ <code class="literal">arg</code>[<code class="literal">i</code>,<code class="literal">1</code>],
+ <code class="literal">arg</code>[<code class="literal">i</code>,<code class="literal">2</code>]
+ etc.
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="literal"> <code class="literal">l</code> = 0, ..., <code class="literal">m</code>-1</code>
+ 
+ </td>
+<td>
+ 
+ Indexes a sequences of <code class="computeroutput">p</code>'s
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+ 
+</div>
+<div class="section" title="Working assumptions">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.dummy.ug.wa"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.wa" title="Working assumptions"> Working assumptions</a>
+</h4></div></div></div>
+
+ Here we give some pieces of code that will be assumed throughout. The chosen
+ set up is such that, by appealing to deduction, a broad range of needs,
+ including the basic ones, are adressed. What we mean by a basic need, is
+ filling a container with <code class="computeroutput">int</code>s.
+ What we mean by a need that is at the complexity boundary of our set up,
+ is working with a collection of <code class="computeroutput">boost::tuple</code>s
+ of references.
+ 
+
+ The first piece of code are include statements:
+ 
+
+ 
+
+
+
+<pre class="programlisting">#include <iostream>
+#include <utility> // std::pair
+#include <boost/assert.hpp>
+#include <boost/range/algorithm.hpp>
+#include <boost/assign/v2/v2.hpp>
+</pre>
+
+ 
+
+ 
+
+ Next, we define a <code class="computeroutput">struct</code>,
+ <code class="computeroutput">foo</code> :
+ 
+
+ 
+
+
+
+<pre class="programlisting">struct foo
+{
+ foo():ptr_a( 0 ), b( 0 ){}
+ foo( int& a) : ptr_a( &a ), b( 0 ){}
+ foo( int& a, int const& b_): ptr_a( &a ), b( b_ ){}
+
+ bool operator==(foo const& other)const
+ {
+ return (this->ptr_a == other.ptr_a) && (this->b == other.b);
+ }
+
+ foo& operator+=(int const& delta){ this->b += delta; return (*this); }
+
+ private:
+ friend std::ostream & operator<<(std::ostream &os, const foo& p);
+ int* ptr_a;
+ int b;
+};
+
+struct make_foo
+{
+ typedef foo result_type;
+ result_type operator()(int& a, int const& b)const
+ {
+ return result_type( a, b );
+ }
+};
+
+std::ostream& operator<<( std::ostream& os, foo const& t);
+
+struct printer
+{
+ typedef void result_type;
+
+ printer(std::ostream& os_) : os( os_ ){}
+
+ result_type operator()( foo const& t)const
+ {
+ this->os << t;
+ }
+
+ private:
+ mutable std::ostream& os;
+};
+</pre>
+
+ 
+
+ The exact definition of <code class="computeroutput">operator<<</code> can be found in the file foo.cpp
+ .
+ 
+
+ Then come some dependent types,
+ 
+
+
+
+<pre class="programlisting">typedef const char* S; // key
+typedef foo T; // data
+typedef std::pair<S,T> U; //key-data pair
+</pre>
+
+ 
+
+ and finally a set of constants :
+ 
+
+
+
+<pre class="programlisting">namespace{
+
+int a = 1, b = 5;
+
+S key_x = "x" ;
+S key_y = "y" ;
+S key_z = "z" ;
+
+const T x( a ); // (1, 0)
+const T y; // (NULL, 0)
+const T z( a, b ); //(1, 5)
+
+}
+</pre>
+
+ 
+
+ 
+
+ In terms of our notation, by seeing <code class="computeroutput">x</code>, <code class="computeroutput">y</code>, and
+ <code class="computeroutput">z</code> as forming a sequence, <code class="computeroutput">n =
+ 3</code>, <code class="computeroutput">k[0] =
+ 1</code>, <code class="computeroutput">k[1] =
+ 0</code>, and <code class="computeroutput">k[2] =
+ 2</code>.
+ 
+</div>
+<div class="section" title="Anonymous container of references">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.dummy.ug.ref_anon"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.ref_anon" title="Anonymous container of references"> Anonymous container
+ of references</a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt>Synopsis</dt>
+<dt> Assign copy</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.ref_anon.rebind"> Assign
+ rebind</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.ref_anon.functor"> The functor
+ interface</a></dt>
+</dl></div>
+<div class="section" title="Synopsis">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.ref_anon.synopsis"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.ref_anon.synopsis" title="Synopsis">Synopsis</a>
+</h5></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Call
+ 
+ </th>
+<th>
+ 
+ Result
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput">ref::assign_xxx::csv_anon(
+ _nil )</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">typename ref::assign_xxx::nth_result_of::csv_anon<0, U>::type</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">ref::assign_xxx::csv_anon(
+ t[0], ...,
+ t[n-1]
+ )</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">typename ref::assign_xxx::nth_result_of::csv_anon<n,
+ U>::type</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">ref::assign_xxx::csv_anon(
+ _nil )</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">typename ref::assign_xxx::nth_result_of::anon<0, U>::type</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">ref::assign_xxx::anon(
+ t[0] )...(
+ t[n-1]
+ )</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">typename ref::assign_xxx::nth_result_of::anon<n,U>::type</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+
+ where <code class="computeroutput">ref::assign_xxx</code> is either of <code class="computeroutput">ref::assign_copy</code> or <code class="computeroutput">ref::assign_rebind</code>,
+ and <code class="computeroutput">U</code> is <code class="computeroutput">T const</code>
+ if <code class="computeroutput">t[i]</code>
+ is <code class="computeroutput">const</code> or an <code class="computeroutput">rvalue</code>, for at least one <code class="computeroutput">i</code>,
+ and <code class="computeroutput">U</code> is <code class="computeroutput">T</code> otherwise.
+ 
+<div class="section" title="Assign copy">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.ref_anon.copy"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.ref_anon.copy" title="Assign copy"> Assign copy</a>
+</h5></div></div></div>
+
+ To work with references, the relevant <code class="computeroutput">namespace</code>
+ is <code class="computeroutput">ref</code>, but we also need
+ a nested <code class="computeroutput">namespace</code> that
+ specifies an assignment policy. For example,
+ 
+
+
+
+<pre class="programlisting">namespace ns = ref::assign_copy;
+boost::for_each( ns::csv_anon( x, y, z ), printer(std::cout) );
+//outputs (1,0)(NULL,0)(1,5)
+</pre>
+
+ 
+
+ 
+
+ The result from <code class="computeroutput">ns::csv_anon()</code>
+ is more than just a range. It has much of the functionality of the static
+ array, boost::array<>,
+ such as <code class="computeroutput">assign()</code>,
+ as we now illustrate,
+ 
+
+
+
+<pre class="programlisting">T x1, y1, z1;
+ns::csv_anon( x1, y1, z1 ).assign( T( b, a ) );
+BOOST_ASSERT( y1 == T( b, a ) );
+</pre>
+
+ 
+
+ 
+</div>
+<div class="section" title="Assign rebind">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.ref_anon.rebind"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.ref_anon.rebind" title="Assign rebind"> Assign
+ rebind</a>
+</h5></div></div></div>
+
+ We now turn to the rebind assignment policy. Here, it will be necessary
+ to save the result:
+ 
+
+
+
+<pre class="programlisting">namespace ns = ref::assign_rebind;
+typedef ns::nth_result_of::csv_anon<3, T const>::type result_;
+result_ result = ns::csv_anon( x, y, z );
+BOOST_ASSERT( &result[ 1 ] == &y );
+</pre>
+
+ 
+
+ Thus far, the side effect would be the same under the <code class="computeroutput">assign_copy</code>
+ policy. The effect of assigning a new object to each element of our result,
+ however, is different:
+ 
+
+
+
+<pre class="programlisting">T w = T( b, a ); result.assign( w );
+BOOST_ASSERT( &result[ 1 ] == &w );
+</pre>
+
+ 
+
+ 
+</div>
+<div class="section" title="The functor interface">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.ref_anon.functor"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.ref_anon.functor" title="The functor interface"> The functor
+ interface</a>
+</h5></div></div></div>
+
+ The functor interface works as follows:
+ 
+
+
+
+<pre class="programlisting">namespace ns = ref::assign_rebind;
+typedef ns::nth_result_of::anon<2, T const>::type result1_;
+result1_ result1 = ns::anon( x )( y );
+</pre>
+
+ 
+
+ and <code class="computeroutput">result1</code> has all the
+ functionality of that resulting from <code class="computeroutput">csv_anon(x, y)</code>. Unlike the latter, it's possible to
+ append an element:
+ 
+
+
+
+<pre class="programlisting">typedef ns::nth_result_of::anon<3, T const>::type result2_;
+result2_ result2 = result1( z );
+</pre>
+
+ 
+
+ Internally, <code class="computeroutput">result2</code> keeps
+ a reference to <code class="computeroutput">result1</code>,
+ and not until the boost::array<>
+ interface is called, as in
+ 
+
+
+
+<pre class="programlisting">boost::for_each( result2, printer(std::cout) );
+</pre>
+
+ 
+
+ is a static array allocated, with reference wrappers, in this case, for
+ <code class="computeroutput">x</code>, <code class="computeroutput">y</code> and <code class="computeroutput">z</code>,
+ 
+</div>
+</div>
+<div class="section" title="Adaptors _csv_put and _put">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.dummy.ug.put"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put" title="Adaptors _csv_put and _put"> Adaptors <code class="computeroutput">_csv_put</code> and <code class="computeroutput">_put</code>
+ </a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt>Synopsis</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.usage"> Basic usage
+ </a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.std_modifier"> Standard
+ modifier</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.arg_forwarding"> Argument
+ forwarding</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.ptr_container"> Pointer
+ container</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.ext_func"> Extended
+ functionality</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.put.test_knowledge"> Test
+ your knowledge</a></dt>
+</dl></div>
+<div class="section" title="Synopsis">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.put.synopsis"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put.synopsis" title="Synopsis">Synopsis</a>
+</h5></div></div></div>
+<div class="table">
+<a name="boost_assign_v2.dummy.ug.put.synopsis.the_put_adaptor"></a>Table 1.3. The put adaptor
+<div class="table-contents"><table class="table" summary="The put adaptor">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Call
+ 
+ </th>
+<th>
+ 
+ Result
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput">cont | (adaptor::_csv_put %
+ p[0] %
+ ... %
+ p[m]
+ )( t[0],
+ ....,t[n-1] )</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">Cont&</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">cont | (adaptor::_put %
+ p[0] %
+ ... %
+ p[m]
+ )(arg[0][0],
+ ..., arg[0][k[0]])...( arg[n-1][0], ...,
+ arg[n-1][k[n-1]])</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">Cont&</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+ 
+</div>
+<div class="section" title="Basic usage">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.put.usage"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put.usage" title="Basic usage"> Basic usage
+ </a>
+</h5></div></div></div>
+
+ To put elements, <code class="computeroutput">x</code>, <code class="computeroutput">y</code> and <code class="computeroutput">z</code> into
+ a container,
+ 
+
+ 
+
+
+
+<pre class="programlisting">typedef std::vector<T> cont_;
+cont_ cont;
+using namespace adaptor;
+boost::for_each( cont | _csv_put( x, y, z ), printer(std::cout) );
+//outputs (1,0)(NULL,0)(1,5)
+</pre>
+
+ 
+
+ 
+
+ The workings and benefits of adaptors are developed in <a href="http://www.boost.org/doc/libs/1_44_0/libs/range/doc/html/range/reference/adaptors.html" target="_top">range
+ adaptors</a>, so they will not be repeated here. For our purpose,
+ however, keep in mind that our adaptor modifies the state of a container
+ before returning it. Specifically, the statement inside the first argument
+ of <code class="computeroutput">boost::for_each</code> is equivalent, for this particular
+ container type, to
+
+<pre class="programlisting">cont.push_back( x );
+cont.push_back( y );
+cont.push_back( z );
+</pre>
+
+ and returns a reference to <code class="computeroutput">cont</code>.
+ The result from <code class="computeroutput">_csv_put( x, y ,z )</code> internally
+ keeps references to <code class="computeroutput">x</code>, <code class="computeroutput">y</code> , <code class="computeroutput">z</code>,
+ so as to avoid any storage overhead.
+ 
+</div>
+<div class="section" title="Standard modifier">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.put.std_modifier"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put.std_modifier" title="Standard modifier"> Standard
+ modifier</a>
+</h5></div></div></div>
+
+ A container has one or more member functions to alter its state, and
+ in the case that interests us, adding elements. For example, <code class="computeroutput">push_back()</code>
+ is what we call, in this library, a standard modifier.
+ 
+<div class="section" title="Automatic deduction">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="boost_assign_v2.dummy.ug.put.std_modifier.auto"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put.std_modifier.auto" title="Automatic deduction">
+ Automatic deduction</a>
+</h6></div></div></div>
+
+ We have just encountered one instance of a <a href="http://www.sgi.com/tech/stl/Sequence.html" target="_top">sequence
+ container</a>, <code class="computeroutput">std::vector<></code>. In fact, the same adaptor
+ works seamlessly with the other categories of STL
+ containers, associative,
+ and adapter
+ (<code class="computeroutput">std::stack<></code>
+ and <code class="computeroutput">std::queue<></code>),
+ and the static array boost::array<>.
+ For example,
+ 
+
+
+
+<pre class="programlisting">typedef std::map<S,T> cont_;
+typedef cont_::value_type key_data_;
+cont_ cont;
+using namespace adaptor;
+BOOST_ASSERT(
+ (
+ cont | _csv_put(
+ key_data_(key_z, z),
+ key_data_(key_y, y),
+ key_data_(key_x, x)
+ )
+ )[key_x] == x
+);
+</pre>
+
+ 
+
+ In this instance, instead of <code class="computeroutput">push_back()</code>, as we had explained in the case
+ of <code class="computeroutput">std::vector<></code>,
+ <code class="computeroutput">insert()</code>
+ is the modifier that is called. This choice is made at compile time
+ by the library, based on certain properties of the destination container
+ (traits).
+ 
+
+ The repetition of <code class="computeroutput">key_data_()</code> in the code, though, is not very
+ elegant. There is a better solution, but it would be outside of the
+ topic of this section and therefore it will be shown in a subsequent
+ one.
+ 
+</div>
+<div class="section" title="User specified">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="boost_assign_v2.dummy.ug.put.std_modifier.user"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put.std_modifier.user" title="User specified">
+ User specified</a>
+</h6></div></div></div>
+
+ We have seen that the library automatically chooses a modifier at compile
+ time, such as <code class="computeroutput">push_back()</code> and <code class="computeroutput">insert()</code> in the cases of <code class="computeroutput">std::vector<></code>, and <code class="computeroutput">std::map<></code>, respectively. We can, however,
+ choose the modifier explicitly. This makes sense, for example, for
+ <code class="computeroutput">std::list<></code>
+ because the default modifier is <code class="computeroutput">push_back()</code>, whereas the user may in fact wish
+ to call <code class="computeroutput">push_front()</code>,
+ 
+
+
+
+<pre class="programlisting">typedef std::list<T> cont_;
+cont_ cont;
+using namespace adaptor;
+boost::for_each(
+ cont | (_csv_put % _push_front)( x, y, z ),
+ printer(std::cout)
+);
+//outputs (1,5)(NULL,0)(1,0)
+</pre>
+
+ 
+
+ 
+
+ Here's a catalog of the different standard modifiers.
+ 
+<div class="table">
+<a name="boost_assign_v2.dummy.ug.put.std_modifier.user.standard_modifier"></a>Table 1.4. Standard modifier
+<div class="table-contents"><table class="table" summary="Standard modifier">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Parameter
+ 
+ </th>
+<th>
+ 
+ Implementation
+ 
+ </th>
+<th>
+ 
+ Default
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput">_push_back</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">cont.push_back( t )</code>
+ 
+ </td>
+<td>
+ 
+ Sequence
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">_push_front</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">cont.push_front( t )</code>
+ 
+ </td>
+<td>
+ 
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">_push</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">cont.push( t )</code>
+ 
+ </td>
+<td>
+ 
+ Adapters
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">_at_next</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">cont[ i++
+ ] =
+ t </code>
+ 
+ </td>
+<td>
+ 
+ <a href="http://www.boost.org/doc/libs/release/doc/html/array.html" target="_top">Static
+ arrays</a>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">_insert</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">cont.insert( t )</code>
+ 
+ </td>
+<td>
+ 
+ Associative
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+ 
+ where index <code class="computeroutput">i</code> is initialized to zero.
+ 
+
+ More generally, <code class="computeroutput">operator%</code>, in conjunction with the adaptor generator
+ <code class="computeroutput">_csv_put</code> is used to
+ pass a parameter to the latter (not just a modifier) that determines
+ the implementation of <code class="computeroutput">operator|</code>. Just as the latter, <code class="computeroutput">operator%</code>
+ is composable. Make sure to keep any statement involving <code class="computeroutput">operator%</code>
+ and <code class="computeroutput">_csv_put</code> in between
+ brackets, as shown above.
+ 
+</div>
+<div class="section" title="Custom">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="boost_assign_v2.dummy.ug.put.std_modifier.custom_"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put.std_modifier.custom_" title="Custom">Custom
+ </a>
+</h6></div></div></div>
+
+ Imagine that the user has defined his/her own container, and that
+ <code class="computeroutput">baz()</code>
+ is the member function by which elements are inserted:
+
+<pre class="programlisting">struct bar{ void baz(int); };
+</pre>
+
+ By first expanding
+
+<pre class="programlisting">BOOST_ASSIGN_V2_PUT_MODIFIER_XXX(baz)
+</pre>
+
+ it's then possible to call, say
+
+<pre class="programlisting">bar cont;
+cont | (_csv_put % _baz)( x, y, z );
+</pre>
+
+ 
+</div>
+</div>
+<div class="section" title="Argument forwarding">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.put.arg_forwarding"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put.arg_forwarding" title="Argument forwarding"> Argument
+ forwarding</a>
+</h5></div></div></div>
+<div class="section" title="Automatic deduction">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="boost_assign_v2.dummy.ug.put.arg_forwarding.auto"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put.arg_forwarding.auto" title="Automatic deduction">
+ Automatic deduction</a>
+</h6></div></div></div>
+
+ The adaptor generator <code class="computeroutput">_csv_put</code>
+ which we have discussed so far is fine when the objects to be put into
+ a container are already constructed. Otherwise, we have to construct
+ them in place, e.g.
+ 
+
+
+
+<pre class="programlisting">typedef std::vector<T> cont_;
+cont_ cont;
+using namespace adaptor;
+boost::for_each(
+ cont | _csv_put( foo( a ), foo(), foo( a, b ) ),
+ printer(std::cout)
+);
+</pre>
+
+ 
+
+ We can achieve the same result, but with code that is more compact,
+ using a functor analog to <code class="computeroutput">_csv_put</code>,
+ <code class="computeroutput">_put</code>, that takes care
+ of forwarding to the constructor:
+ 
+
+
+
+<pre class="programlisting">typedef std::vector<T> cont_;
+cont_ cont;
+using namespace adaptor;
+boost::for_each(
+ cont | _put( a )()( a, b ),
+ printer(std::cout)
+);
+</pre>
+
+ 
+
+ The appropriate constructor is deduced at compile time, from the value
+ type of the destination container.
+ 
+
+ We are now able to show how to overcome the drawback that was pointed
+ out when filling a <code class="computeroutput">std::map<></code>, i.e. that the constructor
+ had to be called explicitly for each pair key-data arguments. Continuing
+ that <a class="link" href="index.html#boost_assign_v2.dummy.ug.put.std_modifier.auto" title="Automatic deduction">example</a>,
+ 
+
+
+
+<pre class="programlisting">cont.clear();
+BOOST_ASSERT(
+ ( cont | _put (key_z, z)(key_y, y)(key_x, x) )[key_x] == x
+);
+</pre>
+
+ 
+
+ 
+<div class="warning" title="Warning"><table border="0" summary="Warning">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../doc/html/images/warning.png"></td>
+<th align="left">Warning</th>
+</tr>
+<tr><td align="left" valign="top">
+ Using the adaptor <code class="computeroutput">_put</code>
+ may have greater compilation needs than <code class="computeroutput">_csv_put</code>.
+ For large <code class="literal">n</code> and <code class="literal">k</code>, it may be
+ necessary to construct objects in place, and pass them to <code class="computeroutput">_csv_put</code>. As an indication, under
+ the <a class="link" href="index.html#boost_assign_v2.dummy.testing_platform" title="Testing platform">default
+ testing platform</a>, <code class="literal">n > 32</code> and <code class="literal">k
+ = 1</code>, <code class="computeroutput">_put</code>
+ becomes problematic.
+ </td></tr>
+</table></div>
+</div>
+<div class="section" title="User specified">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="boost_assign_v2.dummy.ug.put.arg_forwarding.user"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put.arg_forwarding.user" title="User specified">
+ User specified</a>
+</h6></div></div></div>
+
+ As we have just seen, forwarding to the constructor is the default
+ choice. We can override it with <code class="computeroutput">operator%</code> in conjuction with <code class="computeroutput">_fun</code>.
+ Continuing from the previous example involving <code class="computeroutput">std::vector<></code>,
+ 
+
+
+
+<pre class="programlisting">int a0 = -1, a1 = 0, a2 = 1;
+cont.clear();
+boost::for_each(
+ cont | (
+ _put % ( _fun = make_foo() )
+ )( a0, b )( a1, b )( a2, b ),
+ printer(std::cout)
+);
+//outputs (-1,5)(0,5)(1,5)
+</pre>
+
+ 
+
+ 
+
+ Users that are familiar with the lambda
+ library will have recognized that the repetition of <code class="computeroutput">b</code>
+ would be better avoided thanks to a binding functor:
+ 
+
+
+
+<pre class="programlisting">cont.clear();
+using namespace boost::lambda;
+boost::for_each(
+ cont | (
+ _csv_put % (_fun = bind<T>( make_foo(), _1, b) )
+ )(a0, a1, a2),
+ printer(std::cout)
+);
+</pre>
+
+ 
+
+ Notice that since each argument in the sequence is now unary, we were
+ able to revert to using <code class="computeroutput">_csv_put</code>,
+ and did so only because it's more elegant that way.
+ 
+</div>
+</div>
+<div class="section" title="Pointer container">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.put.ptr_container"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put.ptr_container" title="Pointer container"> Pointer
+ container</a>
+</h5></div></div></div>
+
+ The same functionality as that for STL containers works for <a href="http://www.boost.org/doc/libs/release/libs/ptr_container/doc/ptr_container.html" target="_top">pointer
+ containers</a>, but the side effect is a bit different. For example,
+ consider,
+ 
+
+
+
+<pre class="programlisting">typedef boost::ptr_vector<T> cont_; cont_ cont;
+using namespace adaptor;
+boost::for_each(
+ cont | _csv_put( x, y, z ),
+ printer(std::cout)
+);
+</pre>
+
+ 
+
+ Copies of <code class="computeroutput">x</code>, <code class="computeroutput">y</code> and <code class="computeroutput">z</code> are allocated
+ on the heap, and their pointers put into <code class="computeroutput">cont</code>,
+ using <code class="computeroutput">push_back</code>, in this
+ case. Just as with other categories of containers, we can override both
+ the modifier and the argument forwarding mechanism, by passign the appropriate
+ parameters with <code class="computeroutput">operator%</code>.
+ 
+</div>
+<div class="section" title="Extended functionality">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.put.ext_func"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put.ext_func" title="Extended functionality"> Extended
+ functionality</a>
+</h5></div></div></div>
+
+ We have seen that there are two orthogonal parametrization: the standard
+ modifier, e.g. <code class="computeroutput">_push_back</code>
+ and the forwarding functor, e.g. <code class="computeroutput">_fun
+ = make_foo()</code>. Here, we discuss parametrization that
+ is more complex.
+ 
+<div class="section" title="Repeating an argument">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="boost_assign_v2.dummy.ug.put.ext_func.repeat"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put.ext_func.repeat" title="Repeating an argument">
+ Repeating an argument</a>
+</h6></div></div></div>
+
+ 
+
+
+
+<pre class="programlisting">cont.clear();
+boost::for_each(
+ cont | ( _csv_put % ( _repeat = 2 ) )( x ),
+ printer(std::cout)
+);
+// outputs (1,0)(1,0)
+</pre>
+
+ 
+
+ 
+</div>
+</div>
+<div class="section" title="Test your knowledge">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.put.test_knowledge"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put.test_knowledge" title="Test your knowledge"> Test
+ your knowledge</a>
+</h5></div></div></div>
+
+ Look at the piece of code below, and try to figure out what the output
+ will be. Notice that shown in the comments are the outputs of the individual
+ values, in the order in which they are passed to the adaptor generator.
+ For example, the output of <code class="computeroutput">std::cout << x</code> is <code class="literal">(1,0)</code>.
+ 
+
+
+
+<pre class="programlisting">typedef std::list<T> cont_;
+cont_ cont;
+using namespace boost::lambda;
+boost::for_each(
+ cont | ( _csv_put )( x ) /*(1,0)*/ | (
+ _put % _push_front % ( _repeat = 2 )
+ )()( b, a ) /*(NULL,0)(5,1)*/ | (
+ _csv_put % ( _fun = bind<T>( make_foo(), _1, b) )
+ )( a0, a1, a2 ), /*(-1,5)(0,5)(1,5)*/
+ printer(std::cout)
+);
+</pre>
+
+ 
+
+ 
+
+ The right answer is:
+ 
+
+
+
+<pre class="programlisting">// outputs (5,1)(5,1)(NULL,0)(NULL,0)(1,0)(-1,5)(0,5)(1,5)
+</pre>
+
+ 
+
+ 
+</div>
+</div>
+<div class="section" title="Anonymous container of values">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.dummy.ug.anon"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.anon" title="Anonymous container of values"> Anonymous container
+ of values</a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt>Synopsis</dt>
+<dt>Usage</dt>
+</dl></div>
+<div class="section" title="Synopsis">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.anon.synopsis"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.anon.synopsis" title="Synopsis">Synopsis</a>
+</h5></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Call
+ 
+ </th>
+<th>
+ 
+ Result
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput">csv_anon(
+ t[0], ...,t[n-1]
+ )</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">typename result_of::anon<T>::type</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">( anon<T>(_nil) %
+ p[0] %
+ ... %
+ p[m]
+ )( arg[0][0],
+ ..., arg[0][k[0]])...( arg[n-1][0], ...,
+ arg[n-1][k[n-1]])</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">typename result_of::anon<T>::type</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section" title="Usage">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.anon.usage"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.anon.usage" title="Usage">Usage</a>
+</h5></div></div></div>
+
+ An anonymous container of values is akin to a <code class="computeroutput">std::deque<></code> that can be constructed in place.
+ 
+
+ Here's an example using the csv form:
+ 
+
+
+
+<pre class="programlisting">boost::for_each( csv_anon<T>( x, y ,z ), printer(std::cout) );
+// outputs (1,0)(NULL,0)(1,5)
+</pre>
+
+ 
+
+ Here's an example using the functor form, and a parameter passed with
+ <code class="computeroutput">operator%</code>
+ 
+
+
+
+<pre class="programlisting">boost::for_each(
+ (anon<T>( _nil ) % _push_front)( a )()( a, b ),
+ printer(std::cout)
+);
+// outputs (1,5)(NULL,0)(1,0)
+</pre>
+
+ 
+
+ 
+
+ The section is kept brief, because one can deduce the workings of the
+ interface from that of the <a class="link" href="index.html#boost_assign_v2.dummy.ug.put" title="Adaptors _csv_put and _put"><code class="computeroutput">_put</code> adaptor</a>, which is explained
+ in detail. Specifically, the <code class="computeroutput">csv</code>
+ vs argument forwarding (functor) dichotomy and the parameter passing
+ mechanism, via <code class="computeroutput">operator%</code>, are the same.
+ 
+</div>
+</div>
+<div class="section" title="Adaptor _put_range">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.dummy.ug.put_range"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put_range" title="Adaptor _put_range"> Adaptor <code class="computeroutput">_put_range</code></a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt>Synopsis</dt>
+<dt>Usage</dt>
+</dl></div>
+<div class="section" title="Synopsis">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.put_range.synopsis"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put_range.synopsis" title="Synopsis">Synopsis</a>
+</h5></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Call
+ 
+ </th>
+<th>
+ 
+ Result
+ 
+ </th>
+</tr></thead>
+<tbody><tr>
+<td>
+ 
+ <code class="computeroutput">to | adaptor::_put_range( from )</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">To&</code>
+ 
+ </td>
+</tr></tbody>
+</table></div>
+</div>
+<div class="section" title="Usage">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.put_range.usage"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.put_range.usage" title="Usage">Usage</a>
+</h5></div></div></div>
+
+ In this example we show how to put a <code class="computeroutput">std::vector<></code>'s element into a <code class="computeroutput">std::queue<></code>.
+ 
+
+
+
+<pre class="programlisting">typedef std::vector<T> from_; from_ from( 3 );
+from[0] = x; from[1] = y; from[2] = z;
+typedef std::queue<T> to_; to_ to;
+using namespace adaptor;
+BOOST_ASSERT( (to | _put_range( from ) ).front() == x );
+BOOST_ASSERT( to.back() == z );
+</pre>
+
+ 
+
+ 
+<div class="note" title="Note"><table border="0" summary="Note">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../doc/html/images/note.png"></td>
+<th align="left">Note</th>
+</tr>
+<tr><td align="left" valign="top">
+ Reversing the roles <code class="computeroutput">std::vector<></code> and <code class="computeroutput">std::queue<></code> in the above operation will
+ not compile, because the input container, <code class="computeroutput">from</code>,
+ must model a <a href="http://www.boost.org/doc/libs/1_43_0/libs/range/doc/html/range/concepts.html" target="_top">forward
+ range</a>.
+ </td></tr>
+</table></div>
+</div>
+</div>
+<div class="section" title="Adaptor _chain">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.dummy.ug.chain"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.chain" title="Adaptor _chain"> Adaptor <code class="computeroutput">_chain</code></a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt>Synopsis</dt>
+<dt>Usage</dt>
+</dl></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Call
+ 
+ </th>
+<th>
+ 
+ Result
+ 
+ </th>
+</tr></thead>
+<tbody><tr>
+<td>
+ 
+ <code class="computeroutput">r1 | adaptor::_chain( r2 )</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">typename result_of::chain<R1,R2>::type</code>
+ 
+ </td>
+</tr></tbody>
+</table></div>
+<div class="section" title="Synopsis"><div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.chain.synopsis"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.chain.synopsis" title="Synopsis">Synopsis</a>
+</h5></div></div></div></div>
+<div class="section" title="Usage">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.chain.usage"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.chain.usage" title="Usage">Usage</a>
+</h5></div></div></div>
+
+ Adaptor <code class="computeroutput">_chain</code> is an
+ outgrowth of a similar functionality that appeared in the beta version
+ of Boost.RangeEx
+ that maps two ranges into their union. It is composable, as illustrated
+ below:
+ 
+
+
+
+<pre class="programlisting">typedef boost::array<T, 1> cont1_; cont1_ cont1; cont1[0] = x;
+typedef std::list<T> cont3_; cont3_ cont3; cont3.push_back( z );
+using namespace adaptor;
+namespace ns = ref::assign_copy;
+boost::for_each(
+ cont1 | _chain( ns::csv_anon( y ) ) | _chain( cont3 ),
+ printer( std::cout )
+);
+// outputs (1,0)(NULL,0)(1,5)
+</pre>
+
+ 
+
+ Adaptor <code class="computeroutput">_chain</code> has the
+ special property that it is lvalue preserving. Let us explain. An anonymous
+ container of references, by definition (anonymous means constructed in
+ place), is an rvalue. The references themselves, however, may be lvalue.
+ Two chained ranges, either of which is passed as an rvalue, but both
+ of which hold lvalues, is a range whose references are lvalues. Let us
+ now illustrate this:
+ 
+
+
+
+<pre class="programlisting">T y1;
+typedef std::vector<T> vec_; vec_ vec( 3, y );
+boost::copy(
+ vec,
+ boost::begin(
+ cont1 /* lvalue */ | _chain(
+ ns::csv_anon( y1 /* lvalue */ ) /* rvalue */
+ ) | _chain( cont3 /* lvalue */ )
+ )
+);
+BOOST_ASSERT( cont1[0] == y );
+BOOST_ASSERT( y1 == y );
+BOOST_ASSERT( cont3.front() == y1 );
+</pre>
+
+ 
+
+ 
+</div>
+
+ Also see the section on conversion.
+ 
+</div>
+<div class="section" title="Conversion">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.dummy.ug.conversion"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.conversion" title="Conversion"> Conversion</a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt>Synopsis</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.ug.conversion.anonymous_containers">Anonymous
+ containers</a></dt>
+<dt>_chain adaptor</dt>
+<dt>Inter-STL-categories</dt>
+</dl></div>
+<div class="section" title="Synopsis">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.conversion.synopsis"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.conversion.synopsis" title="Synopsis">Synopsis</a>
+</h5></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Call
+ 
+ </th>
+<th>
+ 
+ Result
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput">from |
+ convert<To>()</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">To</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">obj.convert<To>()</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">To</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">to = obj</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">To&</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+
+ where <code class="computeroutput">obj</code> is either an anonymous container, of values or
+ references, or the result from the <code class="computeroutput">_chain</code>
+ adaptor.
+ 
+</div>
+<div class="section" title="Anonymous containers">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.conversion.anonymous_containers"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.conversion.anonymous_containers" title="Anonymous containers">Anonymous
+ containers</a>
+</h5></div></div></div>
+
+ Anonymous containers can be converted to an arbitray containers. Such
+ as tool is particularly relevant when the destination container is an
+ <a href="http://en.wikipedia.org/wiki/Standard_Template_Library" target="_top">adapter
+ container</a> as they cannot be constructed from a pair of iterators.
+ 
+
+ It's possible to perform conversion in place, as is sometimes necessary
+ for copy-constructing a container:
+ 
+
+
+
+<pre class="programlisting">typedef std::queue<T> to_;
+to_ to = ref::assign_copy::csv_anon( x, y, z ).convert<to_>();
+to.pop();
+BOOST_ASSERT( to.front() == y ); // because FIFO
+</pre>
+
+ 
+
+ While we can use the same member function, <code class="computeroutput">convert<>()</code>, to assign a container, implicit
+ conversion suffices:
+ 
+
+
+
+<pre class="programlisting">typedef std::deque<T> to_;
+to_ to; to = ref::assign_copy::csv_anon( x, y, z );
+to.pop_back(); BOOST_ASSERT( to.back() == y );
+</pre>
+
+ 
+
+ 
+</div>
+<div class="section" title="_chain adaptor">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.conversion.__chain__adaptor"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.conversion.__chain__adaptor" title="_chain adaptor"><code class="computeroutput">_chain</code> adaptor</a>
+</h5></div></div></div>
+
+ Here's a case where chaining takes places:
+ 
+
+
+
+<pre class="programlisting">typedef boost::array<T, 2> from_;
+typedef std::stack<T> to_;
+from_ from; from[0] = x; from[1] = y;
+using namespace adaptor;
+namespace ns = ref::assign_copy;
+BOOST_ASSERT(
+ (
+ (
+ from | _chain( ns::csv_anon( z ) )
+ ).convert<to_>()
+ ).top() == z // because LIFO
+);
+</pre>
+
+ 
+
+ 
+</div>
+<div class="section" title="Inter-STL-categories">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.ug.conversion.inter_stl_categories"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.conversion.inter_stl_categories" title="Inter-STL-categories">Inter-STL-categories</a>
+</h5></div></div></div>
+
+ The library also caters to inter STL categories conversion, with the
+ help of the <code class="computeroutput">_convert</code>
+ adaptor. Here's an example:
+ 
+
+
+
+<pre class="programlisting">typedef boost::array<T, 3> from_;
+typedef std::stack<T> to_;
+from_ from; from[0] = x; from[1] = y; from[2] = z;
+using namespace adaptor;
+BOOST_ASSERT(
+ ( from | convert<to_>() ).top() == z // because LIFO
+);
+</pre>
+
+ 
+
+ 
+</div>
+</div>
+<div class="section" title="Configuring arity">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.dummy.ug.arity"></a><a class="link" href="index.html#boost_assign_v2.dummy.ug.arity" title="Configuring arity"> Configuring arity</a>
+</h4></div></div></div>
+
+ Below are overridable constants. In the first column is the constant's
+ identifier, it's default value, and the relevant <a class="link" href="index.html#boost_assign_v2.dummy.ug.notation" title="Notation">index</a>
+ that they control.
+ 
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Constant
+ 
+ </th>
+<th>
+ 
+ Default value
+ 
+ </th>
+<th>
+ 
+ Index
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ <code class="computeroutput">BOOST_ASSIGN_V2_LIMIT_CSV_ARITY</code>
+ 
+ </td>
+<td>
+ 
+ 20
+ 
+ </td>
+<td>
+ 
+ n
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">BOOST_ASSIGN_V2_LIMIT_LVALUE_CONST_ARITY</code>
+ 
+ </td>
+<td>
+ 
+ 2
+ 
+ </td>
+<td>
+ 
+ k
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ <code class="computeroutput">BOOST_ASSIGN_V2_LIMIT_ARITY</code>
+ 
+ </td>
+<td>
+ 
+ <code class="computeroutput">BOOST_MPL_LIMIT_METAFUNCTION_ARITY</code>
+ 
+ </td>
+<td>
+ 
+ k
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+
+ The first constant is the limit arity of a call such as
+
+<pre class="programlisting">_csv_put( t[0], ..., t[n-1]);
+</pre>
+
+ The second and third constants apply only to the functor form:
+
+<pre class="programlisting">_put( arg[0][0], ..., arg[0][k[0]])...( arg[n-1][0], ..., arg[n-1][k[n-1]]);
+</pre>
+
+ Specifically, the second constant is the limit for arity <code class="computeroutput">k[i]</code> under
+ which any combination of lvalue and rvalue arguments is preserved, for
+ any given <code class="computeroutput">i</code> in <code class="computeroutput">[0,...,n)</code>.
+ Beyond this limit, all arguments are treated as either lvalues or rvalues.
+ This restriction only applies to C++03,
+ not C++0x.
+ The third constant is the total limit for arity <code class="computeroutput">k[i]</code>.
+ 
+</div>
+</div>
+<div class="section" title="Reference">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.dummy.reference"></a><a class="link" href="index.html#boost_assign_v2.dummy.reference" title="Reference">Reference</a>
+</h3></div></div></div>
+
+ TODO
+ 
+</div>
+<div class="section" title="Runtime efficiency">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.dummy.runtime_efficiency"></a><a class="link" href="index.html#boost_assign_v2.dummy.runtime_efficiency" title="Runtime efficiency">Runtime efficiency</a>
+</h3></div></div></div>
+
+ In this section, we compare the execution time of various ways to fill an
+ STL container or creating an anonymous container.
+ 
+
+ Here are the types that are used:
+ 
+
+
+
+<pre class="programlisting">typedef std::vector<int> elem_; // T
+// This STL container is of the same type as that internally used by the
+// anon container of values, so we have a common basis for comparing
+// their exec time.
+typedef std::deque< elem_ > cont_;
+</pre>
+
+ 
+
+ And here are the simulation parameters:
+ 
+
+
+
+<pre class="programlisting">// t is a random size element, with max size :
+const int elem_size = 100;
+// Number of loops over which exec time is summed
+const int n_loops = 1000 * 1000;
+</pre>
+
+ 
+
+ 
+
+ These are the results:
+ 
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ Library
+ 
+ </th>
+<th>
+ 
+ Call
+ 
+ </th>
+<th>
+ 
+ <code class="literal">n = 1</code>
+ 
+ </th>
+<th>
+ 
+ <code class="literal">n = 2</code>
+ 
+ </th>
+<th>
+ 
+ <code class="literal">n = 4</code>
+ 
+ </th>
+<th>
+ 
+ <code class="literal">n = 8</code>
+ 
+ </th>
+<th>
+ 
+ <code class="literal">n = 16</code>
+ 
+ </th>
+<th>
+ 
+ <code class="literal">n = 32</code>
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ STL
+ 
+ </td>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">cont.push_back( t[0] );...cont.push_back( t[n-1] );
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.094 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.364 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.756 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">1.737 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">3.852 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">7.807 s</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Boost.Assign 1.0
+</pre>
+
+ 
+ </td>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">list_of( t[0] )...( t[n-1] )
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <code class="literal">1.211 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">2.618 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">4.219 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">7.226 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">13.125 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">26.486 s</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Boost.Assign 1.0
+</pre>
+
+ 
+ </td>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">push_back( cont )( t[0] )...( t[n-1] )
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.251 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.726 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">1.709 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">3.780 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">7.869 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">16.117 s</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Boost.Assign 2.0
+</pre>
+
+ 
+ </td>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">csv_anon( t[0], ...,t[n-1] )
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <code class="literal">1.252 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">2.067 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">3.562 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">6.363 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">12.365 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">25.760 s</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Boost.Assign 2.0
+</pre>
+
+ 
+ </td>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">anon<T>(_nil)( t[0] )...( t[n-1] )
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <code class="literal">1.286 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">2.160 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">3.663 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">6.570 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">12.559 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">25.841 s</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Boost.Assign 2.0
+</pre>
+
+ 
+ </td>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">ref::assign_copy::csv_anon( t[0], ..., t[n-1] )
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <code class="literal">1e-06 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.003 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.003 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.008 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.016 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.030 s</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Boost.Assign 2.0
+</pre>
+
+ 
+ </td>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">ref::assign_copy::anon( t[0] )...( t[n-1] )
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.289 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.289 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.320 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.367 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.472 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.778 s</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Boost.Assign 2.0
+</pre>
+
+ 
+ </td>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">csv_put( cont )( t[0], ....,t[n-1] )
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.257 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.647 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">1.692 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">3.717 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">7.913 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">16.192 s</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Boost.Assign 2.0
+</pre>
+
+ 
+ </td>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">put( cont )( t[0] )...( t[n-1] )
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.260 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.716 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">1.748 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">3.856 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">8.040 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">16.462 s</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Boost.Assign 2.0
+</pre>
+
+ 
+ </td>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">cont | csv_put( t[0], ....,t[n-1] )
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.280 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.723 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">1.716 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">3.712 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">7.969 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">16.241 s</code>
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Boost.Assign 2.0
+</pre>
+
+ 
+ </td>
+<td>
+ 
+
+
+<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">cont | _put( t[0] )...( t[n-1] )
+</pre>
+
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.266 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">0.718 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">1.729 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">3.810 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">8.129 s</code>
+ 
+ </td>
+<td>
+ 
+ <code class="literal">16.949 s</code>
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+
+ See the <a class="link" href="index.html#boost_assign_v2.dummy.testing_platform" title="Testing platform">testing platform</a>
+ under which these results were obtained.
+ 
+<div class="note" title="Note"><table border="0" summary="Note">
+<tr>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../doc/html/images/note.png"></td>
+<th align="left">Note</th>
+</tr>
+<tr><td align="left" valign="top">
+ The call <code class="computeroutput">csv_put(
+ cont )( t[0], ....,t[n-1] )</code> and
+ its <code class="computeroutput">_put</code> analog, are part
+ of the implementation of <code class="computeroutput">_csv_put</code>
+ and <code class="computeroutput">_put</code>, respectively.
+ They are given here only to gauge the overhead between these two layers
+ of code.
+ </td></tr>
+</table></div>
+</div>
+<div class="section" title="Testing platform">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.dummy.testing_platform"></a><a class="link" href="index.html#boost_assign_v2.dummy.testing_platform" title="Testing platform"> Testing platform</a>
+</h3></div></div></div>
+
+ By default, the testing plaform used for efficiency tests is
+ 
+<div class="variablelist">
+
+<dl>
+<dt>Processor</dt>
+<dd>
+ 2.4 Ghz Intel Core 2 Duo
+ </dd>
+<dt>Memory</dt>
+<dd>
+ 4GB 1067 Mhz DDR3
+ </dd>
+<dt>OS</dt>
+<dd>
+ OS X 10.6.4
+ </dd>
+<dt>Compiler</dt>
+<dd>
+ gcc4.2
+ </dd>
+<dt>Optimization</dt>
+<dd>
+ Release | x86_64
+ </dd>
+</dl>
+</div>
+</div>
+<div class="section" title="Portability">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.dummy.portability"></a><a class="link" href="index.html#boost_assign_v2.dummy.portability" title="Portability">Portability</a>
+</h3></div></div></div>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
+ 
+ OS
+ 
+ </th>
+<th>
+ 
+ Compiler
+ 
+ </th>
+<th>
+ 
+ Option(s)
+ 
+ </th>
+<th>
+ 
+ Boost version(s)
+ 
+ </th>
+<th>
+ 
+ Result
+ 
+ </th>
+<th>
+ 
+ Log file
+ 
+ </th>
+</tr></thead>
+<tbody>
+<tr>
+<td>
+ 
+ OS X 10.6.4
+ 
+ </td>
+<td>
+ 
+ gcc4.2
+ 
+ </td>
+<td>
+ 
+ 
+ </td>
+<td>
+ 
+ <code class="literal">1.41</code>
+ 
+ </td>
+<td>
+ 
+ OK
+ 
+ </td>
+<td>
+ 
+ log_mac_gcc42
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ OS X 10.6.4
+ 
+ </td>
+<td>
+ 
+ gcc4.4 ( Fink
+ )
+ 
+ </td>
+<td>
+ 
+ C++0x
+ 
+ </td>
+<td>
+ 
+ <code class="literal">1.41</code>
+ 
+ </td>
+<td>
+ 
+ NA
+ 
+ </td>
+<td>
+ 
+ NA
+ 
+ </td>
+</tr>
+<tr>
+<td>
+ 
+ Ubuntu 9.10
+ 
+ </td>
+<td>
+ 
+ gcc4.4
+ 
+ </td>
+<td>
+ 
+ C++0x
+ 
+ </td>
+<td>
+ 
+ <code class="literal">1.43</code>
+ 
+ </td>
+<td>
+ 
+ NA
+ 
+ </td>
+<td>
+ 
+ NA
+ 
+ </td>
+</tr>
+</tbody>
+</table></div>
+</div>
+<div class="section" title="Dependencies">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.dummy.dependencies"></a><a class="link" href="index.html#boost_assign_v2.dummy.dependencies" title="Dependencies">Dependencies</a>
+</h3></div></div></div>
+
+ These must be in the search path:
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ This directory,
+ which contains copies of files that were previously in the Vault, for chaining,
+ by RangeEx
+</li>
+<li class="listitem">
+ This directory
+ containing <boost/mpl/detail/variadic.vector.hpp>
+ </li>
+</ul></div>
+</div>
+<div class="section" title="Change log">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.dummy.change_log"></a><a class="link" href="index.html#boost_assign_v2.dummy.change_log" title="Change log">Change log</a>
+</h3></div></div></div>
+<div class="toc"><dl>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__">[Proposal
+ for] Upgrading from Boost v1.4x
+ : Boost.Assign 2.0</a></dt>
+<dd><dl>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.the_new_organization">The
+ new organization</a></dt>
+<dt>Rationale</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.the_new_interface">The
+ new interface</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.code_reuse">Code
+ reuse</a></dt>
+</dl></dd>
+</dl></div>
+<div class="section" title="[Proposal for] Upgrading from Boost v1.4x : Boost.Assign 2.0">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__"></a><a class="link" href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__" title="[Proposal for] Upgrading from Boost v1.4x : Boost.Assign 2.0">[Proposal
+ for] Upgrading from Boost v1.4x
+ : Boost.Assign 2.0</a>
+</h4></div></div></div>
+<div class="toc"><dl>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.the_new_organization">The
+ new organization</a></dt>
+<dt>Rationale</dt>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.the_new_interface">The
+ new interface</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.code_reuse">Code
+ reuse</a></dt>
+</dl></div>
+<div class="section" title="The new organization">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.the_new_organization"></a><a class="link" href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.the_new_organization" title="The new organization">The
+ new organization</a>
+</h5></div></div></div>
+
+ The new library lives in boost/assign/v2 and its functionality is defined
+ in this namespace:
+ 
+
+
+
+<pre class="programlisting">using namespace boost::assign::v2;
+</pre>
+
+ 
+
+ The latest version prior to Boost.Assign 2.0 will continue to be supported
+ in Boost to allow backward
+ compatibility.
+ 
+</div>
+<div class="section" title="Rationale">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.rationale"></a><a class="link" href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.rationale" title="Rationale">Rationale</a>
+</h5></div></div></div>
+
+ There are two parts to this upgrade:
+ 
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+ Entirely new features, notably <a class="link" href="index.html#boost_assign_v2.dummy.ug.ref_anon" title="Anonymous container of references">anonymous
+ container of references</a>, and extended (RangeEx) methods for
+ <a class="link" href="index.html#boost_assign_v2.dummy.ug.chain" title="Adaptor _chain">chaining ranges</a>,
+ were already the subject of a mini-review.
+ </li>
+<li class="listitem">
+ A complete overhaul of the existing features.
+ </li>
+</ol></div>
+
+ The initial motivation for the overhaul is that thanks to the mini-review,
+ it was apparent that the new and old features lacked homogeneity in their
+ interface and that some newly introduced features, such as <code class="computeroutput">csv</code> functions (see below), had received
+ sufficient interest to warrant their generalization throughout the rest
+ of the library.
+ 
+
+ Part of the overhaul is simply a repackaging of the old code with an
+ emphasis on code-reuse and decoupling, but a fairly different interface
+ has emerged as a result (see below). The other part comes about by exploiting
+ spillovers from some of the new features, <a class="link" href="index.html#boost_assign_v2.dummy.ug.ref_anon" title="Anonymous container of references">anynomous
+ container of references</a>, to the ones we took on to revamp, resulting,
+ notably, in the <a class="link" href="index.html#boost_assign_v2.dummy.ug.put" title="Adaptors _csv_put and _put"><code class="computeroutput">_put</code> adaptor</a>. In this case,
+ the container of references serves as a cost-efficient buffer on the
+ right hand side of <code class="computeroutput">operator|</code>.
+ 
+</div>
+<div class="section" title="The new interface">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.the_new_interface"></a><a class="link" href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.the_new_interface" title="The new interface">The
+ new interface</a>
+</h5></div></div></div>
+
+ We can break down the new structure into at least two components:
+ 
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+ Whereas the user interacted with Boost.Assign 1.0 through idiomatic
+ operators (say <code class="computeroutput">+=</code>), Boost.Assign
+ 2.0 only uses two, <code class="computeroutput">operator|</code> and <code class="computeroutput">operator%</code>, in a way that is consistent across
+ different tools:
+ <div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+<code class="computeroutput">operator|</code>
+ expresses composable adaptors, an idea originating with <a href="http://www.boost.org/doc/libs/1_44_0/libs/range/doc/html/range/reference/adaptors.html" target="_top">range
+ adaptors</a>. Here, the result is either a (also) different
+ type of range or the container passed as an input, but in a new
+ state. See, for example, the synopsis of <a class="link" href="index.html#boost_assign_v2.dummy.ug.put_range" title="Adaptor _put_range">_put_range</a>
+</li>
+<li class="listitem">
+ Traits take care of making certain decisions about the implementation.
+ These choices, however, can be overriden by passing parameters
+ with <code class="computeroutput">operator%</code>.
+ See, for example, the synopsis of the <a class="link" href="index.html#boost_assign_v2.dummy.ug.put" title="Adaptors _csv_put and _put"><code class="computeroutput">_put</code> adaptor</a>
+</li>
+</ul></div>
+</li>
+<li class="listitem">
+ Many tools come in two flavors : as a functor that forwards, say, to
+ a constructor, or as functions, identified by suffix <code class="computeroutput">csv</code>, oveloaded on the number of arguments.
+ This dichotomy should be quite obvious from looking at the synopsis
+ of, for example, of <a class="link" href="index.html#boost_assign_v2.dummy.ug.anon" title="Anonymous container of values">anonymous
+ container of values</a>
+</li>
+</ol></div>
+
+ An issue that was touched upon during the mini-review
+ is that of creating an empty container. The custom in Boost.Assign 1.0
+ was to reserve the nullary <code class="computeroutput">operator()()</code> for default constructing a value,
+ for example, <code class="computeroutput">list_of<T>( x
+ )()( z )</code>.
+ Some felt, however, that <code class="computeroutput">list_of<T>()</code>
+ should return an empty container. To resolve this dilemma, Boost.Assign
+ 2.0 keeps the old convention, but creates a new one for expressing the
+ initialization of an empty container. Since <code class="computeroutput">list_of()</code> is now <code class="computeroutput">anon()</code>, it is,
+
+<pre class="programlisting">anon<T>( _nil );
+</pre>
+
+ The same applies to the <code class="computeroutput">csv</code>
+ form, and <a class="link" href="index.html#boost_assign_v2.dummy.ug.ref_anon" title="Anonymous container of references">anonymous
+ container of references</a>.
+ 
+
+ Note that the function <code class="computeroutput">list_of()</code> was renamed to <code class="computeroutput">anon()</code> for the following reasons: a) <code class="computeroutput">list_of</code> evoques a particular data-structure
+ that, in fact, is not the underlying one, which is a <code class="computeroutput">std::deque<></code>.b) In the previous documentation
+ the result of <code class="computeroutput">list_of</code>
+ was referred to as an anon-ymous container. The new name is therefore
+ consistent with this practice.
+ 
+</div>
+<div class="section" title="Code reuse">
+<div class="titlepage"><div><div><h5 class="title">
+<a name="boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.code_reuse"></a><a class="link" href="index.html#boost_assign_v2.dummy.change_log.__proposal_for___upgrading_from___boost___v1_4x_____boost_assign_v2__.code_reuse" title="Code reuse">Code
+ reuse</a>
+</h5></div></div></div>
+
+ The structure of Boost.Assign 1.0 is similar to that of Boost.Assign
+ 2.0 if one looks at low level. At the high level, explaining the evolution
+ from one to the other is arduous task so we will only touch on a few
+ items.
+ 
+
+ List inserters in Boost.Assign 1.0, such as the
+ free functions <code class="computeroutput">push_back()</code>, and <code class="computeroutput">list_of()</code> now have counterparts, the <a class="link" href="index.html#boost_assign_v2.dummy.ug.put" title="Adaptors _csv_put and _put"><code class="computeroutput">put</code> adaptor</a> and <code class="computeroutput">anon()</code>,
+ respectively, that now share a significant proportion of common code
+ expressed by a crtp
+ class. Already, <code class="computeroutput">anon()</code> can now work with any <a class="link" href="index.html#boost_assign_v2.dummy.ug.put.std_modifier" title="Standard modifier">modifier</a>,
+ whereas previously <code class="computeroutput">push_back()</code> was the default and only implementation.
+ 
+
+ Moreover, modifiers are now defined outside the crtp
+ class, the latter only keeping a (compile time) tag specifying which
+ modifier to forward to. This makes it easy to develop new ones, besides
+ the standard ones (e.g. <code class="computeroutput">push_back()</code>), of course, as they are already defined.
+ One example of a non-standard modifier is the modifier <a class="link" href="index.html#boost_assign_v2.dummy.ug.put.ext_func.repeat" title="Repeating an argument"><code class="computeroutput">_repeat</code></a>.
+ 
+
+ The second dimension of the new framework is <a class="link" href="index.html#boost_assign_v2.dummy.ug.put.arg_forwarding" title="Argument forwarding">argument
+ forwarding</a>, which was already present, for example, as part of
+ <code class="computeroutput">list_of()</code>.
+ What is entirely new, is that a traits mecanism takes care of deciding
+ which modifier-functor pair to use. As a result, passing a key and data
+ as two arguments (as opposed to pairing them first with <code class="computeroutput">std::pair<></code>)
+ to a <code class="computeroutput">std::map<></code>
+ works seamlessly, as illustrated <a class="link" href="index.html#boost_assign_v2.dummy.ug.put.arg_forwarding.auto" title="Automatic deduction">here</a>,
+ whereas previously, a dedicated function was needed, <code class="computeroutput">map_list_of()</code>.
+ 
+
+ Again, we can override the default choices by passing as many parameters
+ as necessary with <code class="computeroutput">operator%</code>. A complex example is given <a class="link" href="index.html#boost_assign_v2.dummy.ug.put.test_knowledge" title="Test your knowledge">here</a>.
+ 
+
+ Pointer containers required three seperated implementations, <code class="computeroutput">ptr_list_of()</code>,
+ <code class="computeroutput">ptr_map_insert()</code>,
+ and <code class="computeroutput">ptr_map_list_of()</code>
+ whereas now they are integrated in the new framewok, requiring few lines
+ of extra-code to accomodate them, and work seamlessly with the same interface.
+ TODO make sure the old functionality is covered by the new one.
+ 
+
+ On the topic of <a class="link" href="index.html#boost_assign_v2.dummy.ug.conversion" title="Conversion">conversion</a>,
+ the functionality that allowed to convert the result of <code class="computeroutput">list_of()</code>
+ to an arbitrary container is now a free function. Using it as a standalone
+ is, in itself, an advantage, but also, it is now integrated into several
+ objects defined in this library.
+ 
+</div>
+</div>
+</div>
+<div class="section" title="Support">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.dummy.support"></a><a class="link" href="index.html#boost_assign_v2.dummy.support" title="Support">Support</a>
+</h3></div></div></div>
+
+ For support, post to the <a href="http://www.boost.org/community/groups.html#users" target="_top">Boost
+ Users Mailing List</a>, and CC TO
+ and <a href="mailto:erDOTciDOT2020ATgmailDOTcom" target="_top">ER</a>.
+ 
+</div>
+<div class="section" title="History and acknowledgement">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.dummy.history_and_acknowledgement"></a><a class="link" href="index.html#boost_assign_v2.dummy.history_and_acknowledgement" title="History and acknowledgement">History
+ and acknowledgement</a>
+</h3></div></div></div>
+<div class="toc"><dl>
+<dt><a href="index.html#boost_assign_v2.dummy.history_and_acknowledgement.__boost_assign_v1__">Boost.Assign
+ 1.0</a></dt>
+<dt><a href="index.html#boost_assign_v2.dummy.history_and_acknowledgement.__boost_assign_v2___">Boost.Assign
+ 2.0 </a></dt>
+</dl></div>
+<div class="section" title="Boost.Assign 1.0">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.dummy.history_and_acknowledgement.__boost_assign_v1__"></a><a class="link" href="index.html#boost_assign_v2.dummy.history_and_acknowledgement.__boost_assign_v1__" title="Boost.Assign 1.0">Boost.Assign
+ 1.0</a>
+</h4></div></div></div>
+
+ The idea for an assignment/initialization library is not new. The functionality
+ of this library resembles Leor Zolman's STL Container Initialization Library
+ a great deal, but it does not rely on string parsing to achieve its goals.
+ 
+
+ Special thanks go to
+ 
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ Leor Zolman for our many discussion that eventually led to this library.
+ </li>
+<li class="listitem">
+ Tom Brinkman for being review manager.
+ </li>
+<li class="listitem">
+ Joaquín Muñoz for vc6/vc7 portability.
+ </li>
+<li class="listitem">
+ Pavel Vozenilek for his countless suggestions, improvements and portability
+ fixes.
+ </li>
+<li class="listitem">
+ Rene Rivera for Code Warrior portability.
+ </li>
+</ul></div>
+</div>
+<div class="section" title="Boost.Assign 2.0">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="boost_assign_v2.dummy.history_and_acknowledgement.__boost_assign_v2___"></a><a class="link" href="index.html#boost_assign_v2.dummy.history_and_acknowledgement.__boost_assign_v2___" title="Boost.Assign 2.0">Boost.Assign
+ 2.0 </a>
+</h4></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+ Manuel Peinado Gallego identified the need for an anonymous container
+ of references, and provided valuable advice throughout the early development
+ of Boost.Assign 2.0, such as proposing a design
+ that laid the foundation for <a class="link" href="index.html#boost_assign_v2.dummy.ug.chain" title="Adaptor _chain">chaining</a>.
+ </li></ul></div>
+</div>
+</div>
+<div class="section" title="Bibliography">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_assign_v2.dummy.bibliography"></a><a class="link" href="index.html#boost_assign_v2.dummy.bibliography" title="Bibliography">Bibliography</a>
+</h3></div></div></div>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ Scott. Meyers, "More Effective C++", Item 7, Addison Wesley,
+ 1996
+ </li>
+<li class="listitem">
+ K. Czarnecki and U.W. Eisenecker, "Generative programming", Addison-Wesley,
+ 2000
+ </li>
+<li class="listitem">Blitz</li>
+<li class="listitem">
+ Gabriel Dos Reis and Bjarne Stroustrup, <a href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1509.pdf" target="_top">Generalized
+ Initializer Lists</a>, 2003
+ </li>
+<li class="listitem">
+ Abrahams, David and Gurtovoy, Aleksey, <a href="http://portal.acm.org/citation.cfm?id=1044941#" target="_top">C++
+ Template Metaprogramming: Concepts, Tools, and Techniques from Boost and
+ Beyond (C++ in Depth Series)</a>, 2004, Addison-Wesley Professional.
+ </li>
+</ul></div>
+</div>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left">Last revised: November 12, 2010 at 17:18:46 GMT</td>
+<td align="right"><div class="copyright-footer"></div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav"></div>
+</body>
+</html>

Next message: erwann.rogard_at_[hidden]: "[Boost-commit] svn:boost r66546 - sandbox/statistics/support/libs/assign/v2/doc"
Previous message: erwann.rogard_at_[hidden]: "[Boost-commit] svn:boost r66544 - sandbox/statistics/support/libs/assign/v2/doc/html"

Date view	Thread view	Subject view	Author view

Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk