Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r82487 - in branches/release/libs/range: . doc doc/html doc/html/range/headers doc/html/range/reference/adaptors doc/html/range/reference/adaptors/reference doc/html/range/reference/algorithms/heap doc/html/range/reference/algorithms/numeric doc/html/range/reference/extending/method_3 doc/reference doc/reference/adaptors doc/reference/adaptors/examples doc/reference/algorithm doc/reference/numeric test test/adaptor_test
From: zeratul976_at_[hidden]
Date: 2013-01-14 04:19:42

Author: nathanridge
Date: 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
New Revision: 82487
URL: http://svn.boost.org/trac/boost/changeset/82487

Log:
[range] Merge documentation fixes and minor refactoring of docs (refs #5160; refs #5314; refs #5440; refs #5775; refs #6212; refs #7585; refs #7843; refs #7866).
Added:
   branches/release/libs/range/test/adaptor_test/tokenized_example.cpp
      - copied unchanged from r82486, /trunk/libs/range/test/adaptor_test/tokenized_example.cpp
Removed:
   branches/release/libs/range/doc/reference/adaptors/examples/adjacent_filtered.cpp
   branches/release/libs/range/doc/reference/adaptors/examples/copied.cpp
   branches/release/libs/range/doc/reference/adaptors/examples/filtered.cpp
   branches/release/libs/range/doc/reference/adaptors/examples/indexed.cpp
   branches/release/libs/range/doc/reference/adaptors/examples/map_keys.cpp
   branches/release/libs/range/doc/reference/adaptors/examples/map_values.cpp
   branches/release/libs/range/doc/reference/adaptors/examples/replaced.cpp
   branches/release/libs/range/doc/reference/adaptors/examples/replaced_if.cpp
   branches/release/libs/range/doc/reference/adaptors/examples/reversed.cpp
   branches/release/libs/range/doc/reference/adaptors/examples/sliced.cpp
   branches/release/libs/range/doc/reference/adaptors/examples/strided.cpp
   branches/release/libs/range/doc/reference/adaptors/examples/tokenized.cpp
   branches/release/libs/range/doc/reference/adaptors/examples/transformed.cpp
   branches/release/libs/range/doc/reference/adaptors/examples/uniqued.cpp
Properties modified:
   branches/release/libs/range/ (props changed)
Text files modified:
   branches/release/libs/range/doc/headers.qbk | 2
   branches/release/libs/range/doc/html/index.html | 2
   branches/release/libs/range/doc/html/range/headers/general.html | 2
   branches/release/libs/range/doc/html/range/reference/adaptors/introduction.html | 2
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html | 4
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/copied.html | 4
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/filtered.html | 6 +
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/indexed.html | 28 +--------
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/indirected.html | 4
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html | 4
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_values.html | 4
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced.html | 4
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html | 4
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/reversed.html | 6 +-
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/sliced.html | 4
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/strided.html | 4
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html | 45 ++++++++++++++++
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/transformed.html | 4
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/type_erased.html | 10 +-
   branches/release/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html | 8 +-
   branches/release/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html | 4
   branches/release/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html | 3
   branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html | 8 ++
   branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html | 31 ++--------
   branches/release/libs/range/doc/reference/adaptors.qbk | 2
   branches/release/libs/range/doc/reference/adaptors/adjacent_filtered.qbk | 28 +---------
   branches/release/libs/range/doc/reference/adaptors/copied.qbk | 27 +--------
   branches/release/libs/range/doc/reference/adaptors/filtered.qbk | 30 +----------
   branches/release/libs/range/doc/reference/adaptors/indexed.qbk | 63 +----------------------
   branches/release/libs/range/doc/reference/adaptors/indirected.qbk | 28 +---------
   branches/release/libs/range/doc/reference/adaptors/map_keys.qbk | 29 +---------
   branches/release/libs/range/doc/reference/adaptors/map_values.qbk | 29 +---------
   branches/release/libs/range/doc/reference/adaptors/replaced.qbk | 27 +--------
   branches/release/libs/range/doc/reference/adaptors/replaced_if.qbk | 32 +----------
   branches/release/libs/range/doc/reference/adaptors/reversed.qbk | 27 +--------
   branches/release/libs/range/doc/reference/adaptors/sliced.qbk | 27 +--------
   branches/release/libs/range/doc/reference/adaptors/strided.qbk | 27 +--------
   branches/release/libs/range/doc/reference/adaptors/tokenized.qbk | 18 ++++++
   branches/release/libs/range/doc/reference/adaptors/transformed.qbk | 33 +-----------
   branches/release/libs/range/doc/reference/adaptors/type_erased.qbk | 98 ++----------------------------------
   branches/release/libs/range/doc/reference/adaptors/uniqued.qbk | 25 +--------
   branches/release/libs/range/doc/reference/algorithm/pop_heap.qbk | 2
   branches/release/libs/range/doc/reference/extending.qbk | 12 ++-
   branches/release/libs/range/doc/reference/numeric/inner_product.qbk | 3
   branches/release/libs/range/test/Jamfile.v2 | 18 -----
   branches/release/libs/range/test/adaptor_test/adjacent_filtered_example.cpp | 51 ++++++++++--------
   branches/release/libs/range/test/adaptor_test/copied_example.cpp | 44 +++++++++-------
   branches/release/libs/range/test/adaptor_test/filtered_example.cpp | 63 +++++++++++++----------
   branches/release/libs/range/test/adaptor_test/indexed_example.cpp | 107 +++++++++++++++++++++------------------
   branches/release/libs/range/test/adaptor_test/indirected_example.cpp | 56 +++++++++++---------
   branches/release/libs/range/test/adaptor_test/map_keys_example.cpp | 54 +++++++++++--------
   branches/release/libs/range/test/adaptor_test/map_values_example.cpp | 54 +++++++++++--------
   branches/release/libs/range/test/adaptor_test/replaced_example.cpp | 52 ++++++++++--------
   branches/release/libs/range/test/adaptor_test/replaced_if_example.cpp | 63 +++++++++++++----------
   branches/release/libs/range/test/adaptor_test/reversed_example.cpp | 46 +++++++++-------
   branches/release/libs/range/test/adaptor_test/sliced_example.cpp | 52 ++++++++++--------
   branches/release/libs/range/test/adaptor_test/strided_example.cpp | 52 ++++++++++--------
   branches/release/libs/range/test/adaptor_test/transformed_example.cpp | 66 +++++++++++++----------
   branches/release/libs/range/test/adaptor_test/type_erased_example.cpp | 13 ++++
   branches/release/libs/range/test/adaptor_test/uniqued_example.cpp | 51 ++++++++++--------
   60 files changed, 656 insertions(+), 950 deletions(-)

Modified: branches/release/libs/range/doc/headers.qbk
==============================================================================
--- branches/release/libs/range/doc/headers.qbk (original)
+++ branches/release/libs/range/doc/headers.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,7 +8,7 @@
[section:general General]
[table
 [[Header ] [Includes ] [Related Concept ]]
- [[`<boost/range.hpp>` ] [everything from Boost.Range version 1 (Boost versions 1.42 and below). Includes the core range functions and metafunctinos, but excludes Range Adaptors and Range Algorithms. ] [- ]]
+ [[`<boost/range.hpp>` ] [everything from Boost.Range version 1 (Boost versions 1.42 and below). Includes the core range functions and metafunctions, but excludes Range Adaptors and Range Algorithms. ] [- ]]
 [[`<boost/range/metafunctions.hpp>` ] [every metafunction ] [- ]]
 [[`<boost/range/functions.hpp>` ] [every function ] [- ]]
 [[`<boost/range/value_type.hpp>` ] [__range_value__ ] [__single_pass_range__ ]]

Modified: branches/release/libs/range/doc/html/index.html
==============================================================================
--- branches/release/libs/range/doc/html/index.html (original)
+++ branches/release/libs/range/doc/html/index.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -147,7 +147,7 @@

</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: December 13, 2012 at 06:53:49 GMT</td>
+<td align="left">Last revised: January 14, 2013 at 08:50:06 GMT</td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

Modified: branches/release/libs/range/doc/html/range/headers/general.html
==============================================================================
--- branches/release/libs/range/doc/html/range/headers/general.html (original)
+++ branches/release/libs/range/doc/html/range/headers/general.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -59,7 +59,7 @@
<td>
 
 everything from Boost.Range version 1 (Boost versions 1.42 and
- below). Includes the core range functions and metafunctinos, but
+ below). Includes the core range functions and metafunctions, but
 excludes Range Adaptors and Range Algorithms.
 
 </td>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/introduction.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/introduction.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/introduction.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -204,7 +204,7 @@


<pre class="programlisting">std::vector<int> vec;
-boost::replace_copy_if( rng, std::back_inserter(vec), pred );
+boost::replace_copy_if( rng, std::back_inserter(vec), pred, new_value );
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -112,7 +112,7 @@
<pre class="programlisting">#include <boost/range/adaptor/adjacent_filtered.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <functional>
#include <iostream>
#include <vector>
@@ -138,7 +138,7 @@

This would produce the output:

-<pre class="programlisting">1,2,3,4,5,6
+<pre class="programlisting">1,2,3,4,5,6,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/copied.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/copied.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/copied.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -109,7 +109,7 @@
<pre class="programlisting">#include <boost/range/adaptor/copied.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

@@ -134,7 +134,7 @@

This would produce the output:

-<pre class="programlisting">2,3,4,5
+<pre class="programlisting">2,3,4,5,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/filtered.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/filtered.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/filtered.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -112,7 +112,7 @@
<pre class="programlisting">#include <boost/range/adaptor/filtered.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

@@ -132,6 +132,8 @@
 boost::copy(
 input | filtered(is_even()),
 std::ostream_iterator<int>(std::cout, ","));
+
+ return 0;
}
</pre>

