Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r61181 - in branches/release/libs/range/doc: . html/range/reference/range_algorithm
From: neil_at_[hidden]
Date: 2010-04-10 11:25:58

Next message: joel_at_[hidden]: "[Boost-commit] svn:boost r61182 - trunk/libs/spirit/example/scheme/test"
Previous message: atompkins_at_[hidden]: "[Boost-commit] svn:boost r61180 - in branches/release: boost/uuid libs/uuid"

Author: neilgroves
Date: 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
New Revision: 61181
URL: http://svn.boost.org/trac/boost/changeset/61181

Log:
Boost.Range removed deprecated html documentation.
Removed:
   branches/release/libs/range/doc/boost_range.html
   branches/release/libs/range/doc/examples.html
   branches/release/libs/range/doc/faq.html
   branches/release/libs/range/doc/headers.html
   branches/release/libs/range/doc/history_ack.html
   branches/release/libs/range/doc/html/range/reference/range_algorithm/
   branches/release/libs/range/doc/intro.html
   branches/release/libs/range/doc/istream_range.html
   branches/release/libs/range/doc/mfc_atl.html
   branches/release/libs/range/doc/portability.html
   branches/release/libs/range/doc/range.html
   branches/release/libs/range/doc/style.html
   branches/release/libs/range/doc/upgrading.html
   branches/release/libs/range/doc/utility_class.html