@@ -140,7 +142,7 @@

 This would produce the output:

-<pre class="programlisting">2,4,6,8
+<pre class="programlisting">2,4,6,8,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/indexed.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/indexed.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/indexed.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -55,7 +55,7 @@
<td>
 
 <code class="computeroutput">rng |
- boost::adaptors::indexed</code>
+ boost::adaptors::indexed(start_index)</code>
 
 </td>
</tr>
@@ -67,7 +67,8 @@
 </td>
<td>
 
- <code class="computeroutput">boost::adaptors::index(rng)</code>
+ <code class="computeroutput">boost::adaptors::index(rng,
+ start_index)</code>
 
 </td>
</tr>
@@ -104,7 +105,7 @@
<pre class="programlisting">#include <boost/range/adaptor/indexed.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

@@ -123,27 +124,6 @@
 display_element_and_index(boost::begin(rng), boost::end(rng));
}

-template<class Iterator1, class Iterator2>
-void check_element_and_index(
- Iterator1 test_first,
- Iterator1 test_last,
- Iterator2 reference_first,
- Iterator2 reference_last)
-{
- BOOST_CHECK_EQUAL( std::distance(test_first, test_last),
- std::distance(reference_first, reference_last) );
-
- int reference_index = 0;
-
- Iterator1 test_it = test_first;
- Iterator2 reference_it = reference_first;
- for (; test_it != test_last; ++test_it, ++reference_it, ++reference_index)
- {
- BOOST_CHECK_EQUAL( *test_it, *reference_it );
- BOOST_CHECK_EQUAL( test_it.index(), reference_index );
- }
-}
-
int main(int argc, const char* argv[])
{
 using namespace boost::assign;

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/indirected.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/indirected.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/indirected.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -108,7 +108,7 @@
<pre class="programlisting">#include <boost/range/adaptor/indirected.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/shared_ptr.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

@@ -134,7 +134,7 @@

This would produce the output:

-<pre class="programlisting">0,1,2,3,4,5,6,7,8,9
+<pre class="programlisting">0,1,2,3,4,5,6,7,8,9,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -107,7 +107,7 @@
<pre class="programlisting">#include <boost/range/adaptor/map.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <map>
#include <vector>
@@ -134,7 +134,7 @@

This would produce the output:

-<pre class="programlisting">0,1,2,3,4,5,6,7,8,9
+<pre class="programlisting">0,1,2,3,4,5,6,7,8,9,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_values.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_values.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_values.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -109,7 +109,7 @@
<pre class="programlisting">#include <boost/range/adaptor/map.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <map>
#include <vector>
@@ -136,7 +136,7 @@

This would produce the output:

-<pre class="programlisting">0,10,20,30,40,50,60,70,80,90
+<pre class="programlisting">0,10,20,30,40,50,60,70,80,90,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -125,7 +125,7 @@
<pre class="programlisting">#include <boost/range/adaptor/replaced.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

@@ -150,7 +150,7 @@

This would produce the output:

-<pre class="programlisting">1,10,3,10,5,10,7,10,9
+<pre class="programlisting">1,10,3,10,5,10,7,10,9,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -121,7 +121,7 @@
<pre class="programlisting">#include <boost/range/adaptor/replaced_if.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

@@ -151,7 +151,7 @@

This would produce the output:

-<pre class="programlisting">1,10,3,10,5,10,7,10,9
+<pre class="programlisting">1,10,3,10,5,10,7,10,9,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/reversed.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/reversed.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/reversed.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -100,11 +100,11 @@
<pre class="programlisting">#include <boost/range/adaptor/reversed.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

-void reversed_example_test()
+int main(int argc, const char* argv[])
{
 using namespace boost::adaptors;
 using namespace boost::assign;
@@ -125,7 +125,7 @@

 This would produce the output:

-<pre class="programlisting">9,8,7,6,5,4,3,2,1
+<pre class="programlisting">9,8,7,6,5,4,3,2,1,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/sliced.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/sliced.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/sliced.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -110,7 +110,7 @@
<pre class="programlisting">#include <boost/range/adaptor/sliced.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

@@ -135,7 +135,7 @@

This would produce the output:

-<pre class="programlisting">3,4,5
+<pre class="programlisting">3,4,5,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/strided.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/strided.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/strided.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -102,7 +102,7 @@
<pre class="programlisting">#include <boost/range/adaptor/strided.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

@@ -127,7 +127,7 @@

This would produce the output:

-<pre class="programlisting">1,3,5,7,9
+<pre class="programlisting">1,3,5,7,9,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -26,6 +26,7 @@
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.tokenized"></a><a class="link" href="tokenized.html" title="tokenized">tokenized</a>
</h5></div></div></div>
+<div class="toc"><dl><dt>tokenized_example</dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -134,6 +135,50 @@
Access Range</a>
</li>
</ul></div>
+<div class="section range_reference_adaptors_reference_tokenized_tokenized_example">
+<div class="titlepage"><div><div><h6 class="title">
+<a name="range.reference.adaptors.reference.tokenized.tokenized_example"></a><a class="link" href="tokenized.html#range.reference.adaptors.reference.tokenized.tokenized_example" title="tokenized_example">tokenized_example</a>
+</h6></div></div></div>
+
+
+<pre class="programlisting">#include <boost/range/adaptor/tokenized.hpp>
+#include <boost/range/algorithm/copy.hpp>
+#include <boost/assign.hpp>
+#include <iterator>
+#include <iostream>
+#include <vector>
+
+int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+
+ typedef boost::sub_match< std::string::iterator > match_type;
+
+ std::string input = " a b c d e f g hijklmnopqrstuvwxyz";
+ boost::copy(
+ input | tokenized(boost::regex("\\w+")),
+ std::ostream_iterator<match_type>(std::cout, "\n"));
+
+ return 0;
+}
+</pre>
+
+ 
+</div>
+
+ This would produce the output:
+
+<pre class="programlisting">a
+b
+c
+d
+e
+f
+g
+hijklmnopqrstuvwxyz
+</pre>
+
+ 
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/transformed.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/transformed.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/transformed.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -113,7 +113,7 @@
<pre class="programlisting">#include <boost/range/adaptor/transformed.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

@@ -144,7 +144,7 @@

This would produce the output:

-<pre class="programlisting">2,4,6,8,10,12,14,16,18,20
+<pre class="programlisting">2,4,6,8,10,12,14,16,18,20,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/type_erased.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/type_erased.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/type_erased.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -190,7 +190,7 @@
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
#include <boost/foreach.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <list>
#include <vector>
@@ -279,10 +279,10 @@

This would produce the output:

-<pre class="programlisting">1,2,3,4,5
-6,7,8,9,10
-11,12,13,14,15
-11,12,13,14,15
+<pre class="programlisting">1,2,3,4,5,
+6,7,8,9,10,
+11,12,13,14,15,
+11,12,13,14,15,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -105,11 +105,11 @@
<pre class="programlisting">#include <boost/range/adaptor/uniqued.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

-void uniqued_example_test()
+int main(int argc, const char* argv[])
{
 using namespace boost::assign;
 using namespace boost::adaptors;
@@ -120,6 +120,8 @@
 boost::copy(
 input | uniqued,
 std::ostream_iterator<int>(std::cout, ","));
+
+ return 0;
}
</pre>

@@ -128,7 +130,7 @@

 This would produce the output:

-<pre class="programlisting">1,2,3,4,5,6
+<pre class="programlisting">1,2,3,4,5,6,
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -52,8 +52,8 @@
 </h6>

 <code class="computeroutput">pop_heap</code> removes the
- largest element from the heap. It is assumed that <code class="computeroutput">begin(rng), prior(end(rng))</code> is already a heap and that the element
- to be added is <code class="computeroutput">*prior(end(rng))</code>.
+ largest element from the heap. It is assumed that <code class="computeroutput">begin(rng), prior(end(rng))</code> is already a heap (and therefore the
+ largest element is <code class="computeroutput">*begin(rng)</code>).
 

 The ordering relationship is determined by using <code class="computeroutput">operator<</code> in the non-predicate versions, and

Modified: branches/release/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -47,7 +47,8 @@
 Value inner_product( const SinglePassRange1& rng1,
 const SinglePassRange2& rng2,
 Value init,
- BinaryOperation1 op1 );
+ BinaryOperation1 op1,
+ BinaryOperation2 op2 );
</pre>

Modified: branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -83,6 +83,14 @@
}
</pre>
</li>
+<li class="listitem">
+ Declare the adaptor itself (it is a variable of the tag type).
+<pre class="programlisting">namespace
+{
+ const detail::reverse_forwarder reversed = detail::reverse_forwarder();
+}
+</pre>
+ </li>
</ol></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>

Modified: branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -80,15 +80,8 @@
 </li>
<li class="listitem">
 Implement a holder class to hold the arguments required to construct
- the RangeAdaptor.
- </li>
-</ol></div>
-
- The holder combines multiple parameters into one that can be passed as
- the right operand of <code class="computeroutput">operator|()</code>.
- 
-
-
+ the RangeAdaptor. The holder combines multiple parameters into one
+ that can be passed as the right operand of <code class="computeroutput">operator|()</code>.
<pre class="programlisting">template<typename T>
class replace_holder : public boost::range_detail::holder2<T>
{
@@ -100,23 +93,15 @@
 void operator=(const replace_holder&);
};
</pre>
-
- 
-<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+ </li>
+<li class="listitem">
 Define an instance of the holder with the name of the adaptor
- </li></ol></div>
-
-
<pre class="programlisting">static boost::range_detail::forwarder2<replace_holder>
replaced = boost::range_detail::forwarder2<replace_holder>();
</pre>
-
- 
-<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+ </li>
+<li class="listitem">
 Define <code class="computeroutput">operator|</code>
- </li></ol></div>
-
-
<pre class="programlisting">template<typename SinglePassRange>
inline replace_range<SinglePassRange>
operator|(SinglePassRange& rng,
@@ -133,8 +118,8 @@
 return replace_range<const SinglePassRange>(rng, f.val1, f.val2);
}
</pre>
-
- 
+ </li>
+</ol></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>

Modified: branches/release/libs/range/doc/reference/adaptors.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -93,7 +93,7 @@

``
std::vector<int> vec;
-boost::replace_copy_if( rng, std::back_inserter(vec), pred );
+boost::replace_copy_if( rng, std::back_inserter(vec), pred, new_value );
``

With adaptors and algorithms we can express this as

Modified: branches/release/libs/range/doc/reference/adaptors/adjacent_filtered.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/adjacent_filtered.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/adjacent_filtered.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -19,35 +19,13 @@
* [*Returned Range Category:] The minimum of the range category of `rng` and __forward_range__