Deleted: branches/release/libs/range/doc/boost_range.html
==============================================================================
--- branches/release/libs/range/doc/boost_range.html 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
+++ (empty file)
@@ -1,769 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
- <head>
- <title>Boost.Range Reference </title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" href="style.css" type="text/css">
- </head>
- <body>
- <table>
- <tr>
- <td><img src="../../../boost.png" width="100%" border="0"></td>
- <td><h1> 
- Boost.Range
- </h1>
- </td>
- </tr>
- </table>
- <h2>Synopsis and Reference
- </h2>
- <ul>
- <li>
- Overview
- <li>
- Synopsis
- <li>
- Semantics
- <li>
- Extending the library</li>
- </ul>
- <hr size="1">
- <a name="overview"></a>
- <h3>Overview</h3>
- 
- Three types of objects are currently supported by the library:
- <ul>
- <li>
- standard-like containers
- <li>
- <code>std::pair<iterator,iterator></code>
- <li>
- built-in arrays
- </li>
- </ul>
- Even though the behavior of the primary templates are exactly such that
- standard containers will be supported by default, the requirements are much
- lower than the standard container requirements. For example, the utility class <a href="utility_class.html#iter_range">
- <code>iterator_range</code></a> implements the <a href="#minimal_interface">minimal
- interface</a> required to make the class a <a href="range.html#forward_range">Forward
- Range</a>
- .
- 
- 
- Please also see Range concepts for more details.
- 
- <a name="Synopsis"></a>
- <h3>Synopsis</h3>
- 
- <pre>
-namespace boost
-{
- //
- // Single Pass Range metafunctions
- //
-
- template< class T >
- struct <a href="#range_iterator">range_iterator</a>;
-
- template< class T >
- struct <a href="#range_value">range_value</a>;
-
- template< class T >
- struct <a href="#range_reference">range_reference</a>;
-
- template< class T >
- struct <a href="#range_pointer">range_pointer</a>;
-
- template< class T >
- struct <a href="#range_category">range_category</a>;
-
- //
- // Forward Range metafunctions
- //
-
- template< class T >
- struct <a href="#range_difference">range_difference</a>;
-
- //
- // Bidirectional Range metafunctions
- //
-
- template< class T >
- struct <a
-href="#range_reverse_iterator">range_reverse_iterator</a>;
-
- //
- // Single Pass Range functions
- //
-
- template< class T >
- typename range_iterator<T>::type
- begin( T& r );
-
- template< class T >
- typename range_iterator<const T>::type
- begin( const T& r );
-
- template< class T >
- typename range_iterator<T>::type
- end( T& r );
-
- template< class T >
- typename range_iterator<const T>::type
- end( const T& r );
-
- template< class T >
- bool
- empty( const T& r );
-
- //
- // Forward Range functions
- //
-
- template< class T >
- typename range_difference<T>::type
- distance( const T& r );
-
- //
- // Bidirectional Range functions
- //
-
- template< class T >
- typename range_reverse_iterator<T>::type
- rbegin( T& r );
-
- template< class T >
- typename range_reverse_iterator<const T>::type
- rbegin( const T& r );
-
- template< class T >
- typename range_reverse_iterator<T>::type
- rend( T& r );
-
- template< class T >
- typename range_reverse_iterator<const T>::type
- rend( const T& r );
- 
- //
- // Random Access Range functions
- //
-
- template< class T >
- typename range_difference<T>::type
- size( const T& r );
-
- //
- // Special const Range functions
- //
- 
- template< class T >
- typename range_iterator<const T>::type 
- const_begin( const T& r );
- 
- template< class T >
- typename range_iterator<const T>::type 
- const_end( const T& r );
- 
- template< class T >
- typename range_reverse_iterator<const T>::type 
- const_rbegin( const T& r );
- 
- template< class T >
- typename range_reverse_iterator<const T>::type 
- const_rend( const T& r );
-
- //
- // String utilities
- //
-
- template< class T >
- iterator_range<...see below...>
- as_literal( T& r );
-
- template< class T >
- iterator_range<...see below...>
- as_literal( const T& r );
-
- template< class T >
- iterator_range< typename range_iterator<T>::type >
- as_array( T& r );
-
- template< class T >
- iterator_range< typename range_iterator<const T>::type >
- as_array( const T& r );
-
-} // namespace 'boost'
-
-</pre>
- 
- <a name="Semantics"></a>
- <h3>Semantics</h3>
- <h4>notation</h4>
- 
- <table cellpadding="5" border="1">
- <tr>
- <th>
- Type
- <th>
- Object
- <th>
- Describes
- </tr>
- <tr>
- <td><code>X</code>
- <td><code>x</code>
- <td>any type</td>
- <tr>
- <td><code>T</code>
- </td>
- <td><code>t</code>
- <td>denotes behavior of the primary templates</td>
- </tr>
- <tr>
- <td><code>P</code>
- <td><code>p</code>
- <td>denotes <code>std::pair<iterator,iterator></code></td>
- <tr>
- <td><code>A[sz]</code>
- <td><code>a</code>
- <td>denotes an array of type <code>A</code> of size <code>sz</code>
- </tr>
- <tr>
- <td><code>Char*</code>
- <td><code>s</code>
- <td>denotes either <code>char*</code> or <code>wchar_t*</code></td>
- </tr>
- </table>
- 
- 
- Please notice in tables below that when four lines appear in a cell, the first
- line will describe the primary template, the second line pairs of iterators,
- the third line arrays and the last line null-terminated strings.
- 
- <h4>Metafunctions</h4>
- 
- <table border="1" cellpadding="5">
- <tr>
- <th>
- Expression</th>
- <th>
- Return type</th>
- <th>
- Complexity</th>
- </tr>
-
- <tr >
- <td><a name="range_iterator"></a><code>range_iterator<X>::type</code></td>
- <td><code>T::iterator</code> 
- <code>P::first_type</code> 
- <code>A*</code> 
-
- <td>compile time</td>
- </tr>
- <tr>
-
- <td><a name="range_const_iterator"></a><code>range_iterator<const X>::type</code></td>
- <td><code>T::const_iterator</code> 
- <code>P::first_type</code> 
- <code>const A*</code> 
-
- <td>compile time</td>
- </tr>
- <tr>
-
- <td><a name="range_value"></a><code>range_value<X>::type</code></td>
- <td><code>boost::iterator_value<range_iterator<X>::type>::type</code>
- </td>
- <td>compile time</td>
- </tr>
- <tr>
-
- <td><a name="range_reference"></a><code>range_reference<X>::type</code></td>
- <td><code>boost::iterator_reference<range_iterator<X>::type>::type</code>
- </td>
- <td>compile time</td>
- </tr>
-
- <tr>
-
- <td><a name="range_pointer"></a><code>range_pointer<X>::type</code></td>
- <td><code>boost::iterator_pointer<range_iterator<X>::type>::type</code>
- </td>
- <td>compile time</td>
- </tr>
-
- <tr>
-
- <td><a name="range_category"></a><code>range_category<X>::type</code></td>
- <td><code>boost::iterator_category<range_iterator<X>::type>::type</code>
- </td>
- <td>compile time</td>
- </tr>
- <tr>
-
- <td><a name="range_difference"></a><code>range_difference<X>::type</code></td>
- <td>
- <code>boost::iterator_difference<range_iterator<X>::type>::type</code></td>
-
- <td>compile time</td>
- </tr>
-
- <tr>
-
- <td><a name="range_reverse_iterator"></a><code>range_reverse_iterator<X>::type</code></td>
- <td><code>boost::reverse_iterator<range_iterator<X>::type></code> 
- <td>compile time</td>
- </tr>
- <tr>
-
- <td><a name="range_const_reverse_iterator"></a><code>range_reverse_iterator<const X>::type</code></td>
- <td><code>boost::reverse_iterator<range_iterator<const X>::type></code>
- 
- <td>compile time</td>
- </tr>
- </table>
- 
- <h4>Functions</h4>
- 
- <table border="1" cellpadding="5">
- <tr>
- <th>
- Expression</th>
- <th>
- Return type</th>
- <th>
- Returns</th>
- <th>
- Complexity</th>
- </tr>
- <tr>
-
- <td><a name="begin"></a><code>begin(x)</code></td>
- <td><code>range_iterator<X>::type</code></td>
- <td>
- <code>p.first</code> if <code>p</code> is of type <code>std::pair<T><code> 
- <code>a</code> if <code>a</code> is an array 
- <code>range_begin(x)</code> if that expression would invoke a function found by ADL 
- <code>t.begin()</code> otherwise
-
- <td>constant time</td>
- </tr>
- <tr>
-
- <td><a name="end"></a><code>end(x)</code></td>
- <td><code>range_iterator<X>::type</code></td>
- <td>
- <code>p.second</code> if <code>p</code> is of type <code>std::pair<T><code> 
- <code>a + sz</code> if <code>a</code> is an array of size <code>sz</code>
-
- 
- <code>range_end(x)</code> if that expression would invoke a function found by ADL 
- <code>t.end()</code> otherwise
-
- <td>
- constant time </td>
- </tr>
- <tr>
-
- <td><a name="empty"></a><code>empty(x)</code></td>
- <td><code>bool</code></td>
- <td><code>boost::begin(x) == boost::end(x)</code> 
- <td> constant time 
- </td>
- </tr>
- <tr>
-
- <td><a name="distance"></a><code>distance(x)</code></td>
- <td><code>range_difference<X>::type</code></td>
- <td>
- <code>
- std::distance(boost::begin(x),boost::end(x))
- </code>
- </td>
- <td>-</td>
-
- </tr>
-
- <tr>
-
- <td><a name="size"></a><code>size(x)</code></td>
- <td><code>range_difference<X>::type</code></td>
- <td><code> boost::end(x) - boost::begin(x)</code>
-
- <td> constant time </td>
- </tr>
- <tr>
-
- <td><a name="rbegin"></a><code>rbegin(x)</code></td>
- <td><code>range_reverse_iterator<X>::type</code></td>
- <td><code>range_reverse_iterator<X>::type( boost::end(x) )</code>
- 
- <td>constant time
- </td>
- </tr>
- <tr>
-
- <td> <a name="rend"></a><code>rend(x)</code></td>
- <td><code>range_reverse_iterator<X>::type</code></td>
- <td><code>range_reverse_iterator<X>::type( boost::begin(x) )</code>
- <td>constant time</td>
- </tr>
- <tr>
-
- <td><a name="const_begin"></a><code>const_begin(x)</code></td>
- <td><code>range_iterator<const X>::type</code></td>
- <td><code>range_iterator<const X>::type( boost::begin(x) )</code>
- 
- <td>constant time
- </td>
- </tr>
- <tr>
-
- <td><a name="const_end"></a><code>const_end(x)</code></td>
- <td><code>range_iterator<const X>::type</code></td>
- <td><code>range_iterator<const X>::type( boost::end(x) )</code>
- <td>constant time</td>
- </tr>
- <tr>
-
- <td><a name="const_rbegin"></a><code>const_rbegin(x)</code></td>
- <td><code>range_reverse_iterator<const X>::type</code></td>
- <td><code>range_reverse_iterator<const X>::type( boost::rbegin(x) )</code>
- 
- <td>constant time
- </td>
- </tr>
- <tr>
-
- <td><a name="const_rend"></a><code>const_rend(x)</code></td>
- <td><code>range_reverse_iterator<const X>::type</code></td>
- <td><code>range_reverse_iterator<const X>::type( boost::rend(x) )</code>
-
- <td>constant time</td>
- </tr>
- <tr>
-
- <td><a name="as_literal"></a><code>as_literal(x)</code></td>
- <td><code>iterator_range</code> where <code>U</code> is
- <code>Char*</code> if <code>x</code> is a pointer to a
- string and <code>U</code> is
- <code>range_iterator<X>::type</code> otherwise
- </td>
- <td>
-
- 
- <code>[s,s + std::char_traits<X>::length(s))</code> if <code>s</code> is a <code>Char*</code> or an array of <code>Char</code>
- 
- <code>[boost::begin(x),boost::end(x))</code> otherwise
-
-
-
- </td>
- <td>linear time for pointers to a string or arrays of
- <code>Char</code>, constant time otherwise</td>
- </tr>
- <tr>
-
- <td><a name="as_array"></a><code>as_array(x)</code></td>
- <td><code>iterator_range<X></code> </td>
- <td>
- <code>[boost::begin(x),boost::end(x))</code>
-
-
-
-
- </td>
- <td>constant time otherwise</td>
- </tr>
-
- </table>
- 
- 
- The special <code>const_</code>-named functions are useful when you
- want to document clearly that your code is read-only.
- 
- 
- <code>as_literal()</code> can be used internally in string
- algorithm librararies such that arrays of characters are
- handled correctly.
- 
- 
- <code>as_array()</code> can be used with string algorithm libraries to make it clear that arrays of characters are handled like an array and not like a string.
- 
- Notice that the above functions should always be called with
- qualification (<code>boost::</code>) to prevent unintended
- Argument Dependent Lookup (ADL).
- 
- <hr>
- <a name="minimal_interface"></a>
- <h3>Extending the library</h3>
- <ul>
- <li>Method 1: provide member functions and nested types</li>
-
- <li>Method 2: provide free-standing functions and specialize metafunctions</li>
- </ul>
-
- 
-
- <a name="method1"></a>
- <h4>Method 1: provide member functions and nested types</h4>
-
- 
- This procedure assumes that you have control over the types that should be made
- conformant to a Range concept. If not, see method 2.
- 
-
- 
- The primary templates in this library are implemented such that standard
- containers will work automatically and so will <code>boost::array</code>.
- Below is given an overview of which member functions and member types a class
- must specify to be useable as a certain Range concept.
- 
- 
- <table cellpadding="5" border="1">
- <tr>
- <th>
- Member function</th>
- <th>
- Related concept</th>
- <tr>
- <td><code>begin()</code></td>
- <td>Single Pass Range</td>
- </tr>
- <tr>
- <td><code>end()</code>
- </td>
- <td>Single Pass Range</td>
- </tr>
- </table>
- 
- 
- Notice that <code>rbegin()</code> and <code>rend()</code> member functions are
- not needed even though the container can support bidirectional iteration.
- 
- 
- The required member types are:
- 
- 
- <table cellpadding="5" border="1">
- <tr>
- <th>
- Member type</th>
- <th>
- Related concept</th>
- </tr>
- <tr>
- <td><code>iterator</code></td>
- <td>Single Pass Range</td>
- </tr>
- <tr>
- <td><code>const_iterator</code></td>
- <td>Single Pass Range</td>
- </tr>
- </table>
- 
- 
- Again one should notice that member types <code>reverse_iterator</code> and <code>const_reverse_iterator</code>
- are not needed.
- 
- <a name="method2"></a>
- <h4>Method 2: provide free-standing functions and specialize metafunctions</h4>
-
- 
- This procedure assumes that you cannot (or do not wish to) change the types that should be made
- conformant to a Range concept. If this is not true, see method 1.
- 
-
- 
- The primary templates in this library are implemented such that
- certain functions are found via argument-dependent-lookup (ADL).
- Below is given an overview of which free-standing functions a class
- must specify to be useable as a certain Range concept.
- Let <code>x</code> be a variable (<code>const</code> or mutable)
- of the class in question.
- 
- 
- <table cellpadding="5" border="1" ID="Table1">
- <tr>
- <th>
- Function</th>
- <th>
- Related concept</th>
- <tr>
- <td><code>range_begin(x)</code></td>
- <td>Single Pass Range</td>
- </tr>
- <tr>
- <td><code>range_end(x)</code>
- </td>
- <td>Single Pass Range</td>
- </tr>
-
- </table>
- 
- <code>range_begin()</code> and <code>range_end()</code> must be
- overloaded for both <code>const</code> and mutable reference arguments.
- 
-
- 
- You must also specialize two metafunctions for your type <code>X</code>:
- 
- 
- <table cellpadding="5" border="1" ID="Table2">
- <tr>
- <th>
- Metafunction</th>
- <th>
- Related concept</th>
- <tr>
- <td><code>boost::range_mutable_iterator</code></td>
- <td>Single Pass Range</td>
- </tr>
- <tr>
- <td><code>boost::range_const_iterator</code></td>
- <td>Single Pass Range</td>
- </tr>
-
- </table>
- 
- 
- A complete example is given here:
- 
- <blockquote>
- <pre>
-#include <boost/range.hpp>
-#include <iterator> // for std::iterator_traits, std::distance()
-
-namespace Foo
-{
- //
- // Our sample UDT. A 'Pair'
- // will work as a range when the stored
- // elements are iterators.
- //
- template< class T >
- struct Pair
- {
- T first, last;
- };
-
-} // namespace 'Foo'
-
-namespace boost
-{
- //
- // Specialize metafunctions. We must include the range.hpp header.
- // We must open the 'boost' namespace.
- //
-
- template< class T >
- struct range_mutable_iterator< Foo::Pair<T> >
- {
- typedef T type;
- };
-
- template< class T >
- struct range_const_iterator< Foo::Pair<T> >
- {
- //
- // Remark: this is defined similar to 'range_mutable_iterator'
- // because the 'Pair' type does not distinguish
- // between an iterator and a const_iterator.
- //
- typedef T type;
- };
-
-} // namespace 'boost'
-
-namespace Foo
-{
- //
- // The required functions. These should be defined in
- // the same namespace as 'Pair', in this case
- // in namespace 'Foo'.
- //
-
- template< class T >
- inline T range_begin( Pair<T>& x )
- {
- return x.first;
- }
-
- template< class T >
- inline T range_begin( const Pair<T>& x )
- {
- return x.first;
- }
-
- template< class T >
- inline T range_end( Pair<T>& x )
- {
- return x.last;
- }
-
- template< class T >
- inline T range_end( const Pair<T>& x )
- {
- return x.last;
- }
-
-} // namespace 'Foo'
-
-#include <vector>
-
-int main()
-{
- typedef std::vector<int>::iterator iter;
- std::vector<int> vec;
- Foo::Pair<iter> pair = { vec.begin(), vec.end() };
- const Foo::Pair<iter>& cpair = pair;
- //
- // Notice that we call 'begin' etc with qualification.
- //
- iter i = boost::begin( pair );
- iter e = boost::end( pair );
- i = boost::begin( cpair );
- e = boost::end( cpair );
- boost::range_difference< Foo::Pair<iter> >::type s = boost::size( pair );
- s = boost::size( cpair );
- boost::range_reverse_iterator< const Foo::Pair<iter> >::type
- ri = boost::rbegin( cpair ),
- re = boost::rend( cpair );
-}
-</pre>
-</blockquote>
-
- <hr>
- 
- © <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
- 
-
- 
- Distributed under the Boost Software License, Version 1.0. (See
- accompanying file LICENSE_1_0.txt or copy at <a href=
- "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- </body>
-</html>

Deleted: branches/release/libs/range/doc/examples.html
==============================================================================
--- branches/release/libs/range/doc/examples.html 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
+++ (empty file)
@@ -1,72 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
- <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
- <title>Boost.Range Examples </title>
- <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
- <body>
-
- <table border="0" >
- <tr>
- <td ><img src="../../../boost.png" border="0" ></td>
- <td ><h1 align="center">Boost.Range </h1></td>
- </tr>
- </table>
-
- <h2 >Examples</h2><a name="Examples" ></a>
- 
- Some examples are given in the accompanying test files:
- 
- <ul >
- <li >
- string.cpp
-
- shows how to implement a container version of <code >std::find()</code> that
- works with <code >char[],wchar_t[],char*,wchar_t*.</code>
- </li>
- <li >
- algorithm_example.cpp
-
-
- shows the replace example from the introduction.
- </li>
- <li> iterator_range.cpp
- <li> sub_range.cpp
- <li> iterator_pair.cpp
- <li> reversible_range.cpp
- <li> std_container.cpp
- <li> array.cpp
- </ul>
-
-
- <hr>
- 
- © <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
- 
-
- 
- Distributed under the Boost Software License, Version 1.0. (See
- accompanying file LICENSE_1_0.txt or copy at <a href=
- "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
- 
-
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
-
-
- </body>
-</html>
-

Deleted: branches/release/libs/range/doc/faq.html
==============================================================================
--- branches/release/libs/range/doc/faq.html 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
+++ (empty file)
@@ -1,145 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
- <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
- <title>Boost.Range FAQ </title>
- <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
- <body>
-
- <table border="0" >
- <tr>
- <td ><img src="../../../boost.png" border="0" ></td>
- <td ><h1 align="center">Boost.Range</h1></td>
- </tr>
- </table>
-
- 
- <h2 >FAQ</h2> <a name="FAQ" ></a>
- <ol >
- <li >
- Why is there no difference between <code >range_iterator<C>::type</code>
- and <code >range_const_iterator<C>::type</code> for <code>std::pair<iterator, iterator></code>.
-
- 
- In general it is not possible nor desirable to find a corresponding <code >const_iterator</code>.
- When it is possible to come up with one, the client might choose to construct a <code >std::pair<const_iterator,const_iterator></code>
- object.
- 
- 
- Note that an iterator_range
- is somewhat more convenient than a <code>pair</code> and that a <a
- href="utility_class.html#sub_range"><code>sub_range</code></a> does
- propagate const-ness. 
- </li>
- <li >
- Why is there not supplied more types or more functions?
- 
- The library has been kept small because its current interface will
- serve most
- purposes. If and when a genuine need arises for more functionality, it can be
- implemented.
- 
- </li>
- <li >
- How should I implement generic algorithms for ranges?
- 
- One should always start with a generic algorithm that takes two iterators (or
- more) as input. Then use Boost.Range to build handier versions on top of the
- iterator based algorithm. Please notice that once the range version of the
- algorithm is done, it makes sense not to expose the iterator version in
- the public interface.
- 
- </li>
- <li>
- Why is there no Incrementable Range concept?
- 
- Even though we speak of incrementable iterators, it would not make
- much sense for ranges; for example, we cannot determine the size and
- emptiness of a range since we cannot even compare
- its iterators.
- 
- 
- Note also that incrementable iterators are derived from output
- iterators and so there exist no output range.
- 
- </li>
- 
-
- </ol>
-
-
- <hr>
- 
- © <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
- 
-
- 
- Distributed under the Boost Software License, Version 1.0. (See
- accompanying file LICENSE_1_0.txt or copy
- at <a href=
- "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
- 
-
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
-
-
- </body>
-</html>
-

Deleted: branches/release/libs/range/doc/headers.html
==============================================================================
--- branches/release/libs/range/doc/headers.html 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
+++ (empty file)
@@ -1,202 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
- <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
- <title>Boost.Range Headers </title>
- <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
- <body>
-
- <table border="0" >
- <tr>
- <td ><img src="../../../boost.png" border="0" ></td>
- <td ><h1 align="center">Boost.Range</h1></td>
- </tr>
- </table>
-
- 
- <h2 >Library headers</h2><a name="Library headers" ></a>
- <table cellpadding="5" border="1" >
- <tr >
- <th >Header</th>
- <th >Includes</th>
- <th>Related concept </th>
- </tr>
- <tr >
- <td ><code ><boost/range.hpp></code></td>
- <td >everything</td>
- <td>- </td>
- </tr>
- <tr >
- <td ><code ><boost/range/metafunctions.hpp></code></td>
- <td >every metafunction</td>
- <td>- </td>
- </tr>
- <tr >
- <td ><code ><boost/range/functions.hpp></code></td>
- <td >every function</td>
- <td>- </td>
- </tr>
- <tr >
- <td ><code ><boost/range/value_type.hpp></code></td>
- <td >range_value</td>
- <td>Single Pass Range</td>
- </tr>
- <tr >
- <td ><code ><boost/range/iterator.hpp></code></td>
- <td ><a href="boost_range.html#range_iterator"
- >range_iterator</a></td>
- <td>Single Pass Range </td>
- </tr>
- <tr >
- <td ><code ><boost/range/mutable_iterator.hpp></code></td>
- <td ><a href="boost_range.html#range_mutable_iterator"
- >range_mutable_iterator</a></td>
- <td>Single Pass Range </td>
- </tr>
- <tr >
- <td ><code ><boost/range/const_iterator.hpp></code></td>
- <td ><a href="boost_range.html#range_const_iterator"
- >range_const_iterator</a></td>
- <td>Single Pass Range </td>
- </tr>
- <tr >
- <td ><code ><boost/range/difference_type.hpp></code></td>
- <td ><a href="boost_range.html#range_difference"
- >range_difference</a></td>
- <td>Forward Range </td>
- </tr>
- <tr >
- <td ><code ><boost/range/pointer.hpp></code></td>
- <td ><a href="boost_range.html#range_pointer"
- >range_pointer</a></td>
- <td>- </td>
- </tr>
- <tr >
- <td ><code ><boost/range/category.hpp></code></td>
- <td ><a href="boost_range.html#range_category"
- >range_category</a></td>
- <td>- </td>
- </tr>
-
- <tr >
- <td ><code ><boost/range/reverse_iterator.hpp></code></td>
- <td >range_reverse_iterator</td>
- <td>Bidirectional Range </td>
- </tr>
- <tr >
- <td ><code ><boost/range/begin.hpp></code></td>
- <td >
- begin and
- const_begin
- </td>
- <td>Single Pass Range </td>
- </tr>
- <tr >
- <td ><code ><boost/range/end.hpp></code></td>
- <td >
- end and
- const_end
- </td>
- <td>Single Pass Range </td>
- </tr>
- <tr >
- <td ><code ><boost/range/empty.hpp></code></td>
- <td >empty</td>
- <td>Single Pass Range </td>
- </tr>
- <tr >
- <td ><code ><boost/range/distance.hpp></code></td>
- <td >distance</td>
- <td>Forward Range </td>
- </tr>
- <tr >
- <td ><code ><boost/range/size.hpp></code></td>
- <td >size</td>
- <td>Random Access Range
- </td>
- </tr>
- <tr >
- <td ><code ><boost/range/rbegin.hpp></code></td>
- <td >
- rbegin and
- const_rbegin
- </td>
- <td>Bidirectional Range </td>
- </tr>
- <tr >
- <td ><code ><boost/range/rend.hpp></code></td>
- <td >
- rend and
- const_rend
- </td>
- <td>Bidirectional Range </td>
- </tr>
- <tr >
- <td ><code ><boost/range/as_array.hpp></code></td>
- <td >
- as_array
- </td>
- <td>-</td>
- </tr>
- <tr >
- <td ><code ><boost/range/as_literal.hpp></code></td>
- <td >
- as_literal
- </td>
- <td>-</td>
- </tr>
-
- <tr >
- <td ><code ><boost/range/iterator_range.hpp></code></td>
- <td ><a href="utility_class.html#iter_range"
- >iterator_range</a></td>
- <td>- </td>
- </tr>
- <tr >
- <td ><code ><boost/range/sub_range.hpp></code></td>
- <td >sub_range</td>
- <td>- </td>
- </tr>
- <tr >
- <td ><code ><boost/range/concepts.hpp></code></td>
- <td >concept checks</td>
- <td>- </td>
- </tr>
-
- </table>
- 
- 
-
-
- <hr>
- 
- © <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
- 
-
- 
- Distributed under the Boost Software License, Version 1.0. (See
- accompanying file LICENSE_1_0.txt or copy
- at <a href=
- "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
- 
-
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
-
-
- </body>
-</html>
-

Deleted: branches/release/libs/range/doc/history_ack.html
==============================================================================
--- branches/release/libs/range/doc/history_ack.html 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
+++ (empty file)
@@ -1,90 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
- <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
- <title>Boost.Range History and Acknowledgement </title>
- <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
- <body>
-
- <table border="0" >
- <tr>
- <td><img src="../../../boost.png" border="0" ></td>
- <td><h1 align="center">Boost.Range </h1></td>
- </tr>
- </table>
-
- <h2 >History and Acknowledgement</h2><a name="History" ></a>
- 
- The library was under way for a long time. Dietmar Kühl originally intended
- to submit an <code >array_traits</code> class template which had most of
- the functionality present now, but only for arrays and standard containers.
- I believe this was back in 2001 or 2002.
- 
-
- 
- Meanwhile work on algorithms for containers in various contexts showed the
- need for handling pairs of iterators, and string libraries needed special
- treatment of character arrays. In the end it made sense to formalize the
- minimal requirements of these similar concepts. And the results are the
- Range concepts found in this library. 
-
- 
- The term Range was adopted because of paragraph <code>24.1/7</code> from the
-C++ standard: <blockquote>
- Most of the library's algorithmic templates that operate on data
- structures have interfaces that use ranges. A range is a pair of
- iterators that designate the beginning and end of the computation. A
- range [i, i) is an empty range; in general, a range [i, j) refers to
- the elements in the data structure starting with the one pointed to
- by i and up to but not including the one pointed to by j. Range [i,
- j) is valid if and only if j is reachable from i. The result of the
- application of functions in the library to invalid ranges is
- undefined.
- </blockquote>
-
- 
- Special thanks goes to
- <ul>
- <li> Pavol Droba for help with documentation and implementation
- <li> Pavel Vozenilek for help with porting the library
- <li> Jonathan Turkanis and John Torjo for help with documentation
- <li> Hartmut Kaiser for being review manager
- <li> Jonathan Turkanis for porting the lib (as far sa possible) to
- vc6 and vc7.
- </ul>
- 
- 
- The concept checks and their documentation was provided by Daniel Walker.
-
- <hr>
- 
- © <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
- 
-
- 
- Distributed under the Boost Software License, Version 1.0. (See
- accompanying file LICENSE_1_0.txt or copy
- at <a href=
- "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
- 
-
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
-
-
- </body>
-</html>
-

Deleted: branches/release/libs/range/doc/intro.html
==============================================================================
--- branches/release/libs/range/doc/intro.html 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
+++ (empty file)
@@ -1,164 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
- <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
- <title>Boost.Range Introduction </title>
- <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
- <body>
-
- <table border="0" >
- <tr>
- <td ><img src="../../../boost.png" border="0" ></td>
- <td ><h1 align="center">Boost.Range</h1></td>
- </tr>
- </table>
-
- <h2>Introduction</h2>
- 
- Generic algorithms have so far been specified in terms of two or more
- iterators. Two iterators would together form a range of values that the
- algorithm could work on. This leads to a very general interface, but also
- to a somewhat clumsy use of the algorithms with redundant specification
- of container names. Therefore we would like to raise the abstraction level
- for algorithms so they specify their interface in terms of <a
- href="range.html">Ranges</a> as much as possible.
- 
-
- 
- The most common form of ranges we are used to work with is standard library
- containers. However, one
- often finds it desirable to extend that code to work with other types that
- offer
- enough functionality to satisfy the needs of the generic code
- if a suitable layer of indirection is applied . For
- example, raw arrays are often suitable for use with generic code that
- works with containers, provided a suitable adapter is used.
- 
-
- 
- This library therefore provides the means to adapt standard-like
- containers, <code>std::pairs</code> of iterators, and raw arrays (and
- more), such that
- the same generic code can work with them all.
-The basic idea is to add another layer of indirection using <a
-href="../../mpl/doc/refmanual/metafunction.html">metafunctions</a> and
-free-standing functions so syntactic and/or semantic differences can be removed.
-
-
- 
- The main advantages are
- <ul >
- <li >
- simpler implementation and specification of generic range algorithms
- </li>
- <li >
- more flexible, compact and maintainable client code
- </li>
- <li >
- safe use of built-in arrays
- </li>
-
- </ul>
- 
- Below is given a small example (the complete example can be found <a
- href="../test/algorithm_example.cpp" target="_self" >here</a>): <blockquote>
- <pre >
-
- //
- // example: extracting bounds in a generic algorithm
- //
- template< class ForwardReadableRange, class T >
- inline typename boost::range_iterator< ForwardReadableRange >::type
- find( ForwardReadableRange& c, const T& value )
- {
- return std::find( boost::begin( c ), boost::end( c ), value );
- }
-
- template< class ForwardReadableRange, class T >
- inline typename boost::range_iterator< const ForwardReadableRange >::type
- find( const ForwardReadableRange& c, const T& value )
- {
- return std::find( boost::begin( c ), boost::end( c ), value );
- }
-
- //
- // replace first value and return its index
- //
- template< class ForwardReadableWriteableRange, class T >
- inline typename boost::range_difference< ForwardReadableWriteableRange >::type
- my_generic_replace( ForwardReadableWriteableRange& c, const T& value, const T& replacement )
- {
- typename boost::range_iterator< ForwardReadableWriteableRange >::type found = find( c, value );
-
- if( found != boost::end( c ) )
- *found = replacement;
- return std::distance( boost::begin( c ), found );
- }
-
- //
- // usage
- //
- const int N = 5;
- std::vector<int> my_vector;
- int values[] = { 1,2,3,4,5,6,7,8,9 };
- 
- my_vector.assign( values, boost::end( values ) );
- typedef std::vector<int>::iterator iterator;
- std::pair<iterator,iterator> my_view( boost::begin( my_vector ),
- boost::begin( my_vector ) + N );
- char str_val[] = "a string";
- char* str = str_val;
-
- std::cout << my_generic_replace( my_vector, 4, 2 );
- std::cout << my_generic_replace( my_view, 4, 2 );
- std::cout << my_generic_replace( str, 'a', 'b' );
-
- // prints '3', '5' and '0' 
- </pre>
- </blockquote>
-
- By using the free-standing functions and <a
-href="../../mpl/doc/refmanual/metafunction.html">metafunctions</a>, the code automatically
- works for all the types supported by this library; now and in the future.
-Notice that we have to
- provide two version of <code >find()</code> since we cannot forward a non-const
- rvalue with reference arguments (see this article about <a href="http://std.dkuug.dk/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_self" >The
- Forwarding Problem</a> ).
-
- 
-
-
- <hr>
- 
- © <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
- 
-
- 
- Distributed under the Boost Software License, Version 1.0. (See
- accompanying file LICENSE_1_0.txt or copy
- at <a href=
- "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
- 
-
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
-
-
- </body>
-</html>
-

Deleted: branches/release/libs/range/doc/istream_range.html
==============================================================================
--- branches/release/libs/range/doc/istream_range.html 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
+++ (empty file)
@@ -1,64 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
- <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1" />
- <title>Boost.Range Utilities</title>
- <link rel="stylesheet" href="style.css" type="text/css" />
-</head>
-
- <body>
- <table border="0" >
- <tr>
- <td ><img src="../../../boost.png" border="0" /></td>
- <td ><h1 align="center">Boost.Range</h1></td>
- </tr>
- </table>
- <a name="istream_range"></a> <h1>Function <code>istream_range</code></h1>
- 
- The intention of the <code>istream_range</code> function is to construct
- a new range with a pair of <code>std::istream_iterator</code>s that wrap a
- specified <code>std::basic_istream</code> instance.
- 
-
- <h3>Synopsis</h3>
-
- <pre>
-namespace boost
-{
- template< class 
- Type, class 
- Elem, class Traits > inline
- range< std::istream_iterator<Type, Elem, Traits> >
- istream_range(std::basic_istream<Elem, Traits>& in);
-} </pre>
-
- 
- © <a name="Copyright" id="Copyright">Copyright</a> Neil Groves 2009.
-
-
- 
- Distributed under the Boost Software License, Version 1.0. (See
- accompanying file LICENSE_1_0.txt or copy
- at <a href=
- "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
- 
-
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
-
-
- </body>
-</html>
-

Deleted: branches/release/libs/range/doc/mfc_atl.html
==============================================================================
--- branches/release/libs/range/doc/mfc_atl.html 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
+++ (empty file)
@@ -1,581 +0,0 @@
-<?xml version="1.0" encoding="utf-8" ?>
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
-<meta name="generator" content="Docutils 0.3.10: http://docutils.sourceforge.net/" />
-<title>Boost Range MFC/ATL Extension</title>
-<meta name="author" content="Shunsuke Sogame" />
-<meta name="date" content="26th of May 2006" />
-<meta name="copyright" content="Shunsuke Sogame 2005-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt)." />
-<style type="text/css">
-
-/*
-:Author: David Goodger
-:Contact: goodger_at_[hidden]
-:Date: $Date: 2005-09-25 17:49:54 +0200 (Sun, 25 Sep 2005) $
-:Revision: $Revision: 3901 $
-:Copyright: This stylesheet has been placed in the public domain.
-
-Default cascading style sheet for the HTML output of Docutils.
-
-See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
-customize this style sheet.
-*/
-
-/* "! important" is used here to override other ``margin-top`` and
- ``margin-bottom`` styles that are later in the stylesheet or
- more specific. See http://www.w3.org/TR/CSS1#the-cascade */
-.first {
- margin-top: 0 ! important }
-
-.last, .with-subtitle {
- margin-bottom: 0 ! important }
-
-.hidden {
- display: none }
-
-a.toc-backref {
- text-decoration: none ;
- color: black }
-
-blockquote.epigraph {
- margin: 2em 5em ; }
-
-dl.docutils dd {
- margin-bottom: 0.5em }
-
-/* Uncomment (and remove this text!) to get bold-faced definition list terms
-dl.docutils dt {
- font-weight: bold }
-*/
-
-div.abstract {
- margin: 2em 5em }
-
-div.abstract p.topic-title {
- font-weight: bold ;
- text-align: center }
-
-div.admonition, div.attention, div.caution, div.danger, div.error,
-div.hint, div.important, div.note, div.tip, div.warning {
- margin: 2em ;
- border: medium outset ;
- padding: 1em }
-
-div.admonition p.admonition-title, div.hint p.admonition-title,
-div.important p.admonition-title, div.note p.admonition-title,
-div.tip p.admonition-title {
- font-weight: bold ;
- font-family: sans-serif }
-
-div.attention p.admonition-title, div.caution p.admonition-title,
-div.danger p.admonition-title, div.error p.admonition-title,
-div.warning p.admonition-title {
- color: red ;
- font-weight: bold ;
- font-family: sans-serif }
-
-/* Uncomment (and remove this text!) to get reduced vertical space in
- compound paragraphs.
-div.compound .compound-first, div.compound .compound-middle {
- margin-bottom: 0.5em }
-
-div.compound .compound-last, div.compound .compound-middle {
- margin-top: 0.5em }
-*/
-
-div.dedication {
- margin: 2em 5em ;
- text-align: center ;
- font-style: italic }
-
-div.dedication p.topic-title {
- font-weight: bold ;
- font-style: normal }
-
-div.figure {
- margin-left: 2em }
-
-div.footer, div.header {
- clear: both;
- font-size: smaller }
-
-div.line-block {
- display: block ;
- margin-top: 1em ;
- margin-bottom: 1em }
-
-div.line-block div.line-block {
- margin-top: 0 ;
- margin-bottom: 0 ;
- margin-left: 1.5em }
-
-div.sidebar {
- margin-left: 1em ;
- border: medium outset ;
- padding: 1em ;
- background-color: #ffffee ;
- width: 40% ;
- float: right ;
- clear: right }
-
-div.sidebar p.rubric {
- font-family: sans-serif ;
- font-size: medium }
-
-div.system-messages {
- margin: 5em }
-
-div.system-messages h1 {
- color: red }
-
-div.system-message {
- border: medium outset ;
- padding: 1em }
-
-div.system-message p.system-message-title {
- color: red ;
- font-weight: bold }
-
-div.topic {
- margin: 2em }
-
-h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
-h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
- margin-top: 0.4em }
-
-h1.title {
- text-align: center }
-
-h2.subtitle {
- text-align: center }
-
-hr.docutils {
- width: 75% }
-
-img.align-left {
- clear: left }
-
-img.align-right {
- clear: right }
-
-img.borderless {
- border: 0 }
-
-ol.simple, ul.simple {
- margin-bottom: 1em }
-
-ol.arabic {
- list-style: decimal }
-
-ol.loweralpha {
- list-style: lower-alpha }
-
-ol.upperalpha {
- list-style: upper-alpha }
-
-ol.lowerroman {
- list-style: lower-roman }
-
-ol.upperroman {
- list-style: upper-roman }
-
-p.attribution {
- text-align: right ;
- margin-left: 50% }
-
-p.caption {
- font-style: italic }
-
-p.credits {
- font-style: italic ;
- font-size: smaller }
-
-p.label {
- white-space: nowrap }
-
-p.rubric {
- font-weight: bold ;
- font-size: larger ;
- color: maroon ;
- text-align: center }
-
-p.sidebar-title {
- font-family: sans-serif ;
- font-weight: bold ;
- font-size: larger }
-
-p.sidebar-subtitle {
- font-family: sans-serif ;
- font-weight: bold }
-
-p.topic-title {
- font-weight: bold }
-
-pre.address {
- margin-bottom: 0 ;
- margin-top: 0 ;
- font-family: serif ;
- font-size: 100% }
-
-pre.line-block {
- font-family: serif ;
- font-size: 100% }
-
-pre.literal-block, pre.doctest-block {
- margin-left: 2em ;
- margin-right: 2em ;
- background-color: #eeeeee }
-
-span.classifier {
- font-family: sans-serif ;
- font-style: oblique }
-
-span.classifier-delimiter {
- font-family: sans-serif ;
- font-weight: bold }
-
-span.interpreted {
- font-family: sans-serif }
-
-span.option {
- white-space: nowrap }
-
-span.pre {
- white-space: pre }
-
-span.problematic {
- color: red }
-
-span.section-subtitle {
- /* font-size relative to parent (h1..h6 element) */
- font-size: 80% }
-
-table.citation {
- border-left: solid thin gray }
-
-table.docinfo {
- margin: 2em 4em }
-
-table.docutils {
- margin-top: 0.5em ;
- margin-bottom: 0.5em }
-
-table.footnote {
- border-left: solid thin black }
-
-table.docutils td, table.docutils th,
-table.docinfo td, table.docinfo th {
- padding-left: 0.5em ;
- padding-right: 0.5em ;
- vertical-align: top }
-
-table.docutils th.field-name, table.docinfo th.docinfo-name {
- font-weight: bold ;
- text-align: left ;
- white-space: nowrap ;
- padding-left: 0 }
-
-h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
-h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
- font-size: 100% }
-
-tt.docutils {
- background-color: #eeeeee }
-
-ul.auto-toc {
- list-style-type: none }
-
-</style>
-</head>
-<body>
-<div class="document" id="boost-range-mfc-atl-extension">
-<h1 class="title"><img alt="Boost" src="../../ptr_container/doc/boost.png" /> Range MFC/ATL Extension</h1>
-<table class="docinfo" frame="void" rules="none">
-<col class="docinfo-name" />
-<col class="docinfo-content" />
-<tbody valign="top">
-<tr><th class="docinfo-name">Author:</th>
-<td>Shunsuke Sogame</td></tr>
-<tr><th class="docinfo-name">Contact:</th>
-<td><a class="first last reference" href="mailto:mb2act@yahoo.co.jp">mb2act@yahoo.co.jp</a></td></tr>
-<tr><th class="docinfo-name">Date:</th>
-<td>26th of May 2006</td></tr>
-<tr><th class="docinfo-name">Copyright:</th>
-<td>Shunsuke Sogame 2005-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see <a class="reference" href="http://www.boost.org/LICENSE_1_0.txt">LICENSE_1_0.txt</a>).</td></tr>
-</tbody>
-</table>
-<div class="section">
-<h1><a id="overview" name="overview">Overview</a></h1>
-Boost.Range MFC/ATL Extension provides <a class="reference" href="../index.html">Boost.Range</a> support for MFC/ATL collection and string types.
-<pre class="literal-block">
-CTypedPtrArray<CPtrArray, CList<CString> *> myArray;
-...
-BOOST_FOREACH (CList<CString> *theList, myArray)
-{
- BOOST_FOREACH (CString& str, *theList)
- {
- boost::to_upper(str);
- std::sort(boost::begin(str), boost::end(str));
- ...
- }
-}
-</pre>
-<ul class="simple">
-<li><a class="reference" href="#requirements">Requirements</a></li>
-<li><a class="reference" href="#mfc-ranges">MFC Ranges</a></li>
-<li><a class="reference" href="#atl-ranges">ATL Ranges</a></li>
-<li><a class="reference" href="#const-ranges">const Ranges</a></li>
-<li><a class="reference" href="#references">References</a></li>
-</ul>
-</div>
-<div class="section">
-<h1><a id="requirements" name="requirements">Requirements</a></h1>
-<ul class="simple">
-<li><a class="reference" href="http://www.boost.org/">Boost C++ Libraries Version 1.34.0</a> or later (no compilation required)</li>
-<li>Visual C++ 7.1 or Visual C++ 8.0</li>
-</ul>
-</div>
-<div class="section">
-<h1><a id="mfc-ranges" name="mfc-ranges">MFC Ranges</a></h1>
-If the <tt class="docutils literal"><boost/range/mfc.hpp></tt> is included before or after <a class="reference" href="../index.html">Boost.Range</a> headers,
-the MFC collections and strings become models of Range.
-The table below lists the Traversal Category and <tt class="docutils literal">range_reference</tt> of MFC ranges.
-<table border="1" class="docutils">
-<colgroup>
-<col width="34%" />
-<col width="21%" />
-<col width="45%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th class="head"><tt class="docutils literal">Range</tt></th>
-<th class="head">Traversal Category</th>
-<th class="head"><tt class="docutils literal">range_reference<Range>::type</tt></th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="docutils literal">CArray<T,A></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">T&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CList<T,A></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal">T&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CMap<K,AK,M,AM></tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal">Range::CPair&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CTypedPtrArray<B,T*></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">T* const</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CTypedPtrList<B,T*></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal">T* const</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CTypedPtrMap<B,T*,V*></tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal">std::pair<T*,V*> const</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CByteArray</tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">BYTE&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CDWordArray</tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">DWORD&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CObArray</tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">CObject* &</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CPtrArray</tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">void* &</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CStringArray</tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">CString&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CUIntArray</tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">UINT&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CWordArray</tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">WORD&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CObList</tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal">CObject* &</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CPtrList</tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal">void* &</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CStringList</tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal">CString&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CMapPtrToWord</tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal">std::pair<void*,WORD> const</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CMapPtrToPtr</tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal">std::pair<void*,void*> const</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CMapStringToOb</tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal">std::pair<String,CObject*> const</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CMapStringToString</tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal">Range::CPair&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CMapWordToOb</tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal">std::pair<WORD,CObject*> const</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CMapWordToPtr</tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal">std::pair<WORD,void*> const</tt></td>
-</tr>
-</tbody>
-</table>
-Other <a class="reference" href="../index.html">Boost.Range</a> metafunctions are defined by the following.
-Let <tt class="docutils literal">Range</tt> be any type listed above and <tt class="docutils literal">ReF</tt> be the same as <tt class="docutils literal">range_reference<Range>::type</tt>.
-<tt class="docutils literal">range_value<Range>::type</tt> is the same as <tt class="docutils literal">remove_reference<remove_const<Ref>::type>::type</tt>,
-<tt class="docutils literal">range_difference<Range>::type</tt> is the same as <tt class="docutils literal">std::ptrdiff_t</tt>, and
-<tt class="docutils literal">range_pointer<Range>::type</tt> is the same as <tt class="docutils literal">add_pointer<remove_reference<Ref>::type>::type</tt>.
-As for <tt class="docutils literal">const Range</tt>, see <a class="reference" href="#const-ranges">const Ranges</a>.
-</div>
-<div class="section">
-<h1><a id="atl-ranges" name="atl-ranges">ATL Ranges</a></h1>
-If the <tt class="docutils literal"><boost/range/atl.hpp></tt> is included before or after <a class="reference" href="../index.html">Boost.Range</a> headers,
-the ATL collections and strings become models of Range.
-The table below lists the Traversal Category and <tt class="docutils literal">range_reference</tt> of ATL ranges.
-<table border="1" class="docutils">
-<colgroup>
-<col width="34%" />
-<col width="21%" />
-<col width="45%" />
-</colgroup>
-<thead valign="bottom">
-<tr><th class="head"><tt class="docutils literal">Range</tt></th>
-<th class="head">Traversal Category</th>
-<th class="head"><tt class="docutils literal">range_reference<Range>::type</tt></th>
-</tr>
-</thead>
-<tbody valign="top">
-<tr><td><tt class="docutils literal">CAtlArray<E,ET></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">E&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CAutoPtrArray<E></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">E&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CInterfaceArray<I,pi></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">CComQIPtr<I,pi>&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CAtlList<E,ET></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal">E&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CAutoPtrList<E></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal">E&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CHeapPtrList<E,A></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal">E&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CInterfaceList<I,pi></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal">CComQIPtr<I,pi>&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CAtlMap<K,V,KT,VT></tt></td>
-<td>Forward</td>
-<td><tt class="docutils literal">Range::CPair&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CRBTree<K,V,KT,VT></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal">Range::CPair&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CRBMap<K,V,KT,VT></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal">Range::CPair&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CRBMultiMap<K,V,KT,VT></tt></td>
-<td>Bidirectional</td>
-<td><tt class="docutils literal">Range::CPair&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CSimpleStringT<B,b></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">B&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CStringT<B,ST></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">B&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CFixedStringT<S,n></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">range_reference<S>::type</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CStringT<B,ST></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">B&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CComBSTR</tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">OLECHAR&</tt></td>
-</tr>
-<tr><td><tt class="docutils literal">CSimpleArray<T,TE></tt></td>
-<td>Random Access</td>
-<td><tt class="docutils literal">T&</tt></td>
-</tr>
-</tbody>
-</table>
-Other <a class="reference" href="../index.html">Boost.Range</a> metafunctions are defined by the following.
-Let <tt class="docutils literal">Range</tt> be any type listed above and <tt class="docutils literal">ReF</tt> be the same as <tt class="docutils literal">range_reference<Range>::type</tt>.
-<tt class="docutils literal">range_value<Range>::type</tt> is the same as <tt class="docutils literal">remove_reference<Ref>::type</tt>,
-<tt class="docutils literal">range_difference<Range>::type</tt> is the same as <tt class="docutils literal">std::ptrdiff_t</tt>, and
-<tt class="docutils literal">range_pointer<Range>::type</tt> is the same as <tt class="docutils literal">add_pointer<remove_reference<Ref>::type>::type</tt>.
-As for <tt class="docutils literal">const Range</tt>, see <a class="reference" href="#const-ranges">const Ranges</a>.
-</div>
-<div class="section">
-<h1><a id="const-ranges" name="const-ranges">const Ranges</a></h1>
-<tt class="docutils literal">range_reference<const Range>::type</tt> is defined by the following algorithm.
-Let <tt class="docutils literal">Range</tt> be any type listed above and <tt class="docutils literal">ReF</tt> be the same as <tt class="docutils literal">range_reference<Range>::type</tt>.
-<pre class="literal-block">
-if (Range is CObArray || Range is CObList)
- return CObject const * &
-else if (Range is CPtrArray || Range is CPtrList)
- return void const * &
-else if (there is a type X such that X& is the same as ReF)
- return X const &
-else if (there is a type X such that X* const is the same as ReF)
- return X const * const
-else
- return ReF
-</pre>
-Other <a class="reference" href="../index.html">Boost.Range</a> metafunctions are defined by the following.
-<tt class="docutils literal">range_value<const Range>::type</tt> is the same as <tt class="docutils literal">range_value<Range>::type</tt>,
-<tt class="docutils literal">range_difference<const Range>::type</tt> is the same as <tt class="docutils literal">std::ptrdiff_t</tt>, and
-<tt class="docutils literal">range_pointer<const Range>::type</tt> is the same as <tt class="docutils literal">add_pointer<remove_reference<range_reference<const Range>::type>::type>::type</tt>.
-</div>
-<div class="section">
-<h1><a id="references" name="references">References</a></h1>
-<ul class="simple">
-<li><a class="reference" href="../index.html">Boost.Range</a></li>
-<li><a class="reference" href="http://msdn2.microsoft.com/en-us/library/942860sh.aspx">MFC Collections</a></li>
-<li><a class="reference" href="http://msdn2.microsoft.com/en-US/library/15e672bd.aspx">ATL Collection Classes</a></li>
-</ul>
-</div>
-</div>
-</body>
-</html>

Deleted: branches/release/libs/range/doc/portability.html
==============================================================================
--- branches/release/libs/range/doc/portability.html 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
+++ (empty file)
@@ -1,103 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
- <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
- <title>Boost.Range Portability </title>
- <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
- <body>
-
- <table border="0" >
- <tr>
- <td ><img src="../../../boost.png" border="0" ></td>
- <td ><h1 align="center">Boost.Range</h1></td>
- </tr>
- </table>
-
- <h2>Portability</h2><a name="Portability" ></a>
-
- 
- A huge effort has been made to port the library to as many compilers as possible.
- 
-
- 
- Full support for built-in arrays require that the compiler supports class
- template partial specialization. For non-conforming compilers there might be a
- chance that it works anyway thanks to workarounds in the type traits library.
- 
- Visual C++ 6/7.0 has a limited support for arrays: as long as the arrays
- are of built-in type it should work.
- 
- 
- Notice also that some compilers cannot do function template ordering properly.
- In that case one must rely on <a
- href="boost_range.html#range_iterator"><code >range_iterator</code></a>
- and a single function definition instead of overloaded versions for const and
- non-const arguments.
-
- So if one cares about old compilers, one should not pass rvalues to the
- functions.
- 
-
- 
- For maximum portability you should follow these guidelines:
-
- <ol>
- <li>
- do not use built-in arrays,
- <li>
- do not pass rvalues to <a
- href="boost_range.html#begin"><code>begin()</code></a>, <a
- href="boost_range.html#end"><code>end()</code></a> and <a href="utility_class.html#iter_range">
- <code>iterator_range</code></a> Range constructors and assignment operators,
- <li>
- use const_begin()
- and const_end()
- whenever your code by intention is read-only; this will also solve
- most rvalue problems,
- <li>
- do not rely on ADL:
- <ul>
- <li>
- if you overload functions, include that header before the headers in this
- library,
- <li>
- put all overloads in namespace <code>boost</code>.
- </ul>
-
- </ol>
- 
-
- <hr>
- 
- © <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
- 
-
- 
- Distributed under the Boost Software License, Version 1.0. (See
- accompanying file LICENSE_1_0.txt or copy
- at <a href=
- "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
- >
-
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
-
-
- </body>
-</html>
-

Deleted: branches/release/libs/range/doc/range.html
==============================================================================
--- branches/release/libs/range/doc/range.html 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
+++ (empty file)
@@ -1,379 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-<HTML>
-
-<Head>
- <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
- <Title>Range Concepts</Title>
- <link rel="stylesheet" href="style.css" type="text/css">
-</HEAD>
-
- <table border="0" >
- <tr>
- <td ><img src="../../../boost.png" border="0" ></td>
- <td ><h1 align="center">Boost.Range </h1></td>
- </tr>
- </table>
-
- <h2>Range concepts </h2>
-
- <ul>
- <li>
- Overview
- <li>
- Single Pass Range
- <li>
- Forward Range
- <li>
- Bidirectional Range
- <li>
- Random Access Range
- <li>
- Concept Checking
- </ul>
-
- <a name="overview"></a>
- <hr>
- <h3>Overview</h3>
-
- 
- A Range is a concept similar to the STL <a
- href="http://www.sgi.com/Technology/STL/Container.html">Container</a> concept. A
- Range provides iterators for accessing a half-open range
-<code>[first,one_past_last)</code> of elements and provides
- information about the number of elements in the Range. However, a Range has
- much fewer requirements than a Container.
- 
- 
- The motivation for the Range concept is
- that there are many useful Container-like types that do not meet the full
- requirements of Container, and many algorithms that can be written with this
- reduced set of requirements. In particular, a Range does not necessarily
-
- <ul>
- <li>
- own the elements that can be accessed through it,
- <li>
- have copy semantics,
- 
- </ul>
-
-
- Because of the second requirement, a Range object must be passed by
- (const or non-const) reference in generic code.
-
- 
- 
- The operations that can be performed on a Range is dependent on the
- <a href="../../iterator/doc/new-iter-concepts.html#iterator-traversal-concepts-lib-iterator-traversal">traversal
-category</a> of the underlying iterator type. Therefore
- the range concepts are named to reflect which traversal category their
- iterators support. See also <a href="style.html">terminology and style
- guidelines.</a> for more information about naming of ranges.
-
- The concepts described below specifies associated types as
-metafunctions and all
-functions as free-standing functions to allow for a layer of indirection. 
-
-
-
- <hr>
- <a name="single_pass_range"></a>
- <H2>Single Pass Range</H2>
-
- <h3>Notation</h3>
- <Table>
- <TR>
- <TD VAlign="top"><code>X</code></TD>
- <TD VAlign="top">A type that is a model of Single Pass Range.</TD>
- </TR>
- <TR>
- <TD VAlign="top"><code>a</code></TD>
- <TD VAlign="top">Object of type <code>X</code>.</TD>
- </TR>
- </table>
-
-
- <h3>Description</h3>
- 
- A range X where <code>boost::range_iterator<X>::type</code> is a model of <a
-href="../../iterator/doc/new-iter-concepts.html#single-pass-iterators-lib-single-pass-iterators">
-Single Pass Iterator</a>
-
- 
-
-
- <h3>Associated types</h3>
-
- <table border="1" cellpadding="5">
-
- <TR>
- <TD VAlign="top">Iterator type</TD>
- <TD VAlign="top"><code>boost::range_iterator<X>::type</code></TD>
- <TD VAlign="top">The type of iterator used to iterate through a Range's elements.
- The iterator's value type is expected to be the Range's value type. A
- conversion from the iterator type to the const iterator type must exist.
- </TR>
- <TR>
- <TD VAlign="top">Const iterator type</TD>
- <TD VAlign="top"><code>boost::range_iterator<const X>::type</code></TD>
- <TD VAlign="top">A type of iterator that may be used to examine, but not to
- modify, a Range's elements.</TD>
- </TR>
- 
- </table>
-
-
- <h3>Valid expressions</h3>
-
- The following expressions must be valid.
- 
-
- <Table border="1" cellpadding="5">
- <TR>
- <TH>Name</TH>
- <TH>Expression</TH>
- <TH>Return type</TH>
- </TR>
- <TR>
- <TD VAlign="top">Beginning of range</TD>
- <TD VAlign="top"><code>boost::begin(a)</code></TD>
- <TD VAlign="top"><code>boost::range_iterator<X>::type</code> if
-<code>a</code> is mutable, <code>boost::range_iterator<const X>::type</code>
-otherwise</TD> </TR>
- <TR>
- <TD VAlign="top">End of range</TD>
- <TD VAlign="top"><code>boost::end(a)</code></TD>
- <TD VAlign="top"><code>boost::range_iterator<X>::type</code> if
-<code>a</code> is mutable, <code>boost::range_iterator<const X>::type</code>
-otherwise</TD>
- </TR>
-
- </table>
- <h3>Expression semantics</h3>
-
- <Table border>
- <TR>
- <TH>Expression</TH>
- <TH>Semantics</TH>
- <TH>Postcondition</TH>
- </TR>
- <TR>
- <TD VAlign="top"><code>boost::begin(a)</code></TD>
- <TD VAlign="top">Returns an iterator pointing to the first element in the Range.</TD>
- <TD VAlign="top"><code>boost::begin(a)</code> is either dereferenceable or past-the-end.
- It is past-the-end if and only if <code>boost::distance(a) == 0</code>.</TD>
- </TR>
- <TR>
- <TD VAlign="top"><code>boost::end(a)</code></TD>
- <TD VAlign="top">Returns an iterator pointing one past the last element in the
- Range.</TD>
- <TD VAlign="top"><code>boost::end(a)</code> is past-the-end.</TD>
- </TR>
-
- </table>
-
- <h3>Complexity guarantees</h3>
-
- <code>boost::end(a)</code> is at most amortized linear time, <code>boost::begin(a)</code> is
- amortized constant time. For most practical
- purposes, one can expect both to be amortized constant time.
-
- <h3>Invariants</h3>
- <Table border>
- <TR>
- <TD VAlign="top">Valid range</TD>
- <TD VAlign="top">For any Range <code>a</code>, <code>[boost::begin(a),boost::end(a))</code> is
- a valid range, that is, <code>boost::end(a)</code> is reachable from <code>boost::begin(a)</code>
- in a finite number of increments.</TD>
- </TR>
- <TR>
- <TD VAlign="top">Completeness</TD>
- <TD VAlign="top">An algorithm that iterates through the range <code>[boost::begin(a),boost::end(a))</code>
- will pass through every element of <code>a</code>.</TD>
- </tr>
- </table>
-
-
- <h3>See also</h3>
- <a
- href="boost_range.html#minimal_interface">Extending the library for UDTs </a>
- <a href="boost_range.html#boost::rang_difference">Implementation of
- metafunctions </a>
-
- <a href="boost_range.html#begin">Implementation of
- functions </a>
- 
- Container
- 
-
-
- <hr>
- <a name=forward_range></a><h2>Forward Range</h2>
-
- <h3>Notation</h3>
- <Table>
- <TR>
- <TD VAlign="top"><code>X</code></TD>
- <TD VAlign="top">A type that is a model of Forward Range.</TD>
- </TR>
- <TR>
- <TD VAlign="top"><code>a</code></TD>
- <TD VAlign="top">Object of type <code>X</code>.</TD>
- </TR>
- </table>
-
- <h3>Description</h3>
- 
- A range <code>X</code> where <code>boost::range_iterator<X>::type</code> is a model
-of <a
-href="../../iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators">Forward Traversal Iterator</a>
- 
-
- <h3>Refinement of</h3> <a href="#single_pass_range">Single Pass
-Range</a>
-
- 
-
- <hr>
-
- <a name="bidirectional_range"></a><h2>Bidirectional Range</h2>
-
- <h3>Notation</h3>
- <Table>
- <TR>
- <TD VAlign="top"><code>X</code></TD>
- <TD VAlign="top">A type that is a model of Bidirectional Range.</TD>
- </TR>
- <TR>
- <TD VAlign="top"><code>a</code></TD>
- <TD VAlign="top">Object of type <code>X</code>.</TD>
- </TR>
- </table>
-
- <h3>Description</h3> This concept provides access to iterators that traverse in
- both directions (forward and reverse). The
-<code>boost::range_iterator<X>::type</code> iterator must meet all of the requirements
-of <a
-href="../../iterator/doc/new-iter-concepts.html#bidirectional-traversal-iterator
-s-lib-bidirectional-traversal-iterators">Bidirectional Traversal Iterator.</a>
-
- <h3>Refinement of</h3> Forward Range
-
-
-
-
- <hr>
-
- <a name=random_access_range></a><h2>Random Access Range</h2>
- <h3>Description</h3>
- 
- A range <code>X</code> where <code>boost::range_iterator<X>::type</code> is a model
-of <a
-
-href="../../iterator/doc/new-iter-concepts.html#random-access-traversal-iterators
--lib-random-access-traversal-iterators">Random Access Traversal Iterator</a>
- 
-
- <h3>Refinement of</h3>
- 
- Bidirectional Range
- 
-
- <hr>
-
- <a name=concept_checking></a><h2>Concept Checking</h2>
-
- Each of the range concepts has a corresponding concept checking
- class in the file <code><boost/range/concepts.hpp></code>. These classes may be
- used in conjunction with the <a
- href="../../concept_check/concept_check.htm">Boost Concept
- Check</a> library to insure that the type of a template parameter
- is compatible with a range concept. If not, a meaningful compile
- time error is generated. Checks are provided for the range
- concepts related to iterator traversal categories. For example,
- the following line checks that the type <code>T</code> models the
- ForwardRange concept.
-
- <pre>
- function_requires<ForwardRangeConcept<T> >();
- </pre>
-
- An additional concept check is required for the value access
- property of the range based on the range's iterator type. For
- example to check for a ForwardReadableRange, the following code is
- required.
-
- <pre>
- function_requires<ForwardRangeConcept<T> >();
- function_requires<
- ReadableIteratorConcept<
- typename range_iterator<T>::type
- >
- >();
- </pre>
-
- The following range concept checking classes are provided.
- <ul>
- <li>
- Class <code>SinglePassRangeConcept</code> checks for <a
- href="#single_pass_range">Single Pass Range</a>
- <li>
- Class <code>ForwardRangeConcept</code> checks for <a
- href="#forward_range">Forward Range</a>
- <li>
- Class <code>BidirectionalRangeConcept</code> checks for <a
- href="#bidirectional_range">Bidirectional Range</a>
- <li>
- Class <code>RandomAccessRangeConcept</code> checks for <a
- href="#random_access_range">Random Access Range</a>
- </ul>
-
- <h3>See also</h3>
- Range Terminology and style guidelines
- Iterator Concepts
- Boost Concept Check library
-
- <hr>
- 
- © <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
- 
-
- 
- Distributed under the Boost Software License, Version 1.0. (See
- accompanying file LICENSE_1_0.txt or copy
- at <a href=
- "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
-
- </BODY>
-</HTML>

Deleted: branches/release/libs/range/doc/style.html
==============================================================================
--- branches/release/libs/range/doc/style.html 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
+++ (empty file)
@@ -1,132 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
- <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
- <title>Boost.Range Terminology and Style Guidelines </title>
- <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
- <body>
-
- <table border="0" >
- <tr>
- <td ><img src="../../../boost.png" border="0" ></td>
- <td ><h1 align="center">Boost.Range </h1></td>
- </tr>
- </table>
-
- <h2>Terminology and style guidelines </h2>
-
- 
- The use of a consistent terminology is as important for Ranges
- and range-based algorithms as it is for iterators and iterator-based algorithms.
- If a conventional set of names are adopted, we can avoid misunderstandings and
- write generic function prototypes that are self-documenting.
- 
-
- 
- Since ranges are characterized by a specific underlying iterator type, we get a
- type of range for each type of iterator. Hence we can speak of the following
- types of ranges:
- <ul>
- <li>
- Value access category:
- <ul>
- <li>
- Readable Range
- <li>
- Writeable Range
- <li>
- Swappable Range
- <li>
- Lvalue Range
- </ul>
- <li>
- Traversal category:
- <ul>
- <li>
- Single Pass Range
- <li>
- Forward Range
- <li>
- Bidirectional Range <li>
- Random Access Range </ul>
- </ul>
- Notice how we have used the categories from the <a href="../../iterator/doc/new-iter-concepts.html">new
- style iterators</a>.
-
- 
- Notice that an iterator (and therefore an range) has one traversal
- property and one or more properties from the value access category. So in
- reality we will mostly talk about mixtures such as
- <ul>
- <li>
- Random Access Readable Writeable Range
- <li>
- Forward Lvalue Range
- </ul>
- By convention, we should always specify the traversal property first as
- done above. This seems reasonable since there will only be one traversal
- property, but perhaps many value access properties.
- 
-
- 
- It might, however, be reasonable to specify only one category if the other
- category does not matter. For example, the <a
- href="utility_class.html#iter_range">iterator_range</a> can be constructed from
- a Forward Range. This means that we do not care about what value access
- properties the Range has. Similarly, a Readable Range will be one that has the
- lowest possible traversal property (Single Pass).
- 
-
- 
- As another example, consider how we specify the interface of <code>std::sort()</code>.
- Algorithms are usually more cumbersome to specify the interface of since both traversal
- and value access properties must be exactly defined. The iterator-based
- version looks like this:
-
- <pre>
- template< class RandomAccessTraversalReadableWritableIterator >
- void sort( RandomAccessTraversalReadableWritableIterator first,
- RandomAccessTraversalReadableWritableIterator last );
- </pre>
- For ranges the interface becomes
-
- <pre>
- template< class RandomAccessReadableWritableRange >
- void sort( RandomAccessReadableWritableRange& r );
- </pre>
- 
- 
-
- 
-
- <hr>
- 
- © <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
- 
-
- 
- Distributed under the Boost Software License, Version 1.0. (See
- accompanying file LICENSE_1_0.txt or copy
- at <a href=
- "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
-
-
- </body>
-</html>
-

Deleted: branches/release/libs/range/doc/upgrading.html
==============================================================================
--- branches/release/libs/range/doc/upgrading.html 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
+++ (empty file)
@@ -1,78 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
- <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
- <title>Boost.Range Upgrading </title> <link rel="stylesheet"
- href="style.css" type="text/css">
-</head>
-
- <body>
-
- <table border="0" >
- <tr>
- <td ><img src="../../../boost.png" border="0" ></td>
- <td ><h1 align="center">Boost.Range </h1></td>
- </tr>
- </table>
-
- <h2 >Upgrading from Boost v. 1.34.*</h2><a name="v1.34" ></a>
- 
- Boost v. 1.35 introduced some larger refactorings of the library:
- 
- <ul >
- <li>Direct support for character arrays was abandoned in favor of
- uniform treatment of all arrays. Instead string algorithms can use
- the new function <a
- href="boost_range.html#as_literal">as_literal()</a>.</li>
- <li><a
- href="boost_range.html#size">boost::size()</a> now requires a Random Access Range. The old behavior is provided as <a
- href="boost_range.html#distance">boost::distance()</a> </li>
- <li> <code>range_size<T>::type</code> has been completely removed
- in favor of <code>range_difference<T>::type</code>
- <li>
- <code>boost_range_begin()</code> and <code>boost_range_end()</code>
- have been renamed <code>range_begin()</code> and <code>range_begin()</code>, respectively.</li>
-
-
- <li><code>range_result_iterator<T>::type</code> and
- <code>range_reverse_result_iterator<T>::type</code> are have
- been renamed
- <code>range_iterator<T>::type</code> and
- <code>range_reverse_iterator<T>::type</code>.
- </li>
- <li>The procedure that makes a custom type work with the library
- has been greatly simplified. See <a
- href="boost_range.html#minimal_interface">extending the library </a>
- for details.</li>
- </ul>
-
-
- <hr>
- 
- © <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
- 
-
- 
- Distributed under the Boost Software License, Version 1.0. (See
- accompanying file LICENSE_1_0.txt or copy at <a href=
- "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
- 
-
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
-
-
- </body>
-</html>
-

Deleted: branches/release/libs/range/doc/utility_class.html
==============================================================================
--- branches/release/libs/range/doc/utility_class.html 2010-04-10 11:25:56 EDT (Sat, 10 Apr 2010)
+++ (empty file)
@@ -1,380 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
-
-<html>
-<head>
- <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
- <title>Boost.Range Utilities </title>
- <link rel="stylesheet" href="style.css" type="text/css">
-</head>
-
- <body>
- <table border="0" >
- <tr>
- <td ><img src="../../../boost.png" border="0" ></td>
- <td ><h1 align="center">Boost.Range</h1></td>
- </tr>
- </table>
-
- <h2>Utilities</h2>
- 
- Having an abstraction that encapsulates a pair of iterators is very useful. The
- standard library uses <code>std::pair</code> in some circumstances, but that
- class is cumbersome to use because we need to specify two template arguments,
- and for all range algorithm purposes we must enforce the two template arguments
- to be the same. Moreover, <code>std::pair<iterator,iterator></code> is hardly
- self-documenting whereas more domain specific class names are. Therefore these
- two classes are provided:
-
- <ul>
- <li>
- Class iterator_range
- <li>
- Class sub_range
- </ul>
-
- The <code>iterator_range</code> class is templated on a <a
- href="../../iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators">Forward
- Traversal Iterator</a> and should be used whenever fairly general code is needed.
- The <code>sub_range</code> class is templated on a <a
- href="range.html#forward_range">Forward Range</a> and it is less general,
- but a bit easier to use since its template
- argument is easier to specify. The biggest difference is, however, that a
- <code>sub_range</code> can propagate constness because it knows what a
-corresponding <code>const_iterator</code> is. 
-
- 
- Both classes can be used as ranges since they implement the <a
- href="boost_range.html#minimal_interface">minimal interface</a>
- required for this to work automatically.
- 
-
- <hr>
- <a name=iter_range></a> <h1>Class <code>iterator_range</code></h1>
- 
- The intention of the <code>iterator_range</code> class is to encapsulate two
- iterators so they fulfill the <a
- href="range.html#forward_range">Forward Range</a> concept. A few other
- functions are also provided for convenience.
- 
- 
- If the template argument is not a model of Forward Traversal Iterator, one can
- still use a subset of the interface. In particular, <code>size()</code> requires
- Random Access Iterators whereas <code>empty()</code> only requires Single
- Pass Iterators.
- 
-
- 
- Recall that many default constructed iterators
- are singular and hence can only be assigned, but not compared or
- incremented or anything. Likewise, if one creates a default constructed
- <code>iterator_range</code>, then one have to be careful about not doing
- anything besides copying. 
-
- <h3>Synopsis</h3>
-
- <pre>
-namespace boost
-{
- template< class ForwardTraversalIterator >
- class iterator_range
- {
- public: // Forward Range types
- typedef ForwardTraversalIterator iterator;
- typedef ForwardTraversalIterator const_iterator;
- typedef iterator_difference<iterator>::type difference_type;
-
- public: // construction, assignment
- template< class ForwardTraversalIterator2 >
- iterator_range( ForwardTraversalIterator2 Begin, ForwardTraversalIterator2 End );
-
- template< class ForwardRange >
- iterator_range( ForwardRange& r );
-
- template< class ForwardRange >
- iterator_range( const ForwardRange& r );
-
- template< class ForwardRange >
- iterator_range& operator=( ForwardRange& r );
-
- template< class ForwardRange >
- iterator_range& operator=( const ForwardRange& r );
-
- public: // Forward Range functions
- iterator begin() const;
- iterator end() const;
- difference_type size() const;
- bool empty() const;
-
- public: // convenience
- operator unspecified_bool_type() const;
- bool equal( const iterator_range& ) const;
- reference front() const;
- reference back() const;
- iterator_range& advance_begin( difference_type n );
- iterator_range& advance_end( difference_type n );
- // for Random Access Range only: 
- reference operator[]( difference_type at ) const;
- value_type operator()( difference_type at ) const;
- };
-
- // stream output
- template< class ForwardTraversalIterator, class T, class Traits >
- std::basic_ostream<T,Traits>&
- operator<<( std::basic_ostream<T,Traits>& Os,
- const iterator_range<ForwardTraversalIterator>& r );
-
- // comparison
- template< class ForwardTraversalIterator, class ForwardTraversalIterator2 >
- bool operator==( const iterator_range<ForwardTraversalIterator>& l,
- const iterator_range<ForwardTraversalIterator2>& r );
-
- template< class ForwardTraversalIterator, class ForwardRange >
- bool operator==( const iterator_range<ForwardTraversalIterator>& l,
- const ForwardRange& r );
-
- template< class ForwardTraversalIterator, class ForwardRange >
- bool operator==( const ForwardRange& l,
- const iterator_range<ForwardTraversalIterator>& r );
-
- template< class ForwardTraversalIterator, class ForwardTraversalIterator2 >
- bool operator!=( const iterator_range<ForwardTraversalIterator>& l,
- const iterator_range<ForwardTraversalIterator2>& r );
-
- template< class ForwardTraversalIterator, class ForwardRange >
- bool operator!=( const iterator_range<ForwardTraversalIterator>& l,
- const ForwardRange& r );
-
- template< class ForwardTraversalIterator, class ForwardRange >
- bool operator!=( const ForwardRange& l,
- const iterator_range<ForwardTraversalIterator>& r );
-
- template< class ForwardTraversalIterator, class ForwardTraversalIterator2 >
- bool operator<( const iterator_range<ForwardTraversalIterator>& l,
- const iterator_range<ForwardTraversalIterator2>& r );
-
- template< class ForwardTraversalIterator, class ForwardRange >
- bool operator<( const iterator_range<ForwardTraversalIterator>& l,
- const ForwardRange& r );
-
- template< class ForwardTraversalIterator, class ForwardRange >
- bool operator<( const ForwardRange& l,
- const iterator_range<ForwardTraversalIterator>& r );
-
- // external construction
- template< class ForwardTraversalIterator >
- iterator_range< ForwardTraversalIterator >
- make_iterator_range( ForwardTraversalIterator Begin,
- ForwardTraversalIterator End );
-
- template< class ForwardRange >
- iterator_range< typename range_iterator<ForwardRange>::type >
- make_iterator_range( ForwardRange& r );
-
- template< class ForwardRange >
- iterator_range< typename range_iterator<const ForwardRange>::type >
- make_iterator_range( const ForwardRange& r );
- 
- template< class Range >
- iterator_range< typename range_iterator<Range>::type >
- make_iterator_range( Range& r,
- typename range_difference<Range>::type advance_begin,
- typename range_difference<Range>::type advance_end );
- 
- template< class Range >
- iterator_range< typename range_iterator<const Range>::type >
- make_iterator_range( const Range& r,
- typename range_difference<Range>::type advance_begin,
- typename range_difference<Range>::type advance_end );
-
- // convenience
- template< class Sequence, class ForwardRange >
- Sequence <a href="#copy_range">copy_range</a>( const ForwardRange& r );
- 
-} // namespace 'boost'
- </pre>
-
-
- If an instance of
-<code>iterator_range</code> is constructed by a client with two iterators, the
-client must ensure that the two iterators delimit a valid closed-open range
-<code>[begin,end)</code>.
- 
-
-
-It is worth noticing that the templated constructors and assignment operators
-allow conversion from <code>iterator_range<iterator></code> to
-<code>iterator_range<const_iterator></code>. Similarly, since the comparison
-operators have two template arguments, we can compare ranges whenever the
-iterators are comparable; for example when we are dealing with const and
-non-const iterators from the same container. 
-
- <h3>Details member functions</h3>
-
-
-<a name="unspecified_bool"></a>
-<code>operator unspecified_bool_type() const; </code>
- <blockquote>
-Returns <code>!empty();</code>
- </blockquote>
-
-
-
-<a name="equal"></a>
-<code>bool equal( iterator_range& r ) const;</code>
-<blockquote>
- Returns <code>begin() == r.begin() && end() == r.end();</code>
-</blockquote>
-
-
- <h3>Details functions</h3>
-
-
-<a name="comparison"></a>
-<code>bool operator==( const ForwardRange1& l, const ForwardRange2& r );</code>
-<blockquote>
- Returns <code>size(l) != size(r) ? false : std::equal( begin(l), end(l), begin(r) );</code> </blockquote> 
-<code>bool operator!=( const ForwardRange1& l, const ForwardRange2& r );</code>
-<blockquote>
- Returns <code>!( l == r );</code>
-</blockquote>
-<code>bool operator<( const ForwardRange1& l, const ForwardRange2& r );</code>
-<blockquote>
- Returns <code>std::lexicographical_compare( begin(l), end(l), begin(r), end(r) );</code> </blockquote>
-
-
-<a name="make_iterator_range"></a>
-<pre>
-iterator_range make_iterator_range( Range& r,
- typename range_difference<Range>::type advance_begin,
- typename range_difference<Range>::type advance_end );
-</pre>
-<blockquote>
- Effects:
-<pre>
-iterator new_begin = begin( r ),
-iterator new_end = end( r );
-std::advance( new_begin, advance_begin );
-std::advance( new_end, advance_end );
-return make_iterator_range( new_begin, new_end );
-</pre>
-</blockquote>
-
-<a name="copy_range"></a>
-<code>Sequence copy_range( const ForwardRange& r );</code>
-<blockquote>
- Returns <code>Sequence( begin(r), end(r) );</code>
-</blockquote>
-
-
-<hr> <a name=sub_range></a>
-<h1>Class <code>sub_range</code></h1>
-
-The <code>sub_range</code> class inherits all its functionality
-from the iterator_range class.
-The <code>sub_range</code> class is often easier to use because
-one must specify the Forward Range
-template argument instead of an iterator. Moreover, the <code>sub_range</code>
-class can propagate constness since it knows what a corresponding
-<code>const_iterator</code> is.
-
-<h3>Synopsis</h3>
-
-<pre>
-namespace boost
-{
- template< class ForwardRange >
- class sub_range : public iterator_range< typename range_iterator<ForwardRange>::type >
- {
- public: 
- typedef typename range_iterator<ForwardRange>::type iterator;
- typedef typename range_iterator<const ForwardRange>::type const_iterator;
- typedef typename iterator_difference<iterator>::type difference_type;
-
-
- public: // construction, assignment
- template< class ForwardTraversalIterator >
- sub_range( ForwardTraversalIterator Begin, ForwardTraversalIterator End );
-
- template< class ForwardRange2 >
- sub_range( ForwardRange2& r );
-
- template< class ForwardRange2 >
- sub_range( const ForwardRange2& r );
-
- template< class ForwardRange2 >
- sub_range& operator=( ForwardRange2& r );
-
- template< class ForwardRange2 >
- sub_range& operator=( const ForwardRange2& r );
- 
- public: // Forward Range functions
- iterator begin();
- const_iterator begin() const;
- iterator end();
- const_iterator end() const;
-
- public: // convenience
- value_type& front();
- const value_type& front() const;
- value_type& back();
- const value_type& back() const;
- // for Random Access Range only: 
- value_type& operator[]( difference_type at );
- const value_type& operator[]( difference_type at ) const;
-
- public:
- // rest of interface inherited from iterator_range
- };
- 
-} // namespace 'boost'
-</pre>
-
- 
- The class should be trivial to use as seen below.
- Imagine that we have an algorithm that searches for a sub-string in a string.
- The
- result is an <code>iterator_range</code>, that delimits the match. We need to
-store the result
- from this algorithm. Here is an example of how we can do it with and without
-<code>sub_range</code>
- <pre>
- std::string str("hello");
- iterator_range<std::string::iterator> ir = find_first( str, as_literal("ll") );
- sub_range<std::string> sub = find_first( str, as_literal("ll") );
-</pre>
- 
-
- <hr>
- 
- © <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
- 
-
- 
- Distributed under the Boost Software License, Version 1.0. (See
- accompanying file LICENSE_1_0.txt or copy
- at <a href=
- "http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)
- 
-
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
- 
-
-
- </body>
-</html>
-

Next message: joel_at_[hidden]: "[Boost-commit] svn:boost r61182 - trunk/libs/spirit/example/scheme/test"
Previous message: atompkins_at_[hidden]: "[Boost-commit] svn:boost r61180 - in branches/release: boost/uuid libs/uuid"

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