[section:adjacent_filtered_example adjacent_filtered example]
-``
-#include <boost/range/adaptor/adjacent_filtered.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <functional>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 1,1,2,2,2,3,4,5,6;
-
- boost::copy(
- input | adjacent_filtered(std::not_equal_to<int>()),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-``
+[import ../../../test/adaptor_test/adjacent_filtered_example.cpp]
+[adjacent_filtered_example]
[endsect]

This would produce the output:
``
-1,2,3,4,5,6
+1,2,3,4,5,6,
``
[endsect]

Modified: branches/release/libs/range/doc/reference/adaptors/copied.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/copied.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/copied.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -17,34 +17,13 @@
* [*Returned Range Category:] __random_access_range__

[section:copied_example copied example]
-``
-#include <boost/range/adaptor/copied.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9,10;
-
- boost::copy(
- input | copied(1, 5),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-``
+[import ../../../test/adaptor_test/copied_example.cpp]
+[copied_example]
[endsect]

This would produce the output:
``
-2,3,4,5
+2,3,4,5,
``
[endsect]

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/adjacent_filtered.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/adjacent_filtered.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,32 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/adjacent_filtered.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <functional>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 1,1,2,2,2,3,4,5,6;
-
- boost::copy(
- input | adjacent_filtered(std::not_equal_to<int>()),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/copied.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/copied.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,31 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/copied.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9,10;
-
- boost::copy(
- input | copied(1, 5),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/filtered.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/filtered.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,36 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/filtered.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct is_even
-{
- bool operator()(int x) const { return x % 2 == 0; }
-};
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9;
-
- boost::copy(
- input | filtered(is_even()),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/indexed.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/indexed.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,45 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/indexed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-template<typename Iterator>
-void display_element_and_index(Iterator first, Iterator last)
-{
- for (Iterator it = first; it != last; ++it)
- {
- std::cout << "Element = " << *it
- << " Index = " << it.index() << std::endl;
- }
-}
-
-template<typename SinglePassRange>
-void display_element_and_index(const SinglePassRange& rng)
-{
- display_element_and_index(boost::begin(rng), boost::end(rng));
-}
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 10,20,30,40,50,60,70,80,90;
-
- display_element_and_index( input | indexed(0) );
-
- return 0;
-}
-

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/map_keys.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/map_keys.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,33 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/map.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <map>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::map<int, int> input;
- for (int i = 0; i < 10; ++i)
- input.insert(std::make_pair(i, i * 10));
-
- boost::copy(
- input | map_keys,
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/map_values.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/map_values.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,33 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/map.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <map>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::map<int, int> input;
- for (int i = 0; i < 10; ++i)
- input.insert(std::make_pair(i, i * 10));
-
- boost::copy(
- input | map_values,
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/replaced.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/replaced.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,31 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/replaced.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,2,5,2,7,2,9;
-
- boost::copy(
- input | replaced(2, 10),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/replaced_if.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/replaced_if.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,35 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/replaced_if.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct is_even
-{
- bool operator()(int x) const { return x % 2 == 0; }
-};
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9;
-
- boost::copy(
- input | replaced_if(is_even(), 10),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/reversed.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/reversed.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,31 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/reversed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9;
-
- boost::copy(
- input | reversed,
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/sliced.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/sliced.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,31 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/sliced.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9;
-
- boost::copy(
- input | sliced(2, 5),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/strided.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/strided.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,31 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/strided.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9,10;
-
- boost::copy(
- input | strided(2),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/tokenized.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/tokenized.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,28 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/tokenized.hpp>
-#include <boost/range/algorithm_ext/push_back.hpp>
-#include <boost/assert.hpp>
-#include <algorithm>
-#include <string>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::adaptors;
-
- std::string input = " a b c d e f g hijklmnopqrstuvwxyz";
- std::vector< boost::sub_match< std::string::iterator > > result;
- boost::push_back(result, input | tokenized(boost::regex("\\b")));
-
- BOOST_ASSERT( boost::size(result) == 16u );
-
- return 0;
-}

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/transformed.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/transformed.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,37 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/transformed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct double_int
-{
- typedef int result_type;
- int operator()(int x) const { return x * 2; }
-};
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9,10;
-
- boost::copy(
- input | transformed(double_int()),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-

Deleted: branches/release/libs/range/doc/reference/adaptors/examples/uniqued.cpp
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/examples/uniqued.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
+++ (empty file)
@@ -1,31 +0,0 @@
-// Boost.Range library
-//
-// Copyright Thorsten Ottosen 2003-2004. Use, modification and
-// distribution is subject to 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)
-//
-// For more information, see http://www.boost.org/libs/range/
-//
-#include <boost/range/adaptor/uniqued.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 1,1,2,2,2,3,4,5,6;
-
- boost::copy(
- input | uniqued,
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-

Modified: branches/release/libs/range/doc/reference/adaptors/filtered.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/filtered.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/filtered.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -19,37 +19,13 @@
* [*Returned Range Category:] The minimum of the range category of `rng` and __bidirectional_range__

[section:filtered_example filtered example]
-``
-#include <boost/range/adaptor/filtered.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct is_even
-{
- bool operator()( int x ) const { return x % 2 == 0; }
-};
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9;
-
- boost::copy(
- input | filtered(is_even()),
- std::ostream_iterator<int>(std::cout, ","));
-}
-``
+[import ../../../test/adaptor_test/filtered_example.cpp]
+[filtered_example]
[endsect]

This would produce the output:
``
-2,4,6,8
+2,4,6,8,
``
[endsect]

Modified: branches/release/libs/range/doc/reference/adaptors/indexed.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/indexed.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/indexed.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -7,8 +7,8 @@

[table
[[Syntax] [Code]]
- [[Pipe] [`rng | boost::adaptors::indexed`]]
- [[Function] [`boost::adaptors::index(rng)`]]
+ [[Pipe] [`rng | boost::adaptors::indexed(start_index)`]]
+ [[Function] [`boost::adaptors::index(rng, start_index)`]]
]

* [*Returns:] A range adapted to return both the element and the associated index. The returned range consists of iterators that have in addition to the usual iterator member functions an `index()` member function that returns the appropriate index for the element in the sequence corresponding with the iterator.
@@ -17,63 +17,8 @@
* [*Returned Range Category:] The range category of `rng`

[section:indexed_example indexed example]
-``
-#include <boost/range/adaptor/indexed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-template<class Iterator>
-void display_element_and_index(Iterator first, Iterator last)
-{
- for (Iterator it = first; it != last; ++it)
- {
- std::cout << "Element = " << *it << " Index = " << it.index() << std::endl;
- }
-}
-
-template<class SinglePassRange>
-void display_element_and_index(const SinglePassRange& rng)
-{
- display_element_and_index(boost::begin(rng), boost::end(rng));
-}
-
-template<class Iterator1, class Iterator2>
-void check_element_and_index(
- Iterator1 test_first,
- Iterator1 test_last,
- Iterator2 reference_first,
- Iterator2 reference_last)
-{
- BOOST_CHECK_EQUAL( std::distance(test_first, test_last),
- std::distance(reference_first, reference_last) );
-
- int reference_index = 0;
-
- Iterator1 test_it = test_first;
- Iterator2 reference_it = reference_first;
- for (; test_it != test_last; ++test_it, ++reference_it, ++reference_index)
- {
- BOOST_CHECK_EQUAL( *test_it, *reference_it );
- BOOST_CHECK_EQUAL( test_it.index(), reference_index );
- }
-}
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 10,20,30,40,50,60,70,80,90;
-
- display_element_and_index( input | indexed(0) );
-
- return 0;
-}
-``
+[import ../../../test/adaptor_test/indexed_example.cpp]
+[indexed_example]
[endsect]

This would produce the output:

Modified: branches/release/libs/range/doc/reference/adaptors/indirected.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/indirected.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/indirected.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -18,35 +18,13 @@
* [*Returned Range Category:] The range category of `rng`

[section:indirected_example indirected example]
-``
-#include <boost/range/adaptor/indirected.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/shared_ptr.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::adaptors;
-
- std::vector<boost::shared_ptr<int> > input;
-
- for (int i = 0; i < 10; ++i)
- input.push_back(boost::shared_ptr<int>(new int(i)));
-
- boost::copy(
- input | indirected,
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-``
+[import ../../../test/adaptor_test/indirected_example.cpp]
+[indirected_example]
[endsect]

This would produce the output:
``
-0,1,2,3,4,5,6,7,8,9
+0,1,2,3,4,5,6,7,8,9,
``
[endsect]

Modified: branches/release/libs/range/doc/reference/adaptors/map_keys.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/map_keys.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/map_keys.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -18,36 +18,13 @@
* [*Returned Range Category:] The range category of `rng`.

[section:map_keys_example map_keys example]
-``
-#include <boost/range/adaptor/map.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <map>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::map<int,int> input;
- for (int i = 0; i < 10; ++i)
- input.insert(std::make_pair(i, i * 10));
-
- boost::copy(
- input | map_keys,
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-``
+[import ../../../test/adaptor_test/map_keys_example.cpp]
+[map_keys_example]
[endsect]

This would produce the output:
``
-0,1,2,3,4,5,6,7,8,9
+0,1,2,3,4,5,6,7,8,9,
``
[endsect]

Modified: branches/release/libs/range/doc/reference/adaptors/map_values.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/map_values.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/map_values.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -18,36 +18,13 @@
* [*Returned Range Category:] The range category of `rng`.

[section:map_values_example map_values example]
-``
-#include <boost/range/adaptor/map.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <map>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::map<int,int> input;
- for (int i = 0; i < 10; ++i)
- input.insert(std::make_pair(i, i * 10));
-
- boost::copy(
- input | map_values,
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-``
+[import ../../../test/adaptor_test/map_values_example.cpp]
+[map_values_example]
[endsect]

This would produce the output:
``
-0,10,20,30,40,50,60,70,80,90
+0,10,20,30,40,50,60,70,80,90,
``
[endsect]

Modified: branches/release/libs/range/doc/reference/adaptors/replaced.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/replaced.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/replaced.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -20,34 +20,13 @@
* [*Returned Range Category:] The range category of `rng`.

[section:replaced_example replaced example]
-``
-#include <boost/range/adaptor/replaced.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,2,5,2,7,2,9;
-
- boost::copy(
- input | replaced(2, 10),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-``
+[import ../../../test/adaptor_test/replaced_example.cpp]
+[replaced_example]
[endsect]

This would produce the output:
``
-1,10,3,10,5,10,7,10,9
+1,10,3,10,5,10,7,10,9,
``
[endsect]

Modified: branches/release/libs/range/doc/reference/adaptors/replaced_if.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/replaced_if.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/replaced_if.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -20,39 +20,13 @@
* [*Returned Range Category:] The range category of `rng`.

[section:replaced_if_example replaced_if example]
-``
-#include <boost/range/adaptor/replaced_if.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct is_even
-{
- bool operator()(int x) const { return x % 2 == 0; }
-};
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9;
-
- boost::copy(
- input | replaced_if(is_even(), 10),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-``
+[import ../../../test/adaptor_test/replaced_if_example.cpp]
+[replaced_if_example]
[endsect]

This would produce the output:
``
-1,10,3,10,5,10,7,10,9
+1,10,3,10,5,10,7,10,9,
``
[endsect]

Modified: branches/release/libs/range/doc/reference/adaptors/reversed.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/reversed.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/reversed.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -17,34 +17,13 @@
* [*Returned Range Category:] The range category of `rng`.

[section:reversed_example reversed example]
-``
-#include <boost/range/adaptor/reversed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-void reversed_example_test()
-{
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9;
-
- boost::copy(
- input | reversed,
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-``
+[import ../../../test/adaptor_test/reversed_example.cpp]
+[reversed_example]
[endsect]

This would produce the output:
``
-9,8,7,6,5,4,3,2,1
+9,8,7,6,5,4,3,2,1,
``
[endsect]

Modified: branches/release/libs/range/doc/reference/adaptors/sliced.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/sliced.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/sliced.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -18,34 +18,13 @@
* [*Returned Range Category:] __random_access_range__

[section:sliced_example sliced example]
-``
-#include <boost/range/adaptor/sliced.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9;
-
- boost::copy(
- input | sliced(2, 5),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-``
+[import ../../../test/adaptor_test/sliced_example.cpp]
+[sliced_example]
[endsect]

This would produce the output:
``
-3,4,5
+3,4,5,
``
[endsect]

Modified: branches/release/libs/range/doc/reference/adaptors/strided.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/strided.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/strided.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -17,34 +17,13 @@
* [*Returned Range Category:] The range category of `rng`.

[section:strided_example strided example]
-``
-#include <boost/range/adaptor/strided.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9,10;
-
- boost::copy(
- input | strided(2),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-``
+[import ../../../test/adaptor_test/strided_example.cpp]
+[strided_example]
[endsect]

This would produce the output:
``
-1,3,5,7,9
+1,3,5,7,9,
``
[endsect]

Modified: branches/release/libs/range/doc/reference/adaptors/tokenized.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/tokenized.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/tokenized.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -44,6 +44,24 @@
* [*Range Return Type:] `boost::tokenized_range<typeof(rng)>`
* [*Returned Range Category:] __random_access_range__

+[section:tokenized_example tokenized_example]
+[import ../../../test/adaptor_test/tokenized_example.cpp]
+[tokenized_example]
+[endsect]
+
+This would produce the output:
+``
+a
+b
+c
+d
+e
+f
+g
+hijklmnopqrstuvwxyz
+
+``
+
[endsect]

Modified: branches/release/libs/range/doc/reference/adaptors/transformed.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/transformed.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/transformed.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -19,40 +19,13 @@
* [*Returned Range Category:] The range category of `rng`.

[section:transformed_example transformed example]
-``
-#include <boost/range/adaptor/transformed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct double_int
-{
- typedef int result_type;
- int operator()(int x) const { return x * 2; }
-};
-
-int main(int argc, const char* argv[])
-{
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9,10;
-
- boost::copy(
- input | transformed(double_int()),
- std::ostream_iterator<int>(std::cout, ","));
-
- return 0;
-}
-``
+[import ../../../test/adaptor_test/transformed_example.cpp]
+[transformed_example]
[endsect]

This would produce the output:
``
-2,4,6,8,10,12,14,16,18,20
+2,4,6,8,10,12,14,16,18,20,
``
[endsect]

Modified: branches/release/libs/range/doc/reference/adaptors/type_erased.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/type_erased.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/type_erased.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -49,102 +49,16 @@
``

[section:type_erased_example type-erased example]
-``
-#include <boost/range/adaptor/type_erased.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <boost/foreach.hpp>
-#include <algorithm>
-#include <iostream>
-#include <list>
-#include <vector>
-
-// The client interface from an OO perspective merely requires a sequence
-// of integers that can be forward traversed
-typedef boost::any_range<
- int
- , boost::forward_traversal_tag
- , int
- , std::ptrdiff_t
-> integer_range;
-
-namespace server
-{
- void display_integers(const integer_range& rng)
- {
- boost::copy(rng,
- std::ostream_iterator<int>(std::cout, ","));
-
- std::cout << std::endl;
- }
-}
-
-namespace client
-{
- void run()
- {
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- // Under most conditions one would simply use an appropriate
- // any_range as a function parameter. The type_erased adaptor
- // is often superfluous. However because the type_erased
- // adaptor is applied to a range, we can use default template
- // arguments that are generated in conjunction with the
- // range type to which we are applying the adaptor.
-
- std::vector<int> input;
- input += 1,2,3,4,5;
-
- // Note that this call is to a non-template function
- server::display_integers(input);
-
- std::list<int> input2;
- input2 += 6,7,8,9,10;
-
- // Note that this call is to the same non-tempate function
- server::display_integers(input2);
-
- input2.clear();
- input2 += 11,12,13,14,15;
-
- // Calling using the adaptor looks like this:
- // Notice that here I have a type_erased that would be a
- // bidirectional_traversal_tag, but this is convertible
- // to the forward_traversal_tag equivalent hence this
- // works.
- server::display_integers(input2 | type_erased<>());
-
- // However we may simply wish to define an adaptor that
- // takes a range and makes it into an appropriate
- // forward_traversal any_range...
- typedef boost::adaptors::type_erased<
- boost::use_default
- , boost::forward_traversal_tag
- > type_erased_forward;
-
- // This adaptor can turn other containers with different
- // value_types and reference_types into the appropriate
- // any_range.
-
- server::display_integers(input2 | type_erased_forward());
- }
-}
-
-int main(int argc, const char* argv[])
-{
- client::run();
- return 0;
-}
-``
+[import ../../../test/adaptor_test/type_erased_example.cpp]
+[type_erased_example]
[endsect]

This would produce the output:
``
-1,2,3,4,5
-6,7,8,9,10
-11,12,13,14,15
-11,12,13,14,15
+1,2,3,4,5,
+6,7,8,9,10,
+11,12,13,14,15,
+11,12,13,14,15,
``
[endsect]

Modified: branches/release/libs/range/doc/reference/adaptors/uniqued.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/uniqued.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/uniqued.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -18,32 +18,13 @@
* [*Returned Range Category:] The minimum of the range concept of `rng` and __forward_range__.

[section:uniqued_example uniqued example]
-``
-#include <boost/range/adaptor/uniqued.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-void uniqued_example_test()
-{
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 1,1,2,2,2,3,4,5,6;
-
- boost::copy(
- input | uniqued,
- std::ostream_iterator<int>(std::cout, ","));
-}
-``
+[import ../../../test/adaptor_test/uniqued_example.cpp]
+[uniqued_example]
[endsect]

This would produce the output:
``
-1,2,3,4,5,6
+1,2,3,4,5,6,
``
[endsect]

Modified: branches/release/libs/range/doc/reference/algorithm/pop_heap.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/pop_heap.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/pop_heap.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -23,7 +23,7 @@

[heading Description]

-`pop_heap` removes the largest element from the heap. It is assumed that `begin(rng), prior(end(rng))` is already a heap and that the element to be added is `*prior(end(rng))`.
+`pop_heap` removes the largest element from the heap. It is assumed that `begin(rng), prior(end(rng))` is already a heap (and therefore the largest element is `*begin(rng)`).

The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.

Modified: branches/release/libs/range/doc/reference/extending.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/extending.qbk (original)
+++ branches/release/libs/range/doc/reference/extending.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -218,6 +218,14 @@
}
``

+# Declare the adaptor itself (it is a variable of the tag type).
+``
+namespace
+{
+ const detail::reverse_forwarder reversed = detail::reverse_forwarder();
+}
+``
+
[endsect]

[section:method_3_2 Method 3.2: Implement a Range Adaptor with arguments]
@@ -273,9 +281,7 @@
``

# Implement a holder class to hold the arguments required to construct the RangeAdaptor.
-
The holder combines multiple parameters into one that can be passed as the right operand of `operator|()`.
-
``
template<typename T>
class replace_holder : public boost::range_detail::holder2<T>
@@ -290,14 +296,12 @@
``

# Define an instance of the holder with the name of the adaptor
-
``
static boost::range_detail::forwarder2<replace_holder>
replaced = boost::range_detail::forwarder2<replace_holder>();
``

# Define `operator|`
-
``
template<typename SinglePassRange>
inline replace_range<SinglePassRange>

Modified: branches/release/libs/range/doc/reference/numeric/inner_product.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/numeric/inner_product.qbk (original)
+++ branches/release/libs/range/doc/reference/numeric/inner_product.qbk 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -23,7 +23,8 @@
     Value inner_product( const SinglePassRange1& rng1,
                          const SinglePassRange2& rng2,
                          Value init,
- BinaryOperation1 op1 );
+ BinaryOperation1 op1,
+ BinaryOperation2 op2 );
``

[heading Description]

Modified: branches/release/libs/range/test/Jamfile.v2
==============================================================================
--- branches/release/libs/range/test/Jamfile.v2 (original)
+++ branches/release/libs/range/test/Jamfile.v2 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -31,21 +31,6 @@
}

test-suite range :
- [ compile ../doc/reference/adaptors/examples/adjacent_filtered.cpp : : example_adjacent_filtered ]
- [ compile ../doc/reference/adaptors/examples/copied.cpp : : example_copied ]
- [ compile ../doc/reference/adaptors/examples/filtered.cpp : : example_filtered ]
- [ compile ../doc/reference/adaptors/examples/indexed.cpp : : example_indexed ]
- [ compile ../doc/reference/adaptors/examples/indirected.cpp : : example_indirected ]
- [ compile ../doc/reference/adaptors/examples/map_keys.cpp : : example_map_keys ]
- [ compile ../doc/reference/adaptors/examples/map_values.cpp : : example_map_values ]
- [ compile ../doc/reference/adaptors/examples/replaced.cpp : : example_replaced ]
- [ compile ../doc/reference/adaptors/examples/replaced_if.cpp : : example_replaced_if ]
- [ compile ../doc/reference/adaptors/examples/reversed.cpp : : example_reversed ]
- [ compile ../doc/reference/adaptors/examples/sliced.cpp : : example_sliced ]
- [ compile ../doc/reference/adaptors/examples/strided.cpp : : example_strided ]
- [ compile ../doc/reference/adaptors/examples/tokenized.cpp : : example_tokenized ]
- [ compile ../doc/reference/adaptors/examples/transformed.cpp : : example_transformed ]
- [ compile ../doc/reference/adaptors/examples/uniqued.cpp : : example_uniqued ]
         [ compile-fail compile_fail/iterator_range1.cpp ]
         [ range-test adaptor_test/adjacent_filtered ]
         [ range-test adaptor_test/copied ]
@@ -61,6 +46,7 @@
         [ range-test adaptor_test/strided2 ]
         [ range-test adaptor_test/tokenized ]
         [ range-test adaptor_test/transformed ]
+ [ range-test adaptor_test/type_erased ]
         [ range-test adaptor_test/uniqued ]
         [ range-test adaptor_test/adjacent_filtered_example ]
         [ range-test adaptor_test/copied_example ]
@@ -75,7 +61,7 @@
         [ range-test adaptor_test/sliced_example ]
         [ range-test adaptor_test/strided_example ]
         [ range-test adaptor_test/transformed_example ]
- [ range-test adaptor_test/type_erased ]
+ [ range-test adaptor_test/tokenized_example ]
         [ range-test adaptor_test/type_erased_example ]
         [ range-test adaptor_test/uniqued_example ]
         [ range-test algorithm_test/adjacent_find ]

Modified: branches/release/libs/range/test/adaptor_test/adjacent_filtered_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/adjacent_filtered_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/adjacent_filtered_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,14 +8,16 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[adjacent_filtered_example
#include <boost/range/adaptor/adjacent_filtered.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <functional>
#include <iostream>
#include <vector>

+//<-
#include <boost/range/algorithm_ext/push_back.hpp>

#include <boost/test/test_tools.hpp>
@@ -23,27 +25,32 @@

namespace
{
- void adjacent_filtered_example_test()
- {
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 1,1,2,2,2,3,4,5,6;
-
- boost::copy(
- input | adjacent_filtered(std::not_equal_to<int>()),
- std::ostream_iterator<int>(std::cout, ","));
-
- std::vector<int> reference;
- reference += 1,2,3,4,5,6;
-
- std::vector<int> test;
- boost::push_back(test, input | adjacent_filtered(std::not_equal_to<int>()));
-
- BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
- test.begin(), test.end() );
- }
+void adjacent_filtered_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;
+
+ std::vector<int> input;
+ input += 1,1,2,2,2,3,4,5,6;
+
+ boost::copy(
+ input | adjacent_filtered(std::not_equal_to<int>()),
+ std::ostream_iterator<int>(std::cout, ","));
+
+//= return 0;
+//=}
+//]
+ std::vector<int> reference;
+ reference += 1,2,3,4,5,6;
+
+ std::vector<int> test;
+ boost::push_back(test, input | adjacent_filtered(std::not_equal_to<int>()));
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ test.begin(), test.end() );
+}
}

boost::unit_test::test_suite*

Modified: branches/release/libs/range/test/adaptor_test/copied_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/copied_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/copied_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,13 +8,15 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[copied_example
#include <boost/range/adaptor/copied.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

+//<-
#include <boost/range/algorithm_ext/push_back.hpp>

#include <boost/test/test_tools.hpp>
@@ -22,28 +24,32 @@

namespace
{
- void copied_example_test()
- {
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9,10;
-
- boost::copy(
- input | copied(1, 5),
- std::ostream_iterator<int>(std::cout, ","));
+void copied_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;

+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9,10;

- std::vector<int> reference;
- reference += 2,3,4,5;
+ boost::copy(
+ input | copied(1, 5),
+ std::ostream_iterator<int>(std::cout, ","));
+
+//= return 0;
+//=}
+//]
+ std::vector<int> reference;
+ reference += 2,3,4,5;

- std::vector<int> test;
- boost::push_back(test, input | copied(1, 5));
+ std::vector<int> test;
+ boost::push_back(test, input | copied(1, 5));

- BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
- test.begin(), test.end() );
- }
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ test.begin(), test.end() );
+}
}

boost::unit_test::test_suite*

Modified: branches/release/libs/range/test/adaptor_test/filtered_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/filtered_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/filtered_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,13 +8,15 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[filtered_example
#include <boost/range/adaptor/filtered.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

+//<-
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

@@ -22,32 +24,39 @@

namespace
{
- struct is_even
- {
- bool operator()( int x ) const { return x % 2 == 0; }
- };
-
- void filtered_example_test()
- {
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9;
-
- boost::copy(
- input | filtered(is_even()),
- std::ostream_iterator<int>(std::cout, ","));
-
- std::vector<int> reference;
- reference += 2,4,6,8;
-
- std::vector<int> test;
- boost::push_back(test, input | filtered(is_even()));
-
- BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
- test.begin(), test.end() );
- }
+//->
+struct is_even
+{
+ bool operator()( int x ) const { return x % 2 == 0; }
+};
+
+//<-
+void filtered_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;
+
+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9;
+
+ boost::copy(
+ input | filtered(is_even()),
+ std::ostream_iterator<int>(std::cout, ","));
+
+//= return 0;
+//=}
+//]
+ std::vector<int> reference;
+ reference += 2,4,6,8;
+
+ std::vector<int> test;
+ boost::push_back(test, input | filtered(is_even()));
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ test.begin(), test.end() );
+}
}

boost::unit_test::test_suite*

Modified: branches/release/libs/range/test/adaptor_test/indexed_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/indexed_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/indexed_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,13 +8,15 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[indexed_example
#include <boost/range/adaptor/indexed.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

+//<-
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

@@ -22,65 +24,72 @@

namespace
{
- template<class Iterator>
- void display_element_and_index(Iterator first, Iterator last)
- {
- for (Iterator it = first; it != last; ++it)
- {
- std::cout << "Element = " << *it << " Index = " << it.index() << std::endl;
- }
- }
-
- template<class SinglePassRange>
- void display_element_and_index(const SinglePassRange& rng)
- {
- display_element_and_index(boost::begin(rng), boost::end(rng));
- }

- template<class Iterator1, class Iterator2>
- void check_element_and_index(
- Iterator1 test_first,
- Iterator1 test_last,
- Iterator2 reference_first,
- Iterator2 reference_last)
- {
- BOOST_CHECK_EQUAL( std::distance(test_first, test_last),
- std::distance(reference_first, reference_last) );
+template<class Iterator1, class Iterator2>
+void check_element_and_index(
+ Iterator1 test_first,
+ Iterator1 test_last,
+ Iterator2 reference_first,
+ Iterator2 reference_last)
+{
+ BOOST_CHECK_EQUAL( std::distance(test_first, test_last),
+ std::distance(reference_first, reference_last) );

- int reference_index = 0;
+ int reference_index = 0;

- Iterator1 test_it = test_first;
- Iterator2 reference_it = reference_first;
- for (; test_it != test_last; ++test_it, ++reference_it, ++reference_index)
- {
- BOOST_CHECK_EQUAL( *test_it, *reference_it );
- BOOST_CHECK_EQUAL( test_it.index(), reference_index );
- }
+ Iterator1 test_it = test_first;
+ Iterator2 reference_it = reference_first;
+ for (; test_it != test_last; ++test_it, ++reference_it, ++reference_index)
+ {
+ BOOST_CHECK_EQUAL( *test_it, *reference_it );
+ BOOST_CHECK_EQUAL( test_it.index(), reference_index );
 }
+}

- template<class SinglePassRange1, class SinglePassRange2>
- void check_element_and_index(
- const SinglePassRange1& test_rng,
- const SinglePassRange2& reference_rng)
+template<class SinglePassRange1, class SinglePassRange2>
+void check_element_and_index(
+ const SinglePassRange1& test_rng,
+ const SinglePassRange2& reference_rng)
+{
+ check_element_and_index(boost::begin(test_rng), boost::end(test_rng),
+ boost::begin(reference_rng), boost::end(reference_rng));
+}
+//->
+template<class Iterator>
+void display_element_and_index(Iterator first, Iterator last)
+{
+ for (Iterator it = first; it != last; ++it)
 {
- check_element_and_index(boost::begin(test_rng), boost::end(test_rng),
- boost::begin(reference_rng), boost::end(reference_rng));
+ std::cout << "Element = " << *it << " Index = " << it.index() << std::endl;
 }
+}

- void indexed_example_test()
- {
- using namespace boost::assign;
- using namespace boost::adaptors;
+template<class SinglePassRange>
+void display_element_and_index(const SinglePassRange& rng)
+{
+ display_element_and_index(boost::begin(rng), boost::end(rng));
+}

- std::vector<int> input;
- input += 10,20,30,40,50,60,70,80,90;
+//<-
+void indexed_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;

- display_element_and_index( input | indexed(0) );
+ std::vector<int> input;
+ input += 10,20,30,40,50,60,70,80,90;

- check_element_and_index(
- input | indexed(0),
- input);
- }
+ display_element_and_index( input | indexed(0) );
+
+//= return 0;
+//=}
+//]
+ check_element_and_index(
+ input | indexed(0),
+ input);
+}
}

boost::unit_test::test_suite*

Modified: branches/release/libs/range/test/adaptor_test/indirected_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/indirected_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/indirected_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,13 +8,15 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[indirected_example
#include <boost/range/adaptor/indirected.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/shared_ptr.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

+//<-
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

@@ -22,30 +24,34 @@

namespace
{
- void indirected_example_test()
- {
- using namespace boost::adaptors;
-
- std::vector<boost::shared_ptr<int> > input;
-
- for (int i = 0; i < 10; ++i)
- input.push_back(boost::shared_ptr<int>(new int(i)));
-
- boost::copy(
- input | indirected,
- std::ostream_iterator<int>(std::cout, ","));
-
-
- std::vector<int> reference;
- for (int i = 0; i < 10; ++i)
- reference.push_back(i);
-
- std::vector<int> test;
- boost::push_back(test, input | indirected);
-
- BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
- test.begin(), test.end() );
- }
+void indirected_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+
+ std::vector<boost::shared_ptr<int> > input;
+
+ for (int i = 0; i < 10; ++i)
+ input.push_back(boost::shared_ptr<int>(new int(i)));
+
+ boost::copy(
+ input | indirected,
+ std::ostream_iterator<int>(std::cout, ","));
+
+//= return 0;
+//=}
+//]
+ std::vector<int> reference;
+ for (int i = 0; i < 10; ++i)
+ reference.push_back(i);
+
+ std::vector<int> test;
+ boost::push_back(test, input | indirected);
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ test.begin(), test.end() );
+}
}

boost::unit_test::test_suite*

Modified: branches/release/libs/range/test/adaptor_test/map_keys_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/map_keys_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/map_keys_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,14 +8,16 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[map_keys_example
#include <boost/range/adaptor/map.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <map>
#include <vector>

+//<-
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

@@ -23,29 +25,33 @@

namespace
{
- void map_keys_example_test()
- {
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::map<int,int> input;
- for (int i = 0; i < 10; ++i)
- input.insert(std::make_pair(i, i * 10));
-
- boost::copy(
- input | map_keys,
- std::ostream_iterator<int>(std::cout, ","));
-
-
- std::vector<int> reference;
- reference += 0,1,2,3,4,5,6,7,8,9;
-
- std::vector<int> test;
- boost::push_back(test, input | map_keys);
-
- BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
- test.begin(), test.end() );
- }
+void map_keys_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;
+
+ std::map<int,int> input;
+ for (int i = 0; i < 10; ++i)
+ input.insert(std::make_pair(i, i * 10));
+
+ boost::copy(
+ input | map_keys,
+ std::ostream_iterator<int>(std::cout, ","));
+
+//= return 0;
+//=}
+//]
+ std::vector<int> reference;
+ reference += 0,1,2,3,4,5,6,7,8,9;
+
+ std::vector<int> test;
+ boost::push_back(test, input | map_keys);
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ test.begin(), test.end() );
+}
}

boost::unit_test::test_suite*

Modified: branches/release/libs/range/test/adaptor_test/map_values_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/map_values_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/map_values_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,14 +8,16 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[map_values_example
#include <boost/range/adaptor/map.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <map>
#include <vector>

+//<-
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

@@ -23,29 +25,33 @@

namespace
{
- void map_values_example_test()
- {
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::map<int,int> input;
- for (int i = 0; i < 10; ++i)
- input.insert(std::make_pair(i, i * 10));
-
- boost::copy(
- input | map_values,
- std::ostream_iterator<int>(std::cout, ","));
-
-
- std::vector<int> reference;
- reference += 0,10,20,30,40,50,60,70,80,90;
-
- std::vector<int> test;
- boost::push_back(test, input | map_values);
-
- BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
- test.begin(), test.end() );
- }
+void map_values_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;
+
+ std::map<int,int> input;
+ for (int i = 0; i < 10; ++i)
+ input.insert(std::make_pair(i, i * 10));
+
+ boost::copy(
+ input | map_values,
+ std::ostream_iterator<int>(std::cout, ","));
+
+//= return 0;
+//=}
+//]
+ std::vector<int> reference;
+ reference += 0,10,20,30,40,50,60,70,80,90;
+
+ std::vector<int> test;
+ boost::push_back(test, input | map_values);
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ test.begin(), test.end() );
+}
}

boost::unit_test::test_suite*

Modified: branches/release/libs/range/test/adaptor_test/replaced_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/replaced_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/replaced_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,13 +8,15 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[replaced_example
#include <boost/range/adaptor/replaced.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

+//<-
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

@@ -22,28 +24,32 @@

namespace
{
- void replaced_example_test()
- {
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,2,5,2,7,2,9;
-
- boost::copy(
- input | replaced(2, 10),
- std::ostream_iterator<int>(std::cout, ","));
-
-
- std::vector<int> reference;
- reference += 1,10,3,10,5,10,7,10,9;
-
- std::vector<int> test;
- boost::push_back(test, input | replaced(2, 10));
-
- BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
- test.begin(), test.end() );
- }
+void replaced_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+ using namespace boost::assign;
+
+ std::vector<int> input;
+ input += 1,2,3,2,5,2,7,2,9;
+
+ boost::copy(
+ input | replaced(2, 10),
+ std::ostream_iterator<int>(std::cout, ","));
+
+//= return 0;
+//=}
+//]
+ std::vector<int> reference;
+ reference += 1,10,3,10,5,10,7,10,9;
+
+ std::vector<int> test;
+ boost::push_back(test, input | replaced(2, 10));
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ test.begin(), test.end() );
+}
}

boost::unit_test::test_suite*

Modified: branches/release/libs/range/test/adaptor_test/replaced_if_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/replaced_if_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/replaced_if_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,13 +8,15 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[replaced_if_example
#include <boost/range/adaptor/replaced_if.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

+//<-
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

@@ -22,32 +24,39 @@

namespace
{
- struct is_even
- {
- bool operator()(int x) const { return x % 2 == 0; }
- };
-
- void replaced_if_example_test()
- {
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9;
-
- boost::copy(
- input | replaced_if(is_even(), 10),
- std::ostream_iterator<int>(std::cout, ","));
-
- std::vector<int> reference;
- reference += 1,10,3,10,5,10,7,10,9;
-
- std::vector<int> test;
- boost::push_back(test, input | replaced_if(is_even(), 10));
-
- BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
- test.begin(), test.end() );
- }
+//->
+struct is_even
+{
+ bool operator()(int x) const { return x % 2 == 0; }
+};
+
+//<-
+void replaced_if_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+ using namespace boost::assign;
+
+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9;
+
+ boost::copy(
+ input | replaced_if(is_even(), 10),
+ std::ostream_iterator<int>(std::cout, ","));
+
+//= return 0;
+//=}
+//]
+ std::vector<int> reference;
+ reference += 1,10,3,10,5,10,7,10,9;
+
+ std::vector<int> test;
+ boost::push_back(test, input | replaced_if(is_even(), 10));
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ test.begin(), test.end() );
+}
}

boost::unit_test::test_suite*

Modified: branches/release/libs/range/test/adaptor_test/reversed_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/reversed_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/reversed_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,13 +8,15 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[reversed_example
#include <boost/range/adaptor/reversed.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

+//<-
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

@@ -22,25 +24,29 @@

namespace
{
- void reversed_example_test()
- {
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9;
-
- boost::copy(
- input | reversed,
- std::ostream_iterator<int>(std::cout, ","));
-
-
- std::vector<int> test;
- boost::push_back(test, input | reversed);
-
- BOOST_CHECK_EQUAL_COLLECTIONS( input.rbegin(), input.rend(),
- test.begin(), test.end() );
- }
+void reversed_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+ using namespace boost::assign;
+
+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9;
+
+ boost::copy(
+ input | reversed,
+ std::ostream_iterator<int>(std::cout, ","));
+
+//= return 0;
+//=}
+//]
+ std::vector<int> test;
+ boost::push_back(test, input | reversed);
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( input.rbegin(), input.rend(),
+ test.begin(), test.end() );
+}
}

boost::unit_test::test_suite*

Modified: branches/release/libs/range/test/adaptor_test/sliced_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/sliced_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/sliced_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,13 +8,15 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[sliced_example
#include <boost/range/adaptor/sliced.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

+//<-
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

@@ -22,28 +24,32 @@

namespace
{
- void sliced_example_test()
- {
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9;
-
- boost::copy(
- input | sliced(2, 5),
- std::ostream_iterator<int>(std::cout, ","));
-
-
- std::vector<int> reference;
- reference += 3,4,5;
-
- std::vector<int> test;
- boost::push_back(test, input | sliced(2, 5));
-
- BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
- test.begin(), test.end() );
- }
+void sliced_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+ using namespace boost::assign;
+
+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9;
+
+ boost::copy(
+ input | sliced(2, 5),
+ std::ostream_iterator<int>(std::cout, ","));
+
+//= return 0;
+//=}
+//]
+ std::vector<int> reference;
+ reference += 3,4,5;
+
+ std::vector<int> test;
+ boost::push_back(test, input | sliced(2, 5));
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ test.begin(), test.end() );
+}
}

boost::unit_test::test_suite*

Modified: branches/release/libs/range/test/adaptor_test/strided_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/strided_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/strided_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,13 +8,15 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[strided_example
#include <boost/range/adaptor/strided.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

+//<-
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

@@ -22,28 +24,32 @@

namespace
{
- void strided_example_test()
- {
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9,10;
-
- boost::copy(
- input | strided(2),
- std::ostream_iterator<int>(std::cout, ","));
-
-
- std::vector<int> reference;
- reference += 1,3,5,7,9;
-
- std::vector<int> test;
- boost::push_back(test, input | strided(2));
-
- BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
- test.begin(), test.end() );
- }
+void strided_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+ using namespace boost::assign;
+
+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9,10;
+
+ boost::copy(
+ input | strided(2),
+ std::ostream_iterator<int>(std::cout, ","));
+
+//= return 0;
+//=}
+//]
+ std::vector<int> reference;
+ reference += 1,3,5,7,9;
+
+ std::vector<int> test;
+ boost::push_back(test, input | strided(2));
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ test.begin(), test.end() );
+}
}

boost::unit_test::test_suite*

Modified: branches/release/libs/range/test/adaptor_test/transformed_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/transformed_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/transformed_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,13 +8,15 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[transformed_example
#include <boost/range/adaptor/transformed.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

+//<-
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

@@ -22,34 +24,40 @@

namespace
{
- struct double_int
- {
- typedef int result_type;
- int operator()(int x) const { return x * 2; }
- };
-
- void transformed_example_test()
- {
- using namespace boost::adaptors;
- using namespace boost::assign;
-
- std::vector<int> input;
- input += 1,2,3,4,5,6,7,8,9,10;
-
- boost::copy(
- input | transformed(double_int()),
- std::ostream_iterator<int>(std::cout, ","));
-
-
- std::vector<int> reference;
- reference += 2,4,6,8,10,12,14,16,18,20;
-
- std::vector<int> test;
- boost::push_back(test, input | transformed(double_int()));
-
- BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
- test.begin(), test.end() );
- }
+//->
+struct double_int
+{
+ typedef int result_type;
+ int operator()(int x) const { return x * 2; }
+};
+
+//<-
+void transformed_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::adaptors;
+ using namespace boost::assign;
+
+ std::vector<int> input;
+ input += 1,2,3,4,5,6,7,8,9,10;
+
+ boost::copy(
+ input | transformed(double_int()),
+ std::ostream_iterator<int>(std::cout, ","));
+
+//= return 0;
+//=}
+//]
+ std::vector<int> reference;
+ reference += 2,4,6,8,10,12,14,16,18,20;
+
+ std::vector<int> test;
+ boost::push_back(test, input | transformed(double_int()));
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ test.begin(), test.end() );
+}
}

boost::unit_test::test_suite*

Modified: branches/release/libs/range/test/adaptor_test/type_erased_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/type_erased_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/type_erased_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,15 +8,16 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[type_erased_example
#include <boost/range/adaptor/type_erased.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
#include <boost/foreach.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <list>
#include <vector>
-
+//<-
#include <boost/test/test_tools.hpp>
#include <boost/test/unit_test.hpp>

@@ -26,6 +27,7 @@
 {
 namespace type_erased_example
 {
+//->

// The client interface from an OO perspective merely requires a sequence
// of integers that can be forward traversed
@@ -99,6 +101,13 @@
 }
}

+//=int main(int argc, const char* argv[])
+//={
+//= client::run();
+//= return 0;
+//=}
+//]
+
 } // namespace type_erased_example
 } // namespace boost_range_test
} // anonymous namespace

Modified: branches/release/libs/range/test/adaptor_test/uniqued_example.cpp
==============================================================================
--- branches/release/libs/range/test/adaptor_test/uniqued_example.cpp (original)
+++ branches/release/libs/range/test/adaptor_test/uniqued_example.cpp 2013-01-14 04:19:32 EST (Mon, 14 Jan 2013)
@@ -8,13 +8,15 @@
//
// For more information, see http://www.boost.org/libs/range/
//
+//[uniqued_example
#include <boost/range/adaptor/uniqued.hpp>
#include <boost/range/algorithm/copy.hpp>
#include <boost/assign.hpp>
-#include <algorithm>
+#include <iterator>
#include <iostream>
#include <vector>

+//<-
#include <boost/range/algorithm_ext/push_back.hpp>

#include <boost/test/test_tools.hpp>
@@ -22,27 +24,32 @@

namespace
{
- void uniqued_example_test()
- {
- using namespace boost::assign;
- using namespace boost::adaptors;
-
- std::vector<int> input;
- input += 1,1,2,2,2,3,4,5,6;
-
- boost::copy(
- input | uniqued,
- std::ostream_iterator<int>(std::cout, ","));
-
- std::vector<int> reference;
- reference += 1,2,3,4,5,6;
-
- std::vector<int> test;
- boost::push_back( test, input | uniqued );
-
- BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
- test.begin(), test.end() );
- }
+void uniqued_example_test()
+//->
+//=int main(int argc, const char* argv[])
+{
+ using namespace boost::assign;
+ using namespace boost::adaptors;
+
+ std::vector<int> input;
+ input += 1,1,2,2,2,3,4,5,6;
+
+ boost::copy(
+ input | uniqued,
+ std::ostream_iterator<int>(std::cout, ","));
+
+//= return 0;
+//=}
+//]
+ std::vector<int> reference;
+ reference += 1,2,3,4,5,6;
+
+ std::vector<int> test;
+ boost::push_back( test, input | uniqued );
+
+ BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(),
+ test.begin(), test.end() );
+}
}

boost::unit_test::test_suite*

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