forked from boostorg/range
Boost.Range remove deprecated html documentation.
[SVN r61148]
This commit is contained in:
Neil Groves
@ -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><br>
|
|
||||||
Boost.Range
|
|
||||||
</h1>
|
|
||||||
</td>
|
|
||||||
</tr>
|
|
||||||
</table>
|
|
||||||
<h2>Synopsis and Reference
|
|
||||||
</h2>
|
|
||||||
<ul>
|
|
||||||
<li>
|
|
||||||
<a href="#overview">Overview</a>
|
|
||||||
<li>
|
|
||||||
<a href="#Synopsis">Synopsis</a>
|
|
||||||
<li>
|
|
||||||
<a href="#Semantics">Semantics</a>
|
|
||||||
<li>
|
|
||||||
<a href="#minimal_interface">Extending the library</a></li>
|
|
||||||
</ul>
|
|
||||||
<hr size="1">
|
|
||||||
<a name="overview"></a>
|
|
||||||
<h3>Overview</h3>
|
|
||||||
<p>
|
|
||||||
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>
|
|
||||||
.
|
|
||||||
<P></P>
|
|
||||||
<p>
|
|
||||||
Please also see <a href="range.html">Range concepts</a> for more details.
|
|
||||||
</p>
|
|
||||||
<a name="Synopsis"></a>
|
|
||||||
<h3>Synopsis</h3>
|
|
||||||
<p>
|
|
||||||
<pre>
|
|
||||||
<span class=keyword>namespace </span><span class=identifier>boost</span>
|
|
||||||
<span class=special>{
|
|
||||||
</span><span class=comment>//
|
|
||||||
// Single Pass Range metafunctions
|
|
||||||
//
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword>struct </span><a href="#range_iterator"><span
|
|
||||||
class=identifier>range_iterator</span></a><span class=special>;
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword>struct </span><a href="#range_value"><span
|
|
||||||
class=identifier>range_value</span></a><span class=special>;
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword>struct </span><a href="#range_reference"><span
|
|
||||||
class=identifier>range_reference</span></a><span class=special>;
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword>struct </span><a href="#range_pointer"><span
|
|
||||||
class=identifier>range_pointer</span></a><span class=special>;
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword>struct </span><a href="#range_category"><span
|
|
||||||
class=identifier>range_category</span></a><span class=special>;
|
|
||||||
|
|
||||||
</span><span class=comment>//
|
|
||||||
// Forward Range metafunctions
|
|
||||||
//
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword>struct </span><a href="#range_difference"><span
|
|
||||||
class=identifier>range_difference</span></a><span class=special>;
|
|
||||||
|
|
||||||
</span><span class=comment>//
|
|
||||||
// Bidirectional Range metafunctions
|
|
||||||
//
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword>struct </span><a
|
|
||||||
href="#range_reverse_iterator"><span
|
|
||||||
class=identifier>range_reverse_iterator</span></a><span class=special>;
|
|
||||||
|
|
||||||
</span><span class=comment>//
|
|
||||||
// Single Pass Range functions
|
|
||||||
//
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword></span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type
|
|
||||||
</span><a href="#begin"><span class=identifier>begin</span></a><span class=special>( </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword></span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=keyword>const </span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type
|
|
||||||
</span><a href="#begin"><span class=identifier>begin</span></a><span class=special>( </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword></span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type
|
|
||||||
</span><a href="#end"><span class=identifier>end</span></a><span class=special>( </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword></span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=keyword>const </span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type
|
|
||||||
</span><a href="#end"><span class=identifier>end</span></a><span class=special>( </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword></span><span class=keyword>bool
|
|
||||||
</span><a href="#empty"><span class=identifier>empty</span></a><span class=special>( </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=comment>//
|
|
||||||
// Forward Range functions
|
|
||||||
//
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword></span><span class=keyword>typename </span><span class=identifier>range_difference</span><span class=special><</span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type
|
|
||||||
</span><a href="#size"><span class=identifier>distance</span></a><span class=special>( </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=comment>//
|
|
||||||
// Bidirectional Range functions
|
|
||||||
//
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword></span><span class=keyword>typename </span><span class=identifier>range_reverse_iterator</span><span class=special><</span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type
|
|
||||||
</span><a href="#rbegin"><span class=identifier>rbegin</span></a><span class=special>( </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword></span><span class=keyword>typename </span><span class=identifier>range_reverse_iterator</span><span class=special><</span><span class=keyword>const </span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type
|
|
||||||
</span><a href="#rbegin"><span class=identifier>rbegin</span></a><span class=special>( </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword></span><span class=keyword>typename </span><span class=identifier>range_reverse_iterator</span><span class=special><</span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type
|
|
||||||
</span><a href="#rend"><span class=identifier>rend</span></a><span class=special>( </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword></span><span class=keyword>typename </span><span class=identifier>range_reverse_iterator</span><span class=special><</span><span class=keyword>const </span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type
|
|
||||||
</span><a href="#rend"><span class=identifier>rend</span></a><span class=special>( </span><span class=keyword>const </span><span
|
|
||||||
class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
</span>
|
|
||||||
<span class=comment>//
|
|
||||||
// Random Access Range functions
|
|
||||||
//
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword></span><span class=keyword>typename </span><span class=identifier>range_difference</span><span class=special><</span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type
|
|
||||||
</span><a href="#size"><span class=identifier>size</span></a><span class=special>( </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);</span>
|
|
||||||
|
|
||||||
<span class=comment>//
|
|
||||||
// Special const Range functions
|
|
||||||
//
|
|
||||||
</span>
|
|
||||||
<span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>></span>
|
|
||||||
<span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=keyword>const </span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type </span>
|
|
||||||
<a href="#const_begin"><span class=identifier>const_begin</span></a><span class=special>(</span><span class=keyword> const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
</span>
|
|
||||||
<span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>></span>
|
|
||||||
<span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=keyword>const </span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type </span>
|
|
||||||
<a href="#const_end"><span class=identifier>const_end</span></a><span class=special>(</span><span class=keyword> const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
</span>
|
|
||||||
<span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>></span>
|
|
||||||
<span class=keyword>typename </span><span class=identifier>range_reverse_iterator</span><span class=special><</span><span class=keyword>const </span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type </span>
|
|
||||||
<a href="#const_rbegin"><span class=identifier>const_rbegin</span></a><span class=special>(</span><span class=keyword> const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
</span>
|
|
||||||
<span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>></span>
|
|
||||||
<span class=keyword>typename </span><span class=identifier>range_reverse_iterator</span><span class=special><</span><span class=keyword>const </span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type </span>
|
|
||||||
<a href="#const_rend"><span class=identifier>const_rend</span></a><span class=special>( </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>);</span>
|
|
||||||
|
|
||||||
<span class=comment>//
|
|
||||||
// String utilities
|
|
||||||
//</span>
|
|
||||||
|
|
||||||
<span class=keyword>template</span><span class=special><</span> <span class=keyword>class</span> <span class=identifier>T</span> <span class=special>></span>
|
|
||||||
<span class=identifier>iterator_range</span><span class=special><...</span><span class=identifier>see</span> <span class=identifier>below</span><span class=special>...></span>
|
|
||||||
<span class=identifier><a href="#as_literal">as_literal</a></span><span class=special>(</span> <span class=identifier>T</span><span class=special>&</span> <span class=identifier>r</span> <span class=special>);</span>
|
|
||||||
|
|
||||||
<span class=keyword>template</span><span class=special><</span> <span class=keyword>class</span> <span class=identifier>T</span> <span class=special>></span>
|
|
||||||
<span class=identifier>iterator_range</span><span class=special><...</span><span class=identifier>see</span> <span class=identifier>below</span><span class=special>...></span>
|
|
||||||
<span class=identifier><a href="#as_array">as_literal</a></span><span class=special>(</span> <span class=keyword>const</span> <span class=identifier>T</span><span class=special>&</span> <span class=identifier>r</span> <span class=special>);</span>
|
|
||||||
|
|
||||||
<span class=keyword>template</span><span class=special><</span> <span class=keyword>class</span> <span class=identifier>T</span> <span class=special>></span>
|
|
||||||
<span class=identifier>iterator_range</span><span class=special><</span> <span class=keyword>typename</span> <span class=identifier>range_iterator</span><span class=special><</span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type</span> <span class=special>></span>
|
|
||||||
<span class=identifier><a href="#as_array">as_array</a></span><span class=special>(</span> <span class=identifier>T</span><span class=special>&</span> <span class=identifier>r</span> <span class=special>);</span>
|
|
||||||
|
|
||||||
<span class=keyword>template</span><span class=special><</span> <span class=keyword>class</span> <span class=identifier>T</span> <span class=special>></span>
|
|
||||||
<span class=identifier>iterator_range</span><span class=special><</span> <span class=keyword>typename</span> <span class=identifier>range_iterator</span><span class=special><</span><span class=keyword>const</span> <span class=identifier>T</span><span class=special>>::</span><span class=identifier>type</span> <span class=special>></span>
|
|
||||||
<span class=identifier><a href="#as_literal">as_array</a></span><span class=special>(</span> <span class=keyword>const</span> <span class=identifier>T</span><span class=special>&</span> <span class=identifier>r</span> <span class=special>);</span>
|
|
||||||
|
|
||||||
<span class=special>} </span><span class=comment>// namespace 'boost'
|
|
||||||
</span>
|
|
||||||
</pre>
|
|
||||||
<P></P>
|
|
||||||
<a name="Semantics"></a>
|
|
||||||
<h3>Semantics</h3>
|
|
||||||
<h4>notation</h4>
|
|
||||||
<p>
|
|
||||||
<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>
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
<h4>Metafunctions</h4>
|
|
||||||
<p>
|
|
||||||
<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><br>
|
|
||||||
<code>P::first_type</code><br>
|
|
||||||
<code>A*</code><br>
|
|
||||||
|
|
||||||
<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><br>
|
|
||||||
<code>P::first_type</code><br>
|
|
||||||
<code>const A*</code><br>
|
|
||||||
|
|
||||||
<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><br>
|
|
||||||
<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>
|
|
||||||
<br>
|
|
||||||
<td>compile time</td>
|
|
||||||
</tr>
|
|
||||||
</table>
|
|
||||||
</p>
|
|
||||||
<h4>Functions</h4>
|
|
||||||
<p>
|
|
||||||
<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><br>
|
|
||||||
<code>a</code> if <code>a</code> is an array <br>
|
|
||||||
<code>range_begin(x)</code> if that expression would invoke a function found by ADL <br>
|
|
||||||
<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><br>
|
|
||||||
<code>a + sz</code> if <code>a</code> is an array of size <code>sz</code>
|
|
||||||
|
|
||||||
<br>
|
|
||||||
<code>range_end(x)</code> if that expression would invoke a function found by ADL <br>
|
|
||||||
<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><br>
|
|
||||||
<td> constant time <br>
|
|
||||||
</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>
|
|
||||||
<br>
|
|
||||||
<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>
|
|
||||||
<br>
|
|
||||||
<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>
|
|
||||||
<br>
|
|
||||||
<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<U></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>[a,a+sz-1)</code> if <code>a</code> is an array
|
|
||||||
of size <code>sz</code><br>-->
|
|
||||||
<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>
|
|
||||||
<br>
|
|
||||||
<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>
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
The special <code>const_</code>-named functions are useful when you
|
|
||||||
want to document clearly that your code is read-only.
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
<code>as_literal()</code> can be used <i>internally</i> in string
|
|
||||||
algorithm librararies such that arrays of characters are
|
|
||||||
handled correctly.
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
<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.
|
|
||||||
</p>
|
|
||||||
<p>Notice that the above functions should always be called with
|
|
||||||
qualification (<code>boost::</code>) to prevent <i>unintended</i>
|
|
||||||
Argument Dependent Lookup (ADL).
|
|
||||||
</p>
|
|
||||||
<hr>
|
|
||||||
<a name="minimal_interface"></a>
|
|
||||||
<h3>Extending the library</h3>
|
|
||||||
<ul>
|
|
||||||
<li><a href="#method1">Method 1: provide member functions and nested types</a></li>
|
|
||||||
|
|
||||||
<li><a href="#method2">Method 2: provide free-standing functions and specialize metafunctions</a></li>
|
|
||||||
</ul>
|
|
||||||
|
|
||||||
<!--<b>Warning:</b><i> If possible, then prefer method 1 if you want to be absolutely sure your code is forward compatible.
|
|
||||||
</i>-->
|
|
||||||
|
|
||||||
<a name="method1"></a>
|
|
||||||
<h4>Method 1: provide member functions and nested types</h4>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
This procedure assumes that you have control over the types that should be made
|
|
||||||
conformant to a Range concept. If not, see <a href="#method2">method 2</a>.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
The primary templates in this library are implemented such that standard
|
|
||||||
containers will work automatically and so will <code>boost::<a href="../../array/index.html">array</a></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.
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
<table cellpadding="5" border="1">
|
|
||||||
<tr>
|
|
||||||
<th>
|
|
||||||
Member function</th>
|
|
||||||
<th>
|
|
||||||
Related concept</th>
|
|
||||||
<tr>
|
|
||||||
<td><code>begin()</code></td>
|
|
||||||
<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
|
|
||||||
</tr>
|
|
||||||
<tr>
|
|
||||||
<td><code>end()</code>
|
|
||||||
</td>
|
|
||||||
<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
|
|
||||||
</tr>
|
|
||||||
</table>
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
Notice that <code>rbegin()</code> and <code>rend()</code> member functions are
|
|
||||||
not needed even though the container can support bidirectional iteration.
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
The required member types are:
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
<table cellpadding="5" border="1">
|
|
||||||
<tr>
|
|
||||||
<th>
|
|
||||||
Member type</th>
|
|
||||||
<th>
|
|
||||||
Related concept</th>
|
|
||||||
</tr>
|
|
||||||
<tr>
|
|
||||||
<td><code>iterator</code></td>
|
|
||||||
<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
|
|
||||||
</tr>
|
|
||||||
<tr>
|
|
||||||
<td><code>const_iterator</code></td>
|
|
||||||
<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
|
|
||||||
</tr>
|
|
||||||
</table>
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
Again one should notice that member types <code>reverse_iterator</code> and <code>const_reverse_iterator</code>
|
|
||||||
are not needed.
|
|
||||||
</p>
|
|
||||||
<a name="method2"></a>
|
|
||||||
<h4>Method 2: provide free-standing functions and specialize metafunctions</h4>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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 <a href="#method1">method 1</a>.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
<table cellpadding="5" border="1" ID="Table1">
|
|
||||||
<tr>
|
|
||||||
<th>
|
|
||||||
Function</th>
|
|
||||||
<th>
|
|
||||||
Related concept</th>
|
|
||||||
<tr>
|
|
||||||
<td><code>range_begin(x)</code></td>
|
|
||||||
<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
|
|
||||||
</tr>
|
|
||||||
<tr>
|
|
||||||
<td><code>range_end(x)</code>
|
|
||||||
</td>
|
|
||||||
<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
|
|
||||||
</tr>
|
|
||||||
|
|
||||||
</table>
|
|
||||||
</p>
|
|
||||||
<p><code>range_begin()</code> and <code>range_end()</code> must be
|
|
||||||
overloaded for both <code>const</code> and mutable reference arguments.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
You must also specialize two metafunctions for your type <code>X</code>:
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
<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><a href="range.html#single_pass_range">Single Pass Range</a></td>
|
|
||||||
</tr>
|
|
||||||
<tr>
|
|
||||||
<td><code>boost::range_const_iterator</code></td>
|
|
||||||
<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
|
|
||||||
</tr>
|
|
||||||
|
|
||||||
</table>
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
A complete example is given here:
|
|
||||||
</p>
|
|
||||||
<blockquote>
|
|
||||||
<pre>
|
|
||||||
<span class=preprocessor>#include</span> <span class=special><</span><span class=identifier>boost</span><span class=special>/</span><span class=identifier>range</span><span class=special>.</span><span class=identifier>hpp</span><span class=special>></span>
|
|
||||||
<span class=preprocessor>#include</span> <span class=special><</span><span class=identifier>iterator</span><span class=special>></span> <span class=comment>// for std::iterator_traits, std::distance()</span>
|
|
||||||
|
|
||||||
<span class=keyword>namespace</span> <span class=identifier>Foo</span>
|
|
||||||
<span class=special>{</span>
|
|
||||||
<span class=comment>//
|
|
||||||
// Our sample UDT. A 'Pair'
|
|
||||||
// will work as a range when the stored
|
|
||||||
// elements are iterators.
|
|
||||||
//</span>
|
|
||||||
<span class=keyword>template</span><span class=special><</span> <span class=keyword>class</span> <span class=identifier>T</span> <span class=special>></span>
|
|
||||||
<span class=keyword>struct</span> <span class=identifier>Pair</span>
|
|
||||||
<span class=special>{</span>
|
|
||||||
<span class=identifier>T</span> <span class=identifier>first</span><span class=special>,</span> <span class=identifier>last</span><span class=special>;</span>
|
|
||||||
<span class=special>};</span>
|
|
||||||
|
|
||||||
<span class=special>}</span> <span class=comment>// namespace 'Foo'</span>
|
|
||||||
|
|
||||||
<span class=keyword>namespace</span> <span class=identifier>boost</span>
|
|
||||||
<span class=special>{</span>
|
|
||||||
<span class=comment>//
|
|
||||||
// Specialize metafunctions. We must include the range.hpp header.
|
|
||||||
// We must open the 'boost' namespace.
|
|
||||||
//</span>
|
|
||||||
|
|
||||||
<span class=keyword>template</span><span class=special><</span> <span class=keyword>class</span> <span class=identifier>T</span> <span class=special>></span>
|
|
||||||
<span class=keyword>struct</span> <span class=identifier>range_mutable_iterator</span><span class=special><</span> <span class=identifier>Foo</span><span class=special>::</span><span class=identifier>Pair</span><span class=special><</span><span class=identifier>T</span><span class=special>></span> <span class=special>></span>
|
|
||||||
<span class=special>{</span>
|
|
||||||
<span class=keyword>typedef</span> <span class=identifier>T</span> <span class=identifier>type</span><span class=special>;</span>
|
|
||||||
<span class=special>};</span>
|
|
||||||
|
|
||||||
<span class=keyword>template</span><span class=special><</span> <span class=keyword>class</span> <span class=identifier>T</span> <span class=special>></span>
|
|
||||||
<span class=keyword>struct</span> <span class=identifier>range_const_iterator</span><span class=special><</span> <span class=identifier>Foo</span><span class=special>::</span><span class=identifier>Pair</span><span class=special><</span><span class=identifier>T</span><span class=special>></span> <span class=special>></span>
|
|
||||||
<span class=special>{</span>
|
|
||||||
<span class=comment>//
|
|
||||||
// Remark: this is defined similar to 'range_mutable_iterator'
|
|
||||||
// because the 'Pair' type does not distinguish
|
|
||||||
// between an iterator and a const_iterator.
|
|
||||||
//</span>
|
|
||||||
<span class=keyword>typedef</span> <span class=identifier>T</span> <span class=identifier>type</span><span class=special>;</span>
|
|
||||||
<span class=special>};</span>
|
|
||||||
|
|
||||||
<span class=special>}</span> <span class=comment>// namespace 'boost'</span>
|
|
||||||
|
|
||||||
<span class=keyword>namespace</span> <span class=identifier>Foo</span>
|
|
||||||
<span class=special>{</span>
|
|
||||||
<span class=comment>//
|
|
||||||
// The required functions. These should be defined in
|
|
||||||
// the same namespace as 'Pair', in this case
|
|
||||||
// in namespace 'Foo'.
|
|
||||||
//</span>
|
|
||||||
|
|
||||||
<span class=keyword>template</span><span class=special><</span> <span class=keyword>class</span> <span class=identifier>T</span> <span class=special>></span>
|
|
||||||
<span class=keyword>inline</span> <span class=identifier>T</span> <span class=identifier>range_begin</span><span class=special>(</span> <span class=identifier>Pair</span><span class=special><</span><span class=identifier>T</span><span class=special>>&</span> <span class=identifier>x</span> <span class=special>)</span>
|
|
||||||
<span class=special>{</span>
|
|
||||||
<span class=keyword>return</span> <span class=identifier>x</span><span class=special>.</span><span class=identifier>first</span><span class=special>;</span>
|
|
||||||
<span class=special>}</span>
|
|
||||||
|
|
||||||
<span class=keyword>template</span><span class=special><</span> <span class=keyword>class</span> <span class=identifier>T</span> <span class=special>></span>
|
|
||||||
<span class=keyword>inline</span> <span class=identifier>T</span> <span class=identifier>range_begin</span><span class=special>(</span> <span class=keyword>const</span> <span class=identifier>Pair</span><span class=special><</span><span class=identifier>T</span><span class=special>>&</span> <span class=identifier>x</span> <span class=special>)</span>
|
|
||||||
<span class=special>{</span>
|
|
||||||
<span class=keyword>return</span> <span class=identifier>x</span><span class=special>.</span><span class=identifier>first</span><span class=special>;</span>
|
|
||||||
<span class=special>}</span>
|
|
||||||
|
|
||||||
<span class=keyword>template</span><span class=special><</span> <span class=keyword>class</span> <span class=identifier>T</span> <span class=special>></span>
|
|
||||||
<span class=keyword>inline</span> <span class=identifier>T</span> <span class=identifier>range_end</span><span class=special>(</span> <span class=identifier>Pair</span><span class=special><</span><span class=identifier>T</span><span class=special>>&</span> <span class=identifier>x</span> <span class=special>)</span>
|
|
||||||
<span class=special>{</span>
|
|
||||||
<span class=keyword>return</span> <span class=identifier>x</span><span class=special>.</span><span class=identifier>last</span><span class=special>;</span>
|
|
||||||
<span class=special>}</span>
|
|
||||||
|
|
||||||
<span class=keyword>template</span><span class=special><</span> <span class=keyword>class</span> <span class=identifier>T</span> <span class=special>></span>
|
|
||||||
<span class=keyword>inline</span> <span class=identifier>T</span> <span class=identifier>range_end</span><span class=special>(</span> <span class=keyword>const</span> <span class=identifier>Pair</span><span class=special><</span><span class=identifier>T</span><span class=special>>&</span> <span class=identifier>x</span> <span class=special>)</span>
|
|
||||||
<span class=special>{</span>
|
|
||||||
<span class=keyword>return</span> <span class=identifier>x</span><span class=special>.</span><span class=identifier>last</span><span class=special>;</span>
|
|
||||||
<span class=special>}</span>
|
|
||||||
|
|
||||||
<span class=special>}</span> <span class=comment>// namespace 'Foo'</span>
|
|
||||||
|
|
||||||
<span class=preprocessor>#include</span> <span class=special><</span><span class=identifier>vector</span><span class=special>></span>
|
|
||||||
|
|
||||||
<span class=keyword>int</span> <span class=identifier>main</span><span class=special>()</span>
|
|
||||||
<span class=special>{</span>
|
|
||||||
<span class=keyword>typedef</span> <span class=identifier>std</span><span class=special>::</span><span class=identifier>vector</span><span class=special><</span><span class=keyword>int</span><span class=special>>::</span><span class=identifier>iterator</span> <span class=identifier>iter</span><span class=special>;</span>
|
|
||||||
<span class=identifier>std</span><span class=special>::</span><span class=identifier>vector</span><span class=special><</span><span class=keyword>int</span><span class=special>></span> <span class=identifier>vec</span><span class=special>;</span>
|
|
||||||
<span class=identifier>Foo</span><span class=special>::</span><span class=identifier>Pair</span><span class=special><</span><span class=identifier>iter</span><span class=special>></span> <span class=identifier>pair</span> <span class=special>=</span> <span class=special>{</span> <span class=identifier>vec</span><span class=special>.</span><span class=identifier>begin</span><span class=special>(),</span> <span class=identifier>vec</span><span class=special>.</span><span class=identifier>end</span><span class=special>()</span> <span class=special>};</span>
|
|
||||||
<span class=keyword>const</span> <span class=identifier>Foo</span><span class=special>::</span><span class=identifier>Pair</span><span class=special><</span><span class=identifier>iter</span><span class=special>>&</span> <span class=identifier>cpair</span> <span class=special>=</span> <span class=identifier>pair</span><span class=special>;</span>
|
|
||||||
<span class=comment>//
|
|
||||||
// Notice that we call 'begin' etc with qualification.
|
|
||||||
//</span>
|
|
||||||
<span class=identifier>iter</span> <span class=identifier>i</span> <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>begin</span><span class=special>(</span> <span class=identifier>pair</span> <span class=special>);</span>
|
|
||||||
<span class=identifier>iter</span> <span class=identifier>e</span> <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>end</span><span class=special>(</span> <span class=identifier>pair</span> <span class=special>);</span>
|
|
||||||
<span class=identifier>i</span> <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>begin</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>);</span>
|
|
||||||
<span class=identifier>e</span> <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>end</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>);</span>
|
|
||||||
<span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_difference</span><span class=special><</span> <span class=identifier>Foo</span><span class=special>::</span><span class=identifier>Pair</span><span class=special><</span><span class=identifier>iter</span><span class=special>></span> <span class=special>>::</span><span class=identifier>type</span> <span class=identifier>s</span> <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>size</span><span class=special>(</span> <span class=identifier>pair</span> <span class=special>);</span>
|
|
||||||
<span class=identifier>s</span> <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>size</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>);</span>
|
|
||||||
<span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_reverse_iterator</span><span class=special><</span> <span class=identifier>const Foo</span><span class=special>::</span><span class=identifier>Pair</span><span class=special><</span><span class=identifier>iter</span><span class=special>></span> <span class=special>>::</span><span class=identifier>type</span>
|
|
||||||
<span class=identifier>ri</span> <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>rbegin</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>),</span>
|
|
||||||
<span class=identifier>re</span> <span class=special>=</span> <span class=identifier>boost</span><span class=special>::</span><span class=identifier>rend</span><span class=special>(</span> <span class=identifier>cpair</span> <span class=special>);</span>
|
|
||||||
<span class=special>}</span>
|
|
||||||
</pre>
|
|
||||||
</blockquote>
|
|
||||||
|
|
||||||
<hr>
|
|
||||||
<p>
|
|
||||||
© <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>)
|
|
||||||
</p>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
@ -1,70 +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="counting_range"></a> <h1>Function <code>counting_range</code></h1>
|
|
||||||
<p>
|
|
||||||
The intention of the <code>counting_range</code> function is to construct
|
|
||||||
a new range with iterators that are wrapped in a
|
|
||||||
<code>counting_iterator</code> (from Boost.Iterator)
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<h3>Synopsis</h3>
|
|
||||||
|
|
||||||
<pre><span class="keyword">namespace </span><span class="identifier">boost</span>
|
|
||||||
<span class="special">{</span>
|
|
||||||
<span class="keyword">template</span><span class="special">< </span><span class="keyword">class </span><span class="identifier">Incrementable</span><span class="identifier"> </span><span class="special">> <span style="color: #0000ff">inline</span>
|
|
||||||
</span><span class="keyword"></span><span class="identifier">range< counting_iterator<Incrementable> >
|
|
||||||
counting_range(Incrementable first, Incrementable last);
|
|
||||||
|
|
||||||
<span class="keyword">template</span><span class="special">< </span><span class="keyword">class </span><span class="identifier">SinglePassRange</span><span class="identifier"> </span><span class="special">> </span><span class="keyword">inline
|
|
||||||
</span><span class="identifier">range< counting_iterator<<span class="keyword">typename</span> range_iterator<SinglePassRange>::type >
|
|
||||||
counting_range(<span class="keyword">const</span> Range& rng);
|
|
||||||
|
|
||||||
</span><span class="keyword">template</span><span class="special">< </span><span class="keyword">class </span><span class="identifier">SinglePassRange</span><span class="identifier"> </span><span class="special">> <span style="color: #0000ff">inline</span></span>
|
|
||||||
<span class="identifier">range< counting_iterator<<span style="color: #0000ff">typename</span> range_iterator<SinglePassRange>::type >
|
|
||||||
counting_range(Range& rng);
|
|
||||||
</span></span><span class="special"></span><span class="special"></span><span class="special"> </span>
|
|
||||||
<span class="special">} </span><span class="comment">// namespace 'boost'</span>
|
|
||||||
</pre>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
© <a name="Copyright" id="Copyright">Copyright</a> Neil Groves 2009.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>)
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
|
|
||||||
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
|
|
||||||
@ -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>
|
|
||||||
<p >
|
|
||||||
Some examples are given in the accompanying test files:
|
|
||||||
</p>
|
|
||||||
<ul >
|
|
||||||
<li >
|
|
||||||
<a href="../test/string.cpp" target="_self" ><code >string.cpp</code></a>
|
|
||||||
|
|
||||||
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 >
|
|
||||||
<a href="../test/algorithm_example.cpp" target="_self" ><code >algorithm_example.cpp</code></a>
|
|
||||||
|
|
||||||
|
|
||||||
shows the replace example from the introduction.
|
|
||||||
</li>
|
|
||||||
<li> <a href="../test/iterator_range.cpp">iterator_range.cpp</a>
|
|
||||||
<li> <a href="../test/sub_range.cpp">sub_range.cpp</a>
|
|
||||||
<li> <a href="../test/iterator_pair.cpp">iterator_pair.cpp</a>
|
|
||||||
<li> <a href="../test/reversible_range.cpp">reversible_range.cpp</a>
|
|
||||||
<li> <a href="../test/std_container.cpp">std_container.cpp</a>
|
|
||||||
<li> <a href="../test/array.cpp">array.cpp</a>
|
|
||||||
</ul>
|
|
||||||
|
|
||||||
|
|
||||||
<hr>
|
|
||||||
<p>
|
|
||||||
© <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>)
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
|
|
||||||
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
|
|
||||||
145
doc/faq.html
145
doc/faq.html
@ -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>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
<h2 >FAQ</h2> <a name="FAQ" ></a>
|
|
||||||
<ol >
|
|
||||||
<li >
|
|
||||||
<i>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></i>.
|
|
||||||
|
|
||||||
<p >
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
Note that an <a href="utility_class.html#iter_range">iterator_range</a>
|
|
||||||
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. </p>
|
|
||||||
</li>
|
|
||||||
<li >
|
|
||||||
<i>Why is there not supplied more types or more functions?</i>
|
|
||||||
<p >
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
</li>
|
|
||||||
<li >
|
|
||||||
<i>How should I implement generic algorithms for ranges?</i>
|
|
||||||
<p >
|
|
||||||
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 <i>not</i> to expose the iterator version in
|
|
||||||
the public interface.
|
|
||||||
</p>
|
|
||||||
</li>
|
|
||||||
<li>
|
|
||||||
<i>Why is there no Incrementable Range concept?</i>
|
|
||||||
<p>
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
Note also that incrementable iterators are derived from output
|
|
||||||
iterators and so there exist no output range.
|
|
||||||
</p>
|
|
||||||
</li>
|
|
||||||
<!--
|
|
||||||
<li>
|
|
||||||
<i>Should I use qualified syntax, for example
|
|
||||||
<blockquote><pre>
|
|
||||||
<span class=identifier>boost</span><span class=special>::</span><span class=identifier>begin</span><span class=special>( </span><span class=identifier>r </span><span class=special>); </span>
|
|
||||||
</pre></blockquote>
|
|
||||||
instead of
|
|
||||||
<blockquote>
|
|
||||||
<pre><span class=keyword>using </span><span class=keyword>namespace </span><span class=identifier>boost</span><span class=special>;</span>
|
|
||||||
<span class=identifier>begin</span><span class=special>( </span><span class=identifier>r </span><span class=special>)</span></pre></blockquote>
|
|
||||||
when calling functions in this library? If so, can I still rely on argument
|
|
||||||
dependent lookup (ADL) to kick in?</i>
|
|
||||||
<p>
|
|
||||||
The answer to the first question is that "it's up to you". The
|
|
||||||
answer to the second question is Yes. Normally qualified syntax
|
|
||||||
disables ADL, but the functions are implemented in a special
|
|
||||||
manner that preserves ADL properties. The trick was explained by
|
|
||||||
Daniel Frey on comp.lang.std.c++ in the thread "Whence Swap" and
|
|
||||||
it is best explained by some code: <blockquote>
|
|
||||||
<pre>
|
|
||||||
<span class=keyword>namespace </span><span class=identifier>boost</span>
|
|
||||||
<span class=special>{
|
|
||||||
</span><span class=keyword>namespace </span><span class=identifier>range_detail
|
|
||||||
</span><span class=special>{
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=identifier>T</span><span class=special>>:</span><span class=identifier>type </span><span class=identifier>begin</span><span class=special>( </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>)
|
|
||||||
</span><span class=special>{ </span><span class=comment>/* normal implementation */ </span><span class=special>}
|
|
||||||
</span><span class=special>}
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=identifier>T</span><span class=special>>::</span><span class=identifier>type </span><span class=identifier>begin</span><span class=special>( </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>r </span><span class=special>)
|
|
||||||
</span><span class=special>{
|
|
||||||
</span><span class=comment>//
|
|
||||||
// Create ADL hook
|
|
||||||
//
|
|
||||||
</span><span class=keyword>using </span><span class=identifier>range_detail</span><span class=special>::</span><span class=identifier>begin</span><span class=special>;
|
|
||||||
</span><span class=keyword>return </span><span class=identifier>begin</span><span class=special>( </span><span class=identifier>r </span><span class=special>);
|
|
||||||
</span><span class=special>}</span>
|
|
||||||
<span class=special>} </span>
|
|
||||||
</pre>
|
|
||||||
</blockquote>
|
|
||||||
Cool indeed!
|
|
||||||
</p>
|
|
||||||
-->
|
|
||||||
|
|
||||||
</ol>
|
|
||||||
|
|
||||||
|
|
||||||
<hr>
|
|
||||||
<p>
|
|
||||||
© <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>)
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
|
|
||||||
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
|
|
||||||
202
doc/headers.html
202
doc/headers.html
@ -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>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
<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 ><a href="boost_range.html#range_value" >range_value</a></td>
|
|
||||||
<td><a href="range.html#single_pass_range">Single Pass Range</a></td>
|
|
||||||
</tr>
|
|
||||||
<tr >
|
|
||||||
<td ><code ><boost/range/iterator.hpp></code></td>
|
|
||||||
<td ><a href="boost_range.html#range_iterator"
|
|
||||||
>range_iterator</a></td>
|
|
||||||
<td><a href="range.html#single_pass_range">Single Pass Range</a> </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><a href="range.html#single_pass_range">Single Pass Range</a> </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><a href="range.html#single_pass_range">Single Pass Range</a> </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><a href="range.html#forward_range">Forward Range</a> </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 ><a href="boost_range.html#range_reverse_iterator" >range_reverse_iterator</a></td>
|
|
||||||
<td><a href="range.html#bidirectional_range">Bidirectional Range</a> </td>
|
|
||||||
</tr>
|
|
||||||
<tr >
|
|
||||||
<td ><code ><boost/range/begin.hpp></code></td>
|
|
||||||
<td >
|
|
||||||
<a href="boost_range.html#begin" >begin</a> and
|
|
||||||
<a href="boost_range.html#const_begin" >const_begin</a>
|
|
||||||
</td>
|
|
||||||
<td><a href="range.html#single_pass_range">Single Pass Range</a> </td>
|
|
||||||
</tr>
|
|
||||||
<tr >
|
|
||||||
<td ><code ><boost/range/end.hpp></code></td>
|
|
||||||
<td >
|
|
||||||
<a href="boost_range.html#end" >end</a> and
|
|
||||||
<a href="boost_range.html#const_end" >const_end</a>
|
|
||||||
</td>
|
|
||||||
<td><a href="range.html#single_pass_range">Single Pass Range</a> </td>
|
|
||||||
</tr>
|
|
||||||
<tr >
|
|
||||||
<td ><code ><boost/range/empty.hpp></code></td>
|
|
||||||
<td ><a href="boost_range.html#empty" >empty</a></td>
|
|
||||||
<td><a href="range.html#single_pass_range">Single Pass Range</a> </td>
|
|
||||||
</tr>
|
|
||||||
<tr >
|
|
||||||
<td ><code ><boost/range/distance.hpp></code></td>
|
|
||||||
<td ><a href="boost_range.html#distance" >distance</a></td>
|
|
||||||
<td><a href="range.html#forward_range">Forward Range</a> </td>
|
|
||||||
</tr>
|
|
||||||
<tr >
|
|
||||||
<td ><code ><boost/range/size.hpp></code></td>
|
|
||||||
<td ><a href="boost_range.html#size" >size</a></td>
|
|
||||||
<td><a href="range.html#random_access_range">Random Access Range</a>
|
|
||||||
</td>
|
|
||||||
</tr>
|
|
||||||
<tr >
|
|
||||||
<td ><code ><boost/range/rbegin.hpp></code></td>
|
|
||||||
<td >
|
|
||||||
<a href="boost_range.html#rbegin" >rbegin</a> and
|
|
||||||
<a href="boost_range.html#const_rbegin" >const_rbegin</a>
|
|
||||||
</td>
|
|
||||||
<td><a href="range.html#bidirectional_range">Bidirectional Range</a> </td>
|
|
||||||
</tr>
|
|
||||||
<tr >
|
|
||||||
<td ><code ><boost/range/rend.hpp></code></td>
|
|
||||||
<td >
|
|
||||||
<a href="boost_range.html#rend" >rend</a> and
|
|
||||||
<a href="boost_range.html#const_rend" >const_rend</a>
|
|
||||||
</td>
|
|
||||||
<td><a href="range.html#bidirectional_range">Bidirectional Range</a> </td>
|
|
||||||
</tr>
|
|
||||||
<tr >
|
|
||||||
<td ><code ><boost/range/as_array.hpp></code></td>
|
|
||||||
<td >
|
|
||||||
<a href="boost_range.html#as_array" >as_array</a>
|
|
||||||
</td>
|
|
||||||
<td>-</td>
|
|
||||||
</tr>
|
|
||||||
<tr >
|
|
||||||
<td ><code ><boost/range/as_literal.hpp></code></td>
|
|
||||||
<td >
|
|
||||||
<a href="boost_range.html#as_literal" >as_literal</a>
|
|
||||||
</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 ><a href="utility_class.html#sub_range" >sub_range</a></td>
|
|
||||||
<td>- </td>
|
|
||||||
</tr>
|
|
||||||
<tr >
|
|
||||||
<td ><code ><boost/range/concepts.hpp></code></td>
|
|
||||||
<td ><a href="range.html#concept_checking" >concept checks</a></td>
|
|
||||||
<td>- </td>
|
|
||||||
</tr>
|
|
||||||
|
|
||||||
</table>
|
|
||||||
<br>
|
|
||||||
</p>
|
|
||||||
|
|
||||||
|
|
||||||
<hr>
|
|
||||||
<p>
|
|
||||||
© <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>)
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
|
|
||||||
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
|
|
||||||
@ -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>
|
|
||||||
<p >
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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. </p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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 <i>range</i> 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>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
The concept checks and their documentation was provided by Daniel Walker.
|
|
||||||
|
|
||||||
<hr>
|
|
||||||
<p>
|
|
||||||
© <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>)
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
|
|
||||||
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
|
|
||||||
@ -1,257 +0,0 @@
|
|||||||
<html>
|
|
||||||
<head>
|
|
||||||
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
|
|
||||||
<title>Introduction and motivation</title>
|
|
||||||
<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
|
|
||||||
<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
|
|
||||||
<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
|
|
||||||
<link rel="up" href="../range_algorithm.html" title="Range Algorithm">
|
|
||||||
<link rel="prev" href="../range_algorithm.html" title="Range Algorithm">
|
|
||||||
<link rel="next" href="range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
|
|
||||||
</head>
|
|
||||||
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
|
|
||||||
<table cellpadding="2" width="100%"><tr>
|
|
||||||
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
|
|
||||||
<td align="center"><a href="../../../../../../../index.html">Home</a></td>
|
|
||||||
<td align="center"><a href="../../../../../../libraries.htm">Libraries</a></td>
|
|
||||||
<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
|
|
||||||
<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
|
|
||||||
<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
|
|
||||||
</tr></table>
|
|
||||||
<hr>
|
|
||||||
<div class="spirit-nav">
|
|
||||||
<a accesskey="p" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_mutating_algorithms.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
|
||||||
</div>
|
|
||||||
<div class="section" title="Introduction and motivation">
|
|
||||||
<div class="titlepage"><div><div><h4 class="title">
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_introduction"></a><a class="link" href="range_algorithm_introduction.html" title="Introduction and motivation">
|
|
||||||
Introduction and motivation</a>
|
|
||||||
</h4></div></div></div>
|
|
||||||
<p>
|
|
||||||
In its most simple form a <span class="bold"><strong>Range Algorithm</strong></span>
|
|
||||||
(or range-based algorithm) is simply an iterator-based algorithm where
|
|
||||||
the <span class="emphasis"><em>two</em></span> iterator arguments have been replaced by
|
|
||||||
<span class="emphasis"><em>one</em></span> range argument. For example, we may write
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
|
|
||||||
</p>
|
|
||||||
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
|
|
||||||
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">vector</span><span class="special">></span>
|
|
||||||
|
|
||||||
<span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span> <span class="special">=</span> <span class="special">...;</span>
|
|
||||||
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">);</span>
|
|
||||||
</pre>
|
|
||||||
<p>
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
instead of
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
|
|
||||||
</p>
|
|
||||||
<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
|
|
||||||
</pre>
|
|
||||||
<p>
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
However, the return type of range algorithms is almost always different
|
|
||||||
from that of existing iterator-based algorithms.
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
One group of algorithms, like <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">()</span></code>, will simply return the same range so
|
|
||||||
that we can continue to pass the range around and/or further modify it.
|
|
||||||
Because of this we may write
|
|
||||||
</p>
|
|
||||||
<pre class="programlisting"><span class="identifier">boost</span><span class="special">:</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">));</span>
|
|
||||||
</pre>
|
|
||||||
<p>
|
|
||||||
to first sort the range and then run <code class="computeroutput"><span class="identifier">unique</span><span class="special">()</span></code> on the sorted range.
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
Algorithms like <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">()</span></code>
|
|
||||||
fall into another group of algorithms that return (potentially) narrowed
|
|
||||||
views of the original range. By default <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> returns the range <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">found</span><span class="special">)</span></code>
|
|
||||||
where <code class="computeroutput"><span class="identifier">found</span></code> denotes the
|
|
||||||
iterator returned by <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
Therefore exactly the unique values can be copied by writing
|
|
||||||
</p>
|
|
||||||
<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">)),</span>
|
|
||||||
<span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special"><</span><span class="keyword">int</span><span class="special">>(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">));</span>
|
|
||||||
</pre>
|
|
||||||
<p>
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
Algorithms like <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span></code> usually return the same range:
|
|
||||||
<code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">found</span><span class="special">)</span></code>. However, this behaviour may be changed
|
|
||||||
by supplying the algorithms with a template argument:
|
|
||||||
</p>
|
|
||||||
<div class="informaltable"><table class="table">
|
|
||||||
<colgroup>
|
|
||||||
<col>
|
|
||||||
<col>
|
|
||||||
</colgroup>
|
|
||||||
<thead><tr>
|
|
||||||
<th>
|
|
||||||
<p>
|
|
||||||
Expression
|
|
||||||
</p>
|
|
||||||
</th>
|
|
||||||
<th>
|
|
||||||
<p>
|
|
||||||
Return
|
|
||||||
</p>
|
|
||||||
</th>
|
|
||||||
</tr></thead>
|
|
||||||
<tbody>
|
|
||||||
<tr>
|
|
||||||
<td>
|
|
||||||
<p>
|
|
||||||
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_found</span><span class="special">>(</span><span class="identifier">rng</span><span class="special">)</span></code>
|
|
||||||
</p>
|
|
||||||
</td>
|
|
||||||
<td>
|
|
||||||
<p>
|
|
||||||
returns a single iterator like <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span></code>
|
|
||||||
</p>
|
|
||||||
</td>
|
|
||||||
</tr>
|
|
||||||
<tr>
|
|
||||||
<td>
|
|
||||||
<p>
|
|
||||||
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_begin_found</span><span class="special">>(</span><span class="identifier">rng</span><span class="special">)</span></code>
|
|
||||||
</p>
|
|
||||||
</td>
|
|
||||||
<td>
|
|
||||||
<p>
|
|
||||||
returns the range <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span>
|
|
||||||
<span class="identifier">found</span><span class="special">)</span></code>
|
|
||||||
(this is the default)
|
|
||||||
</p>
|
|
||||||
</td>
|
|
||||||
</tr>
|
|
||||||
<tr>
|
|
||||||
<td>
|
|
||||||
<p>
|
|
||||||
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_begin_next</span><span class="special">>(</span><span class="identifier">rng</span><span class="special">)</span></code>
|
|
||||||
</p>
|
|
||||||
</td>
|
|
||||||
<td>
|
|
||||||
<p>
|
|
||||||
returns the range <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span>
|
|
||||||
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">next</span><span class="special">(</span><span class="identifier">found</span><span class="special">))</span></code>
|
|
||||||
</p>
|
|
||||||
</td>
|
|
||||||
</tr>
|
|
||||||
<tr>
|
|
||||||
<td>
|
|
||||||
<p>
|
|
||||||
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_found_end</span><span class="special">>(</span><span class="identifier">rng</span><span class="special">)</span></code>
|
|
||||||
</p>
|
|
||||||
</td>
|
|
||||||
<td>
|
|
||||||
<p>
|
|
||||||
returns the range <code class="computeroutput"><span class="special">[</span><span class="identifier">found</span><span class="special">,</span>
|
|
||||||
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
|
|
||||||
</p>
|
|
||||||
</td>
|
|
||||||
</tr>
|
|
||||||
<tr>
|
|
||||||
<td>
|
|
||||||
<p>
|
|
||||||
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_next_end</span><span class="special">>(</span><span class="identifier">rng</span><span class="special">)</span></code>
|
|
||||||
</p>
|
|
||||||
</td>
|
|
||||||
<td>
|
|
||||||
<p>
|
|
||||||
returns the range <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">next</span><span class="special">(</span><span class="identifier">found</span><span class="special">),</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
|
|
||||||
</p>
|
|
||||||
</td>
|
|
||||||
</tr>
|
|
||||||
<tr>
|
|
||||||
<td>
|
|
||||||
<p>
|
|
||||||
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_begin_end</span><span class="special">>(</span><span class="identifier">rng</span><span class="special">)</span></code>
|
|
||||||
</p>
|
|
||||||
</td>
|
|
||||||
<td>
|
|
||||||
<p>
|
|
||||||
returns the entire original range.
|
|
||||||
</p>
|
|
||||||
</td>
|
|
||||||
</tr>
|
|
||||||
</tbody>
|
|
||||||
</table></div>
|
|
||||||
<p>
|
|
||||||
This functionality has the following advantages:
|
|
||||||
</p>
|
|
||||||
<div class="orderedlist"><ol class="orderedlist" type="1">
|
|
||||||
<li class="listitem">
|
|
||||||
it allows for <span class="emphasis"><em><span class="bold"><strong>seamless functional-style
|
|
||||||
programming</strong></span></em></span> where you do not need to use named
|
|
||||||
local variables to store intermediate results
|
|
||||||
</li>
|
|
||||||
<li class="listitem">
|
|
||||||
it is very <span class="emphasis"><em><span class="bold"><strong>safe</strong></span></em></span>
|
|
||||||
because the algorithm can verify out-of-bounds conditions and handle
|
|
||||||
tricky conditions that lead to empty ranges
|
|
||||||
</li>
|
|
||||||
</ol></div>
|
|
||||||
<p>
|
|
||||||
For example, consider how easy we may erase the duplicates in a sorted
|
|
||||||
container:
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
|
|
||||||
</p>
|
|
||||||
<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span> <span class="special">=</span> <span class="special">...;</span>
|
|
||||||
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_found_end</span><span class="special">>(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">)));</span>
|
|
||||||
</pre>
|
|
||||||
<p>
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
Notice the use of <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_found_end</span></code>.
|
|
||||||
What if we wanted to erase all the duplicates except one of them? In old-fashined
|
|
||||||
STL-programming we might write
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
|
|
||||||
</p>
|
|
||||||
<pre class="programlisting"><span class="comment">// assume 'vec' is already sorted
|
|
||||||
</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">>::</span><span class="identifier">iterator</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
|
|
||||||
|
|
||||||
<span class="comment">// remember this check or you get into problems
|
|
||||||
</span><span class="keyword">if</span> <span class="special">(</span><span class="identifier">i</span> <span class="special">!=</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">())</span>
|
|
||||||
<span class="special">++</span><span class="identifier">i</span><span class="special">;</span>
|
|
||||||
|
|
||||||
<span class="identifier">vec</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
|
|
||||||
</pre>
|
|
||||||
<p>
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
The same task may be accomplished simply with
|
|
||||||
</p>
|
|
||||||
<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_next_end</span><span class="special">>(</span><span class="identifier">vec</span><span class="special">));</span>
|
|
||||||
</pre>
|
|
||||||
<p>
|
|
||||||
and there is no need to worry about generating an invalid range. Furthermore,
|
|
||||||
if the container is complex, calling <code class="computeroutput"><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code> several times will be more expensive
|
|
||||||
than using a range algorithm.
|
|
||||||
</p>
|
|
||||||
</div>
|
|
||||||
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
|
|
||||||
<td align="left"></td>
|
|
||||||
<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
|
||||||
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" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
|
|
||||||
</p>
|
|
||||||
</div></td>
|
|
||||||
</tr></table>
|
|
||||||
<hr>
|
|
||||||
<div class="spirit-nav">
|
|
||||||
<a accesskey="p" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_mutating_algorithms.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
|
||||||
</div>
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
@ -1,50 +0,0 @@
|
|||||||
<html>
|
|
||||||
<head>
|
|
||||||
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
|
|
||||||
<title>Mutating algorithms</title>
|
|
||||||
<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
|
|
||||||
<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
|
|
||||||
<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
|
|
||||||
<link rel="up" href="../range_algorithm.html" title="Range Algorithm">
|
|
||||||
<link rel="prev" href="range_algorithm_introduction.html" title="Introduction and motivation">
|
|
||||||
<link rel="next" href="range_algorithm_mutating_algorithms/copy.html" title="Range Algorithm - copy">
|
|
||||||
</head>
|
|
||||||
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
|
|
||||||
<table cellpadding="2" width="100%"><tr>
|
|
||||||
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
|
|
||||||
<td align="center"><a href="../../../../../../../index.html">Home</a></td>
|
|
||||||
<td align="center"><a href="../../../../../../libraries.htm">Libraries</a></td>
|
|
||||||
<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
|
|
||||||
<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
|
|
||||||
<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
|
|
||||||
</tr></table>
|
|
||||||
<hr>
|
|
||||||
<div class="spirit-nav">
|
|
||||||
<a accesskey="p" href="range_algorithm_introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_mutating_algorithms/copy.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
|
||||||
</div>
|
|
||||||
<div class="section" title="Mutating algorithms">
|
|
||||||
<div class="titlepage"><div><div><h4 class="title">
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms"></a><a class="link" href="range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
|
|
||||||
Mutating algorithms</a>
|
|
||||||
</h4></div></div></div>
|
|
||||||
<div class="toc"><dl>
|
|
||||||
<dt><span class="section"><a href="range_algorithm_mutating_algorithms/copy.html">
|
|
||||||
Range Algorithm - copy</a></span></dt>
|
|
||||||
<dt><span class="section"><a href="range_algorithm_mutating_algorithms/copy_backward.html">
|
|
||||||
Range Algorithm - copy_backward</a></span></dt>
|
|
||||||
</dl></div>
|
|
||||||
</div>
|
|
||||||
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
|
|
||||||
<td align="left"></td>
|
|
||||||
<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
|
||||||
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" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
|
|
||||||
</p>
|
|
||||||
</div></td>
|
|
||||||
</tr></table>
|
|
||||||
<hr>
|
|
||||||
<div class="spirit-nav">
|
|
||||||
<a accesskey="p" href="range_algorithm_introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_mutating_algorithms/copy.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
|
||||||
</div>
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
@ -1,115 +0,0 @@
|
|||||||
<html>
|
|
||||||
<head>
|
|
||||||
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
|
|
||||||
<title>Range Algorithm - copy</title>
|
|
||||||
<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
|
|
||||||
<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
|
|
||||||
<link rel="home" href="../../../../index.html" title="Chapter 1. Range 2.0">
|
|
||||||
<link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
|
|
||||||
<link rel="prev" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
|
|
||||||
<link rel="next" href="copy_backward.html" title="Range Algorithm - copy_backward">
|
|
||||||
</head>
|
|
||||||
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
|
|
||||||
<table cellpadding="2" width="100%"><tr>
|
|
||||||
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
|
|
||||||
<td align="center"><a href="../../../../../../../../index.html">Home</a></td>
|
|
||||||
<td align="center"><a href="../../../../../../../libraries.htm">Libraries</a></td>
|
|
||||||
<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
|
|
||||||
<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
|
|
||||||
<td align="center"><a href="../../../../../../../../more/index.htm">More</a></td>
|
|
||||||
</tr></table>
|
|
||||||
<hr>
|
|
||||||
<div class="spirit-nav">
|
|
||||||
<a accesskey="p" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
|
||||||
</div>
|
|
||||||
<div class="section" title="Range Algorithm - copy">
|
|
||||||
<div class="titlepage"><div><div><h5 class="title">
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy"></a><a class="link" href="copy.html" title="Range Algorithm - copy">
|
|
||||||
Range Algorithm - copy</a>
|
|
||||||
</h5></div></div></div>
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.prototype"></a><h6>
|
|
||||||
<a name="id2722672"></a>
|
|
||||||
<a class="link" href="copy.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.prototype">Prototype</a>
|
|
||||||
</h6>
|
|
||||||
<p>
|
|
||||||
|
|
||||||
</p>
|
|
||||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">></span>
|
|
||||||
<span class="identifier">OutputIterator</span> <span class="identifier">copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">source_rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>
|
|
||||||
</pre>
|
|
||||||
<p>
|
|
||||||
</p>
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.description"></a><h6>
|
|
||||||
<a name="id2722804"></a>
|
|
||||||
<a class="link" href="copy.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.description">Description</a>
|
|
||||||
</h6>
|
|
||||||
<p>
|
|
||||||
<code class="computeroutput"><span class="identifier">copy</span></code> copies all elements
|
|
||||||
from <code class="computeroutput"><span class="identifier">source_rng</span></code> to the
|
|
||||||
range <code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <span class="identifier">out_it</span>
|
|
||||||
<span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code>. The return value is <code class="computeroutput"><span class="identifier">out_it</span> <span class="special">+</span>
|
|
||||||
<span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code>
|
|
||||||
</p>
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.definition"></a><h6>
|
|
||||||
<a name="id2722938"></a>
|
|
||||||
<a class="link" href="copy.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.definition">Definition</a>
|
|
||||||
</h6>
|
|
||||||
<p>
|
|
||||||
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
|
||||||
</p>
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.requirements"></a><h6>
|
|
||||||
<a name="id2723012"></a>
|
|
||||||
<a class="link" href="copy.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.requirements">Requirements</a>
|
|
||||||
</h6>
|
|
||||||
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
|
|
||||||
<li class="listitem">
|
|
||||||
<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
|
|
||||||
a model of the <code class="computeroutput"><span class="identifier">SinglePassRangeConcept</span></code>.
|
|
||||||
</li>
|
|
||||||
<li class="listitem">
|
|
||||||
<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
|
|
||||||
model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
|
|
||||||
</li>
|
|
||||||
<li class="listitem">
|
|
||||||
The <code class="computeroutput"><span class="identifier">value_type</span></code> of
|
|
||||||
<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
|
|
||||||
convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
|
|
||||||
set of value types.
|
|
||||||
</li>
|
|
||||||
</ul></div>
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.precondition_"></a><h6>
|
|
||||||
<a name="id2723128"></a>
|
|
||||||
<a class="link" href="copy.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.precondition_">Precondition:</a>
|
|
||||||
</h6>
|
|
||||||
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
|
|
||||||
<li class="listitem">
|
|
||||||
<code class="computeroutput"><span class="identifier">out_it</span></code> is not an iterator
|
|
||||||
within the <code class="computeroutput"><span class="identifier">source_rng</span></code>.
|
|
||||||
</li>
|
|
||||||
<li class="listitem">
|
|
||||||
<code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <span class="identifier">out_it</span>
|
|
||||||
<span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code> is a valid range.
|
|
||||||
</li>
|
|
||||||
</ul></div>
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.complexity"></a><h6>
|
|
||||||
<a name="id2723234"></a>
|
|
||||||
<a class="link" href="copy.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy.complexity">Complexity</a>
|
|
||||||
</h6>
|
|
||||||
<p>
|
|
||||||
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code> assignments are performed.
|
|
||||||
</p>
|
|
||||||
</div>
|
|
||||||
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
|
|
||||||
<td align="left"></td>
|
|
||||||
<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
|
||||||
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" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
|
|
||||||
</p>
|
|
||||||
</div></td>
|
|
||||||
</tr></table>
|
|
||||||
<hr>
|
|
||||||
<div class="spirit-nav">
|
|
||||||
<a accesskey="p" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="copy_backward.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
|
||||||
</div>
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
@ -1,124 +0,0 @@
|
|||||||
<html>
|
|
||||||
<head>
|
|
||||||
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
|
|
||||||
<title>Range Algorithm - copy_backward</title>
|
|
||||||
<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
|
|
||||||
<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
|
|
||||||
<link rel="home" href="../../../../index.html" title="Chapter 1. Range 2.0">
|
|
||||||
<link rel="up" href="../range_algorithm_mutating_algorithms.html" title="Mutating algorithms">
|
|
||||||
<link rel="prev" href="copy.html" title="Range Algorithm - copy">
|
|
||||||
<link rel="next" href="../range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
|
|
||||||
</head>
|
|
||||||
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
|
|
||||||
<table cellpadding="2" width="100%"><tr>
|
|
||||||
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
|
|
||||||
<td align="center"><a href="../../../../../../../../index.html">Home</a></td>
|
|
||||||
<td align="center"><a href="../../../../../../../libraries.htm">Libraries</a></td>
|
|
||||||
<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
|
|
||||||
<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
|
|
||||||
<td align="center"><a href="../../../../../../../../more/index.htm">More</a></td>
|
|
||||||
</tr></table>
|
|
||||||
<hr>
|
|
||||||
<div class="spirit-nav">
|
|
||||||
<a accesskey="p" href="copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../range_algorithm_non_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
|
||||||
</div>
|
|
||||||
<div class="section" title="Range Algorithm - copy_backward">
|
|
||||||
<div class="titlepage"><div><div><h5 class="title">
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward"></a><a class="link" href="copy_backward.html" title="Range Algorithm - copy_backward">
|
|
||||||
Range Algorithm - copy_backward</a>
|
|
||||||
</h5></div></div></div>
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.prototype"></a><h6>
|
|
||||||
<a name="id2723305"></a>
|
|
||||||
<a class="link" href="copy_backward.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.prototype">Prototype</a>
|
|
||||||
</h6>
|
|
||||||
<p>
|
|
||||||
|
|
||||||
</p>
|
|
||||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BidirectionalOutputIterator</span><span class="special">></span>
|
|
||||||
<span class="identifier">BidirectionalOutputIterator</span>
|
|
||||||
<span class="identifier">copy_backward</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">source_rng</span><span class="special">,</span>
|
|
||||||
<span class="identifier">BidirectionalOutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>
|
|
||||||
</pre>
|
|
||||||
<p>
|
|
||||||
</p>
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.description"></a><h6>
|
|
||||||
<a name="id2723438"></a>
|
|
||||||
<a class="link" href="copy_backward.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.description">Description</a>
|
|
||||||
</h6>
|
|
||||||
<p>
|
|
||||||
<code class="computeroutput"><span class="identifier">copy_backward</span></code> copies
|
|
||||||
all elements from <code class="computeroutput"><span class="identifier">source_rng</span></code>
|
|
||||||
to the range <code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span>
|
|
||||||
<span class="special">-</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">),</span> <span class="identifier">out_it</span><span class="special">)</span></code>.
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
The values are copied in reverse order. The return value is <code class="computeroutput"><span class="identifier">out_it</span> <span class="special">-</span>
|
|
||||||
<span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code>.
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
Note well that unlike all other standard algorithms <code class="computeroutput"><span class="identifier">out_it</span></code>
|
|
||||||
denotes the <span class="bold"><strong>end</strong></span> of the output sequence.
|
|
||||||
</p>
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.definition"></a><h6>
|
|
||||||
<a name="id2723599"></a>
|
|
||||||
<a class="link" href="copy_backward.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.definition">Definition</a>
|
|
||||||
</h6>
|
|
||||||
<p>
|
|
||||||
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy_backward</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
|
||||||
</p>
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.requirements"></a><h6>
|
|
||||||
<a name="id2723674"></a>
|
|
||||||
<a class="link" href="copy_backward.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.requirements">Requirements</a>
|
|
||||||
</h6>
|
|
||||||
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
|
|
||||||
<li class="listitem">
|
|
||||||
<code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
|
|
||||||
is a model of the <code class="computeroutput"><span class="identifier">SinglePassRangeConcept</span></code>.
|
|
||||||
</li>
|
|
||||||
<li class="listitem">
|
|
||||||
<code class="computeroutput"><span class="identifier">OutputIterator</span></code> is a
|
|
||||||
model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
|
|
||||||
</li>
|
|
||||||
<li class="listitem">
|
|
||||||
The <code class="computeroutput"><span class="identifier">value_type</span></code> of
|
|
||||||
<code class="computeroutput"><span class="identifier">SinglePassRange</span></code> is
|
|
||||||
convertible to a type in <code class="computeroutput"><span class="identifier">OutputIterator</span></code>'s
|
|
||||||
set of value types.
|
|
||||||
</li>
|
|
||||||
</ul></div>
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.precondition_"></a><h6>
|
|
||||||
<a name="id2723791"></a>
|
|
||||||
<a class="link" href="copy_backward.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.precondition_">Precondition:</a>
|
|
||||||
</h6>
|
|
||||||
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
|
|
||||||
<li class="listitem">
|
|
||||||
<code class="computeroutput"><span class="identifier">out_it</span></code> is not an iterator
|
|
||||||
within the <code class="computeroutput"><span class="identifier">source_rng</span></code>.
|
|
||||||
</li>
|
|
||||||
<li class="listitem">
|
|
||||||
<code class="computeroutput"><span class="special">[</span><span class="identifier">out_it</span><span class="special">,</span> <span class="identifier">out_it</span>
|
|
||||||
<span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code> is a valid range.
|
|
||||||
</li>
|
|
||||||
</ul></div>
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.complexity"></a><h6>
|
|
||||||
<a name="id2723899"></a>
|
|
||||||
<a class="link" href="copy_backward.html#range.reference.range_algorithm.range_algorithm_mutating_algorithms.copy_backward.complexity">Complexity</a>
|
|
||||||
</h6>
|
|
||||||
<p>
|
|
||||||
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code> assignments are performed.
|
|
||||||
</p>
|
|
||||||
</div>
|
|
||||||
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
|
|
||||||
<td align="left"></td>
|
|
||||||
<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
|
||||||
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" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
|
|
||||||
</p>
|
|
||||||
</div></td>
|
|
||||||
</tr></table>
|
|
||||||
<hr>
|
|
||||||
<div class="spirit-nav">
|
|
||||||
<a accesskey="p" href="copy.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../range_algorithm_non_mutating_algorithms.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
|
||||||
</div>
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
@ -1,41 +0,0 @@
|
|||||||
<html>
|
|
||||||
<head>
|
|
||||||
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
|
|
||||||
<title></title>
|
|
||||||
<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
|
|
||||||
<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
|
|
||||||
<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
|
|
||||||
<link rel="up" href="../range_algorithm.html" title="Range Algorithm">
|
|
||||||
<link rel="prev" href="range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
|
|
||||||
<link rel="next" href="../extending.html" title="Extending the library">
|
|
||||||
</head>
|
|
||||||
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
|
|
||||||
<table cellpadding="2" width="100%"><tr>
|
|
||||||
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
|
|
||||||
<td align="center"><a href="../../../../../../../index.html">Home</a></td>
|
|
||||||
<td align="center"><a href="../../../../../../libraries.htm">Libraries</a></td>
|
|
||||||
<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
|
|
||||||
<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
|
|
||||||
<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
|
|
||||||
</tr></table>
|
|
||||||
<hr>
|
|
||||||
<div class="spirit-nav">
|
|
||||||
<a accesskey="p" href="range_algorithm_non_mutating_algorithms.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../extending.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
|
||||||
</div>
|
|
||||||
<div class="section"><div class="titlepage"><div><div><h4 class="title">
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_new_algorithms"></a><a class="link" href="range_algorithm_new_algorithms.html">???</a>
|
|
||||||
</h4></div></div></div></div>
|
|
||||||
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
|
|
||||||
<td align="left"></td>
|
|
||||||
<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
|
||||||
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" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
|
|
||||||
</p>
|
|
||||||
</div></td>
|
|
||||||
</tr></table>
|
|
||||||
<hr>
|
|
||||||
<div class="spirit-nav">
|
|
||||||
<a accesskey="p" href="range_algorithm_non_mutating_algorithms.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../extending.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
|
||||||
</div>
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
@ -1,42 +0,0 @@
|
|||||||
<html>
|
|
||||||
<head>
|
|
||||||
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
|
|
||||||
<title>Non-mutating algorithms</title>
|
|
||||||
<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
|
|
||||||
<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
|
|
||||||
<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
|
|
||||||
<link rel="up" href="../range_algorithm.html" title="Range Algorithm">
|
|
||||||
<link rel="prev" href="range_algorithm_mutating_algorithms/copy_backward.html" title="Range Algorithm - copy_backward">
|
|
||||||
<link rel="next" href="range_algorithm_new_algorithms.html" title="">
|
|
||||||
</head>
|
|
||||||
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
|
|
||||||
<table cellpadding="2" width="100%"><tr>
|
|
||||||
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
|
|
||||||
<td align="center"><a href="../../../../../../../index.html">Home</a></td>
|
|
||||||
<td align="center"><a href="../../../../../../libraries.htm">Libraries</a></td>
|
|
||||||
<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
|
|
||||||
<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
|
|
||||||
<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
|
|
||||||
</tr></table>
|
|
||||||
<hr>
|
|
||||||
<div class="spirit-nav">
|
|
||||||
<a accesskey="p" href="range_algorithm_mutating_algorithms/copy_backward.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_new_algorithms.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
|
||||||
</div>
|
|
||||||
<div class="section" title="Non-mutating algorithms"><div class="titlepage"><div><div><h4 class="title">
|
|
||||||
<a name="range.reference.range_algorithm.range_algorithm_non_mutating_algorithms"></a><a class="link" href="range_algorithm_non_mutating_algorithms.html" title="Non-mutating algorithms">
|
|
||||||
Non-mutating algorithms</a>
|
|
||||||
</h4></div></div></div></div>
|
|
||||||
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
|
|
||||||
<td align="left"></td>
|
|
||||||
<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
|
||||||
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" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
|
|
||||||
</p>
|
|
||||||
</div></td>
|
|
||||||
</tr></table>
|
|
||||||
<hr>
|
|
||||||
<div class="spirit-nav">
|
|
||||||
<a accesskey="p" href="range_algorithm_mutating_algorithms/copy_backward.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../range_algorithm.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm_new_algorithms.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
|
||||||
</div>
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
164
doc/intro.html
164
doc/intro.html
@ -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>
|
|
||||||
<p>
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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
|
|
||||||
<i>if a suitable layer of indirection is applied </i>. For
|
|
||||||
example, raw arrays are often suitable for use with generic code that
|
|
||||||
works with containers, provided a suitable adapter is used.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p >
|
|
||||||
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>
|
|
||||||
</p>
|
|
||||||
<p > Below is given a small example (the complete example can be found <a
|
|
||||||
href="../test/algorithm_example.cpp" target="_self" >here</a>): <blockquote>
|
|
||||||
<pre >
|
|
||||||
<span class=comment>
|
|
||||||
//
|
|
||||||
// example: extracting bounds in a generic algorithm
|
|
||||||
//
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardReadableRange</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword>inline </span><span class=keyword>typename </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_iterator</span><span class=special>< </span><span class=identifier>ForwardReadableRange </span><span class=special>>::</span><span class=identifier>type
|
|
||||||
</span><span class=identifier>find</span><span class=special>( </span><span class=identifier>ForwardReadableRange</span><span class=special>& </span><span class=identifier>c</span><span class=special>, </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>value </span><span class=special>)
|
|
||||||
</span><span class=special>{
|
|
||||||
</span><span class=keyword>return </span><span class=identifier>std</span><span class=special>::</span><span class=identifier>find</span><span class=special>( </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>begin</span><span class=special>( </span><span class=identifier>c </span><span class=special>), </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>end</span><span class=special>( </span><span class=identifier>c </span><span class=special>), </span><span class=identifier>value </span><span class=special>);
|
|
||||||
</span><span class=special>}
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardReadableRange</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword>inline </span><span class=keyword>typename </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_iterator</span><span class=special>< </span><span class=keyword>const </span><span
|
|
||||||
class=identifier>ForwardReadableRange </span><span class=special>>::</span><span class=identifier>type
|
|
||||||
</span><span class=identifier>find</span><span class=special>( </span><span class=keyword>const </span><span class=identifier>ForwardReadableRange</span><span class=special>& </span><span class=identifier>c</span><span class=special>, </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>value </span><span class=special>)
|
|
||||||
</span><span class=special>{
|
|
||||||
</span><span class=keyword>return </span><span class=identifier>std</span><span class=special>::</span><span class=identifier>find</span><span class=special>( </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>begin</span><span class=special>( </span><span class=identifier>c </span><span class=special>), </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>end</span><span class=special>( </span><span class=identifier>c </span><span class=special>), </span><span class=identifier>value </span><span class=special>);
|
|
||||||
</span><span class=special>}
|
|
||||||
|
|
||||||
</span><span class=comment>//
|
|
||||||
// replace first value and return its index
|
|
||||||
//
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardReadableWriteableRange</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>T </span><span class=special>>
|
|
||||||
</span><span class=keyword>inline </span><span class=keyword>typename </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_difference</span><span class=special>< </span><span class=identifier>ForwardReadableWriteableRange </span><span class=special>>::</span><span class=identifier>type
|
|
||||||
</span><span class=identifier>my_generic_replace</span><span class=special>( </span><span class=identifier>ForwardReadableWriteableRange</span><span class=special>& </span><span class=identifier>c</span><span class=special>, </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>value</span><span class=special>, </span><span class=keyword>const </span><span class=identifier>T</span><span class=special>& </span><span class=identifier>replacement </span><span class=special>)
|
|
||||||
</span><span class=special>{
|
|
||||||
</span><span class=keyword>typename </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>range_iterator</span><span class=special>< </span><span class=identifier>ForwardReadableWriteableRange </span><span class=special>>::</span><span class=identifier>type </span><span class=identifier>found </span><span class=special>= </span><span class=identifier>find</span><span class=special>( </span><span class=identifier>c</span><span class=special>, </span><span class=identifier>value </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>if</span><span class=special>( </span><span class=identifier>found </span><span class=special>!= </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>end</span><span class=special>( </span><span class=identifier>c </span><span class=special>) </span><span class=special>)
|
|
||||||
</span><span class=special>*</span><span class=identifier>found </span><span class=special>= </span><span class=identifier>replacement</span><span class=special>;
|
|
||||||
</span><span class=keyword>return </span><span class=identifier>std</span><span class=special>::</span><span class=identifier>distance</span><span class=special>( </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>begin</span><span class=special>( </span><span class=identifier>c </span><span class=special>), </span><span class=identifier>found </span><span class=special>);
|
|
||||||
</span><span class=special>}
|
|
||||||
|
|
||||||
</span><span class=comment>//
|
|
||||||
// usage
|
|
||||||
//
|
|
||||||
</span><span class=keyword>const </span><span class=keyword>int </span><span class=identifier>N </span><span class=special>= </span><span class=number>5</span><span class=special>;
|
|
||||||
</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>vector</span><span class=special><</span><span class=keyword>int</span><span class=special>> </span><span class=identifier>my_vector</span><span class=special>;
|
|
||||||
</span><span class=keyword>int </span><span class=identifier>values</span><span class=special>[] </span><span class=special>= </span><span class=special>{ </span><span class=number>1</span><span class=special>,</span><span class=number>2</span><span class=special>,</span><span class=number>3</span><span class=special>,</span><span class=number>4</span><span class=special>,</span><span class=number>5</span><span class=special>,</span><span class=number>6</span><span class=special>,</span><span class=number>7</span><span class=special>,</span><span class=number>8</span><span class=special>,</span><span class=number>9 </span><span class=special>};
|
|
||||||
</span>
|
|
||||||
<span class=identifier>my_vector</span><span class=special>.</span><span
|
|
||||||
class=identifier>assign</span><span class=special>( </span><span class=identifier>values</span><span class=special>, </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>end</span><span class=special>( </span><span class=identifier>values </span><span class=special>) </span><span class=special>);</span>
|
|
||||||
<span class=keyword>typedef </span><span class=identifier>std</span><span class=special>::</span><span class=identifier>vector</span><span class=special><</span><span class=keyword>int</span><span class=special>>::</span><span class=identifier>iterator </span><span class=identifier>iterator</span><span class=special>;
|
|
||||||
</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>pair</span><span class=special><</span><span class=identifier>iterator</span><span class=special>,</span><span class=identifier>iterator</span><span class=special>> </span><span class=identifier>my_view</span><span class=special>( </span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>begin</span><span class=special>( </span><span class=identifier>my_vector </span><span class=special>),
|
|
||||||
</span><span class=identifier>boost</span><span class=special>::</span><span class=identifier>begin</span><span class=special>( </span><span class=identifier>my_vector </span><span class=special>) </span><span class=special>+ </span><span class=identifier>N </span><span class=special>);
|
|
||||||
</span><span class=keyword>char </span><span class=identifier>str_val</span><span class=special>[] </span><span class=special>= </span><span class=string>"a string"</span><span class=special>;
|
|
||||||
</span><span class=keyword>char</span><span class=special>* </span><span class=identifier>str </span><span class=special>= </span><span class=identifier>str_val</span><span class=special>;
|
|
||||||
|
|
||||||
</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>cout </span><span class=special><< </span><span class=identifier>my_generic_replace</span><span class=special>( </span><span class=identifier>my_vector</span><span class=special>, </span><span class=number>4</span><span class=special>, </span><span class=number>2 </span><span class=special>);
|
|
||||||
</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>cout </span><span class=special><< </span><span class=identifier>my_generic_replace</span><span class=special>( </span><span class=identifier>my_view</span><span class=special>, </span><span class=number>4</span><span class=special>, </span><span class=number>2 </span><span class=special>);
|
|
||||||
</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>cout </span><span class=special><< </span><span class=identifier>my_generic_replace</span><span class=special>( </span><span class=identifier>str</span><span class=special>, </span><span class=literal>'a'</span><span class=special>, </span><span class=literal>'b' </span><span class=special>);
|
|
||||||
</span>
|
|
||||||
<span class=comment>// prints '3', '5' and '0' </span>
|
|
||||||
</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> ).
|
|
||||||
|
|
||||||
</p>
|
|
||||||
|
|
||||||
|
|
||||||
<hr>
|
|
||||||
<p>
|
|
||||||
© <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>)
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
|
|
||||||
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
|
|
||||||
@ -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>
|
|
||||||
<p>
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<h3>Synopsis</h3>
|
|
||||||
|
|
||||||
<pre>
|
|
||||||
<span class="keyword">namespace </span><span class="identifier">boost</span>
|
|
||||||
<span class="special">{</span>
|
|
||||||
<span class="keyword">template</span><span class="special">< </span><span class="keyword">class </span><span class="identifier">
|
|
||||||
Type,</span><span class="identifier"> <span style="color: #0000ff">class <span style="color: #000000">
|
|
||||||
Elem</span><span style="color: #000000">, <span style="color: #0000ff">class <span
|
|
||||||
style="color: #000000">Traits </span></span></span></span></span><span class="special">> <span style="color: #0000ff">inline</span>
|
|
||||||
</span><span class="keyword"></span><span class="identifier">range< std::istream_iterator<Type, Elem, Traits> >
|
|
||||||
istream_range(std::basic_istream<Elem, Traits>& in);
|
|
||||||
} </pre>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
© <a name="Copyright" id="Copyright">Copyright</a> Neil Groves 2009.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>)
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
<br />
|
|
||||||
|
|
||||||
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
|
|
||||||
581
doc/mfc_atl.html
581
doc/mfc_atl.html
@ -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@users.sourceforge.net
|
|
||||||
: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>
|
|
||||||
<p>Boost.Range MFC/ATL Extension provides <a class="reference" href="../index.html">Boost.Range</a> support for MFC/ATL collection and string types.</p>
|
|
||||||
<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>
|
|
||||||
<p>If the <tt class="docutils literal"><span class="pre"><boost/range/mfc.hpp></span></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"><span class="pre">range_reference</span></tt> of MFC ranges.</p>
|
|
||||||
<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"><span class="pre">Range</span></tt></th>
|
|
||||||
<th class="head">Traversal Category</th>
|
|
||||||
<th class="head"><tt class="docutils literal"><span class="pre">range_reference<Range>::type</span></tt></th>
|
|
||||||
</tr>
|
|
||||||
</thead>
|
|
||||||
<tbody valign="top">
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CArray<T,A></span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">T&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CList<T,A></span></tt></td>
|
|
||||||
<td>Bidirectional</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">T&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CMap<K,AK,M,AM></span></tt></td>
|
|
||||||
<td>Forward</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">Range::CPair&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CTypedPtrArray<B,T*></span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">T*</span> <span class="pre">const</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CTypedPtrList<B,T*></span></tt></td>
|
|
||||||
<td>Bidirectional</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">T*</span> <span class="pre">const</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CTypedPtrMap<B,T*,V*></span></tt></td>
|
|
||||||
<td>Forward</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">std::pair<T*,V*></span> <span class="pre">const</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CByteArray</span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">BYTE&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CDWordArray</span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">DWORD&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CObArray</span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">CObject*</span> <span class="pre">&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CPtrArray</span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">void*</span> <span class="pre">&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CStringArray</span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">CString&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CUIntArray</span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">UINT&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CWordArray</span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">WORD&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CObList</span></tt></td>
|
|
||||||
<td>Bidirectional</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">CObject*</span> <span class="pre">&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CPtrList</span></tt></td>
|
|
||||||
<td>Bidirectional</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">void*</span> <span class="pre">&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CStringList</span></tt></td>
|
|
||||||
<td>Bidirectional</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">CString&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CMapPtrToWord</span></tt></td>
|
|
||||||
<td>Forward</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">std::pair<void*,WORD></span> <span class="pre">const</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CMapPtrToPtr</span></tt></td>
|
|
||||||
<td>Forward</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">std::pair<void*,void*></span> <span class="pre">const</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CMapStringToOb</span></tt></td>
|
|
||||||
<td>Forward</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">std::pair<String,CObject*></span> <span class="pre">const</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CMapStringToString</span></tt></td>
|
|
||||||
<td>Forward</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">Range::CPair&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CMapWordToOb</span></tt></td>
|
|
||||||
<td>Forward</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">std::pair<WORD,CObject*></span> <span class="pre">const</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CMapWordToPtr</span></tt></td>
|
|
||||||
<td>Forward</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">std::pair<WORD,void*></span> <span class="pre">const</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
</tbody>
|
|
||||||
</table>
|
|
||||||
<p>Other <a class="reference" href="../index.html">Boost.Range</a> metafunctions are defined by the following.
|
|
||||||
Let <tt class="docutils literal"><span class="pre">Range</span></tt> be any type listed above and <tt class="docutils literal"><span class="pre">ReF</span></tt> be the same as <tt class="docutils literal"><span class="pre">range_reference<Range>::type</span></tt>.
|
|
||||||
<tt class="docutils literal"><span class="pre">range_value<Range>::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">remove_reference<remove_const<Ref>::type>::type</span></tt>,
|
|
||||||
<tt class="docutils literal"><span class="pre">range_difference<Range>::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">std::ptrdiff_t</span></tt>, and
|
|
||||||
<tt class="docutils literal"><span class="pre">range_pointer<Range>::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">add_pointer<remove_reference<Ref>::type>::type</span></tt>.
|
|
||||||
As for <tt class="docutils literal"><span class="pre">const</span> <span class="pre">Range</span></tt>, see <a class="reference" href="#const-ranges">const Ranges</a>.</p>
|
|
||||||
</div>
|
|
||||||
<div class="section">
|
|
||||||
<h1><a id="atl-ranges" name="atl-ranges">ATL Ranges</a></h1>
|
|
||||||
<p>If the <tt class="docutils literal"><span class="pre"><boost/range/atl.hpp></span></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"><span class="pre">range_reference</span></tt> of ATL ranges.</p>
|
|
||||||
<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"><span class="pre">Range</span></tt></th>
|
|
||||||
<th class="head">Traversal Category</th>
|
|
||||||
<th class="head"><tt class="docutils literal"><span class="pre">range_reference<Range>::type</span></tt></th>
|
|
||||||
</tr>
|
|
||||||
</thead>
|
|
||||||
<tbody valign="top">
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CAtlArray<E,ET></span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">E&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CAutoPtrArray<E></span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">E&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CInterfaceArray<I,pi></span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">CComQIPtr<I,pi>&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CAtlList<E,ET></span></tt></td>
|
|
||||||
<td>Bidirectional</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">E&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CAutoPtrList<E></span></tt></td>
|
|
||||||
<td>Bidirectional</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">E&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CHeapPtrList<E,A></span></tt></td>
|
|
||||||
<td>Bidirectional</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">E&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CInterfaceList<I,pi></span></tt></td>
|
|
||||||
<td>Bidirectional</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">CComQIPtr<I,pi>&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CAtlMap<K,V,KT,VT></span></tt></td>
|
|
||||||
<td>Forward</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">Range::CPair&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CRBTree<K,V,KT,VT></span></tt></td>
|
|
||||||
<td>Bidirectional</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">Range::CPair&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CRBMap<K,V,KT,VT></span></tt></td>
|
|
||||||
<td>Bidirectional</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">Range::CPair&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CRBMultiMap<K,V,KT,VT></span></tt></td>
|
|
||||||
<td>Bidirectional</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">Range::CPair&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CSimpleStringT<B,b></span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">B&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CStringT<B,ST></span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">B&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CFixedStringT<S,n></span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">range_reference<S>::type</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CStringT<B,ST></span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">B&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CComBSTR</span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">OLECHAR&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
<tr><td><tt class="docutils literal"><span class="pre">CSimpleArray<T,TE></span></tt></td>
|
|
||||||
<td>Random Access</td>
|
|
||||||
<td><tt class="docutils literal"><span class="pre">T&</span></tt></td>
|
|
||||||
</tr>
|
|
||||||
</tbody>
|
|
||||||
</table>
|
|
||||||
<p>Other <a class="reference" href="../index.html">Boost.Range</a> metafunctions are defined by the following.
|
|
||||||
Let <tt class="docutils literal"><span class="pre">Range</span></tt> be any type listed above and <tt class="docutils literal"><span class="pre">ReF</span></tt> be the same as <tt class="docutils literal"><span class="pre">range_reference<Range>::type</span></tt>.
|
|
||||||
<tt class="docutils literal"><span class="pre">range_value<Range>::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">remove_reference<Ref>::type</span></tt>,
|
|
||||||
<tt class="docutils literal"><span class="pre">range_difference<Range>::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">std::ptrdiff_t</span></tt>, and
|
|
||||||
<tt class="docutils literal"><span class="pre">range_pointer<Range>::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">add_pointer<remove_reference<Ref>::type>::type</span></tt>.
|
|
||||||
As for <tt class="docutils literal"><span class="pre">const</span> <span class="pre">Range</span></tt>, see <a class="reference" href="#const-ranges">const Ranges</a>.</p>
|
|
||||||
</div>
|
|
||||||
<div class="section">
|
|
||||||
<h1><a id="const-ranges" name="const-ranges">const Ranges</a></h1>
|
|
||||||
<p><tt class="docutils literal"><span class="pre">range_reference<const</span> <span class="pre">Range>::type</span></tt> is defined by the following algorithm.
|
|
||||||
Let <tt class="docutils literal"><span class="pre">Range</span></tt> be any type listed above and <tt class="docutils literal"><span class="pre">ReF</span></tt> be the same as <tt class="docutils literal"><span class="pre">range_reference<Range>::type</span></tt>.</p>
|
|
||||||
<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>
|
|
||||||
<p>Other <a class="reference" href="../index.html">Boost.Range</a> metafunctions are defined by the following.
|
|
||||||
<tt class="docutils literal"><span class="pre">range_value<const</span> <span class="pre">Range>::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">range_value<Range>::type</span></tt>,
|
|
||||||
<tt class="docutils literal"><span class="pre">range_difference<const</span> <span class="pre">Range>::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">std::ptrdiff_t</span></tt>, and
|
|
||||||
<tt class="docutils literal"><span class="pre">range_pointer<const</span> <span class="pre">Range>::type</span></tt> is the same as <tt class="docutils literal"><span class="pre">add_pointer<remove_reference<range_reference<const</span> <span class="pre">Range>::type>::type>::type</span></tt>.</p>
|
|
||||||
</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>
|
|
||||||
@ -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>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
A huge effort has been made to port the library to as many compilers as possible.
|
|
||||||
<!-- The results of the test-suites can be found <a
|
|
||||||
href="http://boost.sourceforge.net/regression-logs/developer/range.html">here</a
|
|
||||||
>.--> </p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
<p> Visual C++ 6/7.0 has a limited support for arrays: as long as the arrays
|
|
||||||
are of built-in type it should work.
|
|
||||||
</p>
|
|
||||||
<p >
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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 <a href="boost_range.html#const_begin"><code>const_begin()</code></a>
|
|
||||||
and <a href="boost_range.html#const_begin"><code>const_end()</code></a>
|
|
||||||
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 <i>before</i> the headers in this
|
|
||||||
library,
|
|
||||||
<li>
|
|
||||||
put all overloads in namespace <code>boost</code>.
|
|
||||||
</ul>
|
|
||||||
|
|
||||||
</ol>
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<hr>
|
|
||||||
<p>
|
|
||||||
© <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>)
|
|
||||||
</p>>
|
|
||||||
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
|
|
||||||
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
|
|
||||||
379
doc/range.html
379
doc/range.html
@ -1,379 +0,0 @@
|
|||||||
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
|
|
||||||
<HTML>
|
|
||||||
<!--
|
|
||||||
-- Copyright (c) Jeremy Siek 2000
|
|
||||||
--
|
|
||||||
-- Permission to use, copy, modify, distribute and sell this software
|
|
||||||
-- and its documentation for any purpose is hereby granted without fee,
|
|
||||||
-- provided that the above copyright notice appears in all copies and
|
|
||||||
-- that both that copyright notice and this permission notice appear
|
|
||||||
-- in supporting documentation. Silicon Graphics makes no
|
|
||||||
-- representations about the suitability of this software for any
|
|
||||||
-- purpose. It is provided "as is" without express or implied warranty.
|
|
||||||
-->
|
|
||||||
<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>
|
|
||||||
<a href="#overview">Overview</a>
|
|
||||||
<li>
|
|
||||||
<a href="#single_pass_range">Single Pass Range</a>
|
|
||||||
<li>
|
|
||||||
<a href="#forward_range">Forward Range</a>
|
|
||||||
<li>
|
|
||||||
<a href="#bidirectional_range">Bidirectional Range</a>
|
|
||||||
<li>
|
|
||||||
<a href="#random_access_range">Random Access Range</a>
|
|
||||||
<li>
|
|
||||||
<a href="#concept_checking">Concept Checking</a>
|
|
||||||
</ul>
|
|
||||||
|
|
||||||
<a name="overview"></a>
|
|
||||||
<hr>
|
|
||||||
<h3>Overview</h3>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
A Range is a <i>concept</i> 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
|
|
||||||
<i>much</i> fewer requirements than a Container.
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
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,
|
|
||||||
<!--
|
|
||||||
<li>
|
|
||||||
require that the associated reference type is a real C++ reference.
|
|
||||||
-->
|
|
||||||
</ul>
|
|
||||||
|
|
||||||
|
|
||||||
Because of the second requirement, a Range object must be passed by
|
|
||||||
(const or non-const) reference in generic code.
|
|
||||||
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
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.</p>
|
|
||||||
|
|
||||||
<p> The concepts described below specifies associated types as
|
|
||||||
<a href="../../mpl/doc/refmanual/metafunction.html">metafunctions</a> and all
|
|
||||||
functions as free-standing functions to allow for a layer of indirection. </p>
|
|
||||||
|
|
||||||
<!--<p><i>Notice that these metafunctions must be defined in namespace </i>
|
|
||||||
<code>boost</code></p>-->
|
|
||||||
|
|
||||||
<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>
|
|
||||||
<p>
|
|
||||||
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>
|
|
||||||
|
|
||||||
</p>
|
|
||||||
|
|
||||||
|
|
||||||
<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>
|
|
||||||
<!--
|
|
||||||
<TR>
|
|
||||||
<TD VAlign="top">Reference type</TD>
|
|
||||||
<TD VAlign="top"><code>reference_of<X>::type</code></TD>
|
|
||||||
<TD VAlign="top">A type that behaves like a reference to the Range's value type. <a href="#1">[1]</a></TD>
|
|
||||||
</TR>
|
|
||||||
-->
|
|
||||||
</table>
|
|
||||||
|
|
||||||
|
|
||||||
<h3>Valid expressions</h3>
|
|
||||||
|
|
||||||
The following expressions must be valid.
|
|
||||||
<p>
|
|
||||||
|
|
||||||
<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>
|
|
||||||
<p><a
|
|
||||||
href="boost_range.html#minimal_interface">Extending the library for UDTs </a></p>
|
|
||||||
<p> <a href="boost_range.html#boost::rang_difference">Implementation of
|
|
||||||
metafunctions </a></p>
|
|
||||||
|
|
||||||
<p> <a href="boost_range.html#begin">Implementation of
|
|
||||||
functions </a></p>
|
|
||||||
<p>
|
|
||||||
<A href="http://www.sgi.com/Technology/STL/Container.html">Container</A>
|
|
||||||
</p>
|
|
||||||
|
|
||||||
|
|
||||||
<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>
|
|
||||||
<p>
|
|
||||||
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>
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<h3>Refinement of</h3> <a href="#single_pass_range">Single Pass
|
|
||||||
Range</a>
|
|
||||||
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<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> <a href="#forward_range">Forward Range</a>
|
|
||||||
|
|
||||||
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<hr>
|
|
||||||
|
|
||||||
<a name=random_access_range></a><h2>Random Access Range</h2>
|
|
||||||
<h3>Description</h3>
|
|
||||||
<p>
|
|
||||||
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>
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<h3>Refinement of</h3>
|
|
||||||
<p>
|
|
||||||
<a href="#bidirectional_range">Bidirectional Range</a>
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<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
|
|
||||||
<a href="#forward_range">ForwardRange</a> 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>
|
|
||||||
<p> <a href="style.html">Range Terminology and style guidelines</a></p>
|
|
||||||
<p> <a href="../../iterator/doc/iterator_concepts.html">Iterator Concepts</a></p>
|
|
||||||
<p> <a href="../../concept_check/concept_check.htm">Boost Concept Check library</a></p>
|
|
||||||
|
|
||||||
<hr>
|
|
||||||
<p>
|
|
||||||
© <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>)
|
|
||||||
</p>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
|
|
||||||
</BODY>
|
|
||||||
</HTML>
|
|
||||||
132
doc/style.html
132
doc/style.html
@ -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>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
The use of a consistent terminology is as important for <a href="range.html">Range</a>s
|
|
||||||
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 <i>self-documenting</i>.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>
|
|
||||||
<i>Value access</i> category:
|
|
||||||
<ul>
|
|
||||||
<li>
|
|
||||||
Readable Range
|
|
||||||
<li>
|
|
||||||
Writeable Range
|
|
||||||
<li>
|
|
||||||
Swappable Range
|
|
||||||
<li>
|
|
||||||
Lvalue Range
|
|
||||||
</ul>
|
|
||||||
<li>
|
|
||||||
<i>Traversal</i> category:
|
|
||||||
<ul>
|
|
||||||
<li>
|
|
||||||
<a href="range.html#single_pass_range">Single Pass Range</a>
|
|
||||||
<li>
|
|
||||||
<a href="range.html#forward_range">Forward Range</a>
|
|
||||||
<li>
|
|
||||||
<a href="range.html#bidirectional_range">Bidirectional Range</a> <li>
|
|
||||||
<a href="range.html#random_access_range">Random Access Range</a> </ul>
|
|
||||||
</ul>
|
|
||||||
Notice how we have used the categories from the <a href="../../iterator/doc/new-iter-concepts.html">new
|
|
||||||
style iterators</a>.
|
|
||||||
|
|
||||||
<p>
|
|
||||||
Notice that an iterator (and therefore an range) has one <i>traversal</i>
|
|
||||||
property and one or more properties from the <i>value access</i> 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 <i>traversal</i> property first as
|
|
||||||
done above. This seems reasonable since there will only be one <i>traversal</i>
|
|
||||||
property, but perhaps many <i>value access</i> properties.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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 <i>value access</i>
|
|
||||||
properties the Range has. Similarly, a Readable Range will be one that has the
|
|
||||||
lowest possible <i>traversal</i> property (Single Pass).
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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 <i>traversal</i>
|
|
||||||
and <i>value access</i> properties must be exactly defined. The iterator-based
|
|
||||||
version looks like this:
|
|
||||||
|
|
||||||
<pre>
|
|
||||||
<span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>RandomAccessTraversalReadableWritableIterator </span><span class=special>>
|
|
||||||
</span><span class=keyword>void </span><span class=identifier>sort</span><span class=special>( </span><span class=identifier>RandomAccessTraversalReadableWritableIterator </span><span class=identifier>first</span><span class=special>,
|
|
||||||
</span><span class=identifier>RandomAccessTraversalReadableWritableIterator </span><span class=identifier>last </span><span class=special>);</span>
|
|
||||||
</pre>
|
|
||||||
For ranges the interface becomes
|
|
||||||
|
|
||||||
<pre>
|
|
||||||
<span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>RandomAccessReadableWritableRange </span><span class=special>>
|
|
||||||
</span><span class=keyword>void </span><span class=identifier>sort</span><span class=special>( </span><span class=identifier>RandomAccessReadableWritableRange</span><span class=special>& </span><span class=identifier>r </span><span class=special>);</span>
|
|
||||||
</pre>
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<hr>
|
|
||||||
<p>
|
|
||||||
© <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>)
|
|
||||||
</p>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
|
|
||||||
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
|
|
||||||
@ -1,79 +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>
|
|
||||||
<p >
|
|
||||||
Boost v. 1.35 introduced some larger refactorings of the library:
|
|
||||||
</p>
|
|
||||||
<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>
|
|
||||||
<p>
|
|
||||||
© <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>)
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
|
|
||||||
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
|
|
||||||
@ -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>
|
|
||||||
<p>
|
|
||||||
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 <a href="#iter_range"><code>iterator_range</code></a>
|
|
||||||
<li>
|
|
||||||
Class <a href="#sub_range"><code>sub_range</code></a>
|
|
||||||
</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. </p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<hr>
|
|
||||||
<a name=iter_range></a> <h1>Class <code>iterator_range</code></h1>
|
|
||||||
<p>
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
<p>
|
|
||||||
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.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
Recall that many default constructed iterators
|
|
||||||
are <i>singular</i> 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. </p>
|
|
||||||
|
|
||||||
<h3>Synopsis</h3>
|
|
||||||
|
|
||||||
<pre>
|
|
||||||
<span class=keyword>namespace </span><span class=identifier>boost</span>
|
|
||||||
<span class=special>{
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator </span><span class=special>>
|
|
||||||
</span><span class=keyword>class </span><span class=identifier>iterator_range
|
|
||||||
</span><span class=special>{
|
|
||||||
</span><span class=keyword>public</span><span class=special>: </span><span class=comment>// Forward Range types
|
|
||||||
</span><span class=keyword>typedef </span><span class=identifier>ForwardTraversalIterator </span><span class=identifier>iterator</span><span class=special>;
|
|
||||||
</span><span class=keyword>typedef </span><span class=identifier>ForwardTraversalIterator </span><span class=identifier>const_iterator</span><span class=special>;</span>
|
|
||||||
<span class=keyword>typedef </span><span class=identifier>iterator_difference</span><span class=special><</span><span class=identifier>iterator</span><span class=special>>::</span><span class=identifier>type </span><span class=identifier>difference_type</span><span class=special>;</span>
|
|
||||||
|
|
||||||
<span class=keyword>public</span><span class=special>: </span><span class=comment>// construction, assignment
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator2 </span><span class=special>>
|
|
||||||
</span><span class=identifier>iterator_range</span><span class=special>( </span><span class=identifier>ForwardTraversalIterator2 </span><span class=identifier>Begin</span><span class=special>, </span><span class=identifier>ForwardTraversalIterator2 </span><span class=identifier>End </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=identifier>iterator_range</span><span class=special>( </span><span class=identifier>ForwardRange</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=identifier>iterator_range</span><span class=special>( </span><span class=keyword>const </span><span class=identifier>ForwardRange</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=identifier>iterator_range</span><span class=special>& </span><span class=keyword>operator</span><span class=special>=( </span><span class=identifier>ForwardRange</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=identifier>iterator_range</span><span class=special>& </span><span class=keyword>operator</span><span class=special>=( </span><span class=keyword>const </span><span class=identifier>ForwardRange</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>public</span><span class=special>: </span><span class=comment>// Forward Range functions
|
|
||||||
</span><span class=identifier>iterator </span><span class=identifier>begin</span><span class=special>() </span><span class=keyword>const</span><span class=special>;
|
|
||||||
</span><span class=identifier>iterator </span><span class=identifier>end</span><span class=special>() </span><span class=keyword>const</span><span class=special>;
|
|
||||||
</span><span class=identifier>difference_type </span><span class=identifier>size</span><span class=special>() </span><span class=keyword>const</span><span class=special>;
|
|
||||||
</span><span class=keyword>bool </span><span class=identifier>empty</span><span class=special>() </span><span class=keyword>const</span><span class=special>;
|
|
||||||
|
|
||||||
</span><span class=keyword>public</span><span class=special>: </span><span class=comment>// convenience
|
|
||||||
</span><span class=keyword>operator </span><a href="#unspecified_bool"><span class=identifier>unspecified_bool_type</span></a><span class=special>() </span><span class=keyword>const</span><span class=special>;
|
|
||||||
</span> <span class=keyword>bool</span> <span
|
|
||||||
class=identifier><a href="#equal">equal</a></span><span
|
|
||||||
class=special>( </span><span class=keyword>const</span> <span class=identifier>iterator_range</span><span class=special>& ) </span><span
|
|
||||||
class=keyword>const;</span>
|
|
||||||
<span class=identifier>reference </span><span class=identifier>front</span><span class=special>() </span><span class=keyword>const</span><span class=special>;</span>
|
|
||||||
<span class=identifier>reference </span><span class=identifier>back</span><span class=special>() </span><span class=keyword>const</span><span class=special>;</span>
|
|
||||||
<span class=identifier>iterator_range</span><span class=special>&</span> <span class=identifier>advance_begin</span><span class=special>(</span> <span class=identifier>difference_type</span> <span class=identifier>n</span> <span class=special>);</span>
|
|
||||||
<span class=identifier>iterator_range</span><span class=special>&</span> <span class=identifier>advance_end</span><span class=special>(</span> <span class=identifier>difference_type</span> <span class=identifier>n</span> <span class=special>);</span>
|
|
||||||
<span class=comment>// for Random Access Range only: </span>
|
|
||||||
<span class=identifier>reference </span><span class=keyword>operator</span><span class=special>[]( </span><span class=identifier>difference_type </span><span class=identifier>at </span><span class=special>) </span><span class=keyword>const</span><span class=special>;</span>
|
|
||||||
<span class=identifier>value_type</span> <span class=keyword>operator</span><span class=special>()( </span><span class=identifier>difference_type </span><span class=identifier>at </span><span class=special>) </span><span class=keyword>const</span><span class=special>;</span>
|
|
||||||
<span class=special>};
|
|
||||||
|
|
||||||
</span><span class=comment>// stream output
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>T</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>Traits </span><span class=special>>
|
|
||||||
</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>basic_ostream</span><span class=special><</span><span class=identifier>T</span><span class=special>,</span><span class=identifier>Traits</span><span class=special>>&
|
|
||||||
</span><span class=keyword>operator</span><span class=special><<( </span><span class=identifier>std</span><span class=special>::</span><span class=identifier>basic_ostream</span><span class=special><</span><span class=identifier>T</span><span class=special>,</span><span class=identifier>Traits</span><span class=special>>& </span><span class=identifier>Os</span><span class=special>,
|
|
||||||
</span><span class=keyword>const </span><span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>ForwardTraversalIterator</span><span class=special>>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=comment>// <a href="#comparison">comparison</a>
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator2 </span><span class=special>>
|
|
||||||
</span><span class=keyword>bool </span><span class=keyword>operator</span><span class=special>==( </span><span class=keyword>const </span><span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>ForwardTraversalIterator</span><span class=special>>& </span><span class=identifier>l</span><span class=special>,
|
|
||||||
</span><span class=keyword>const </span><span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>ForwardTraversalIterator2</span><span class=special>>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=keyword>bool </span><span class=keyword>operator</span><span class=special>==( </span><span class=keyword>const </span><span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>ForwardTraversalIterator</span><span class=special>>& </span><span class=identifier>l</span><span class=special>,
|
|
||||||
</span><span class=keyword>const </span><span class=identifier>ForwardRange</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=keyword>bool </span><span class=keyword>operator</span><span class=special>==( </span><span class=keyword>const </span><span class=identifier>ForwardRange</span><span class=special>& </span><span class=identifier>l</span><span class=special>,
|
|
||||||
</span><span class=keyword>const </span><span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>ForwardTraversalIterator</span><span class=special>>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator2 </span><span class=special>>
|
|
||||||
</span><span class=keyword>bool </span><span class=keyword>operator</span><span class=special>!=( </span><span class=keyword>const </span><span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>ForwardTraversalIterator</span><span class=special>>& </span><span class=identifier>l</span><span class=special>,
|
|
||||||
</span><span class=keyword>const </span><span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>ForwardTraversalIterator2</span><span class=special>>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=keyword>bool </span><span class=keyword>operator</span><span class=special>!=( </span><span class=keyword>const </span><span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>ForwardTraversalIterator</span><span class=special>>& </span><span class=identifier>l</span><span class=special>,
|
|
||||||
</span><span class=keyword>const </span><span class=identifier>ForwardRange</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=keyword>bool </span><span class=keyword>operator</span><span class=special>!=( </span><span class=keyword>const </span><span class=identifier>ForwardRange</span><span class=special>& </span><span class=identifier>l</span><span class=special>,
|
|
||||||
</span><span class=keyword>const </span><span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>ForwardTraversalIterator</span><span class=special>>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator2 </span><span class=special>>
|
|
||||||
</span><span class=keyword>bool </span><span class=keyword>operator</span><span class=special><( </span><span class=keyword>const </span><span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>ForwardTraversalIterator</span><span class=special>>& </span><span class=identifier>l</span><span class=special>,
|
|
||||||
</span><span class=keyword>const </span><span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>ForwardTraversalIterator2</span><span class=special>>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=keyword>bool </span><span class=keyword>operator</span><span class=special><( </span><span class=keyword>const </span><span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>ForwardTraversalIterator</span><span class=special>>& </span><span class=identifier>l</span><span class=special>,
|
|
||||||
</span><span class=keyword>const </span><span class=identifier>ForwardRange</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=keyword>bool </span><span class=keyword>operator</span><span class=special><( </span><span class=keyword>const </span><span class=identifier>ForwardRange</span><span class=special>& </span><span class=identifier>l</span><span class=special>,
|
|
||||||
</span><span class=keyword>const </span><span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>ForwardTraversalIterator</span><span class=special>>& </span><span class=identifier>r </span><span class=special>);</span>
|
|
||||||
|
|
||||||
<span class=comment>// external construction
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator </span><span class=special>>
|
|
||||||
</span><span class=identifier>iterator_range</span><span class=special>< </span><span class=identifier>ForwardTraversalIterator </span><span class=special>>
|
|
||||||
</span><span class=identifier>make_iterator_range</span><span class=special>( </span><span class=identifier>ForwardTraversalIterator </span><span class=identifier>Begin</span><span class=special>,
|
|
||||||
</span><span class=identifier>ForwardTraversalIterator </span><span class=identifier>End </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=identifier>iterator_range</span><span class=special>< </span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=identifier>ForwardRange</span><span class=special>>::</span><span class=identifier>type </span><span class=special>>
|
|
||||||
</span><span class=identifier>make_iterator_range</span><span class=special>( </span><span class=identifier>ForwardRange</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=identifier>iterator_range</span><span class=special>< </span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=keyword>const </span><span class=identifier>ForwardRange</span><span class=special>>::</span><span class=identifier>type </span><span class=special>>
|
|
||||||
</span><span class=identifier>make_iterator_range</span><span class=special>( </span><span class=keyword>const </span><span class=identifier>ForwardRange</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
</span>
|
|
||||||
<span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>Range </span><span class=special>></span>
|
|
||||||
<span class=identifier>iterator_range</span><span class=special>< </span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=identifier>Range</span><span class=special>>::</span><span class=identifier>type </span><span class=special>></span>
|
|
||||||
<span class=identifier><a href="#make_iterator_range">make_iterator_range</a></span><span class=special>(</span><span class=identifier> Range</span><span class=special>& </span><span class=identifier>r</span><span class=special>,
|
|
||||||
</span><span class=keyword>typename </span><span class=identifier>range_difference</span><span class=special><</span><span class=identifier>Range</span><span class=special>>::</span><span class=identifier>type </span><span class=identifier>advance_begin</span><span class=special>,
|
|
||||||
</span><span class=keyword>typename </span><span class=identifier>range_difference</span><span class=special><</span><span class=identifier>Range</span><span class=special>>::</span><span class=identifier>type </span><span class=identifier>advance_end </span><span class=special>);
|
|
||||||
</span>
|
|
||||||
<span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>Range </span><span class=special>></span>
|
|
||||||
<span class=identifier>iterator_range</span><span class=special>< </span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=keyword>const </span><span class=identifier>Range</span><span class=special>>::</span><span class=identifier>type </span><span class=special>></span>
|
|
||||||
<span class=identifier>make_iterator_range</span><span class=special>( </span><span class=keyword>const </span><span class=identifier>Range</span><span class=special>& </span><span class=identifier>r</span><span class=special>,
|
|
||||||
</span><span class=keyword>typename </span><span class=identifier>range_difference</span><span class=special><</span><span class=identifier>Range</span><span class=special>>::</span><span class=identifier>type </span><span class=identifier>advance_begin</span><span class=special>,
|
|
||||||
</span><span class=keyword>typename </span><span class=identifier>range_difference</span><span class=special><</span><span class=identifier>Range</span><span class=special>>::</span><span class=identifier>type </span><span class=identifier>advance_end </span><span class=special>);</span>
|
|
||||||
|
|
||||||
<span class=comment>// convenience
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>Sequence</span><span class=special>, </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=identifier>Sequence </span><a href="#copy_range"><span
|
|
||||||
class=identifier>copy_range</span></a><span class=special>( </span><span
|
|
||||||
class=keyword>const </span><span class=identifier>ForwardRange</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
</span>
|
|
||||||
<span class=special>} </span><span class=comment>// namespace 'boost'</span>
|
|
||||||
</pre>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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. </p>
|
|
||||||
|
|
||||||
<h3>Details member functions</h3>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
<a name="unspecified_bool"></a>
|
|
||||||
<code>operator unspecified_bool_type() const; </code>
|
|
||||||
<blockquote>
|
|
||||||
<i>Returns</i> <code>!empty();</code>
|
|
||||||
</blockquote>
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
<a name="equal"></a>
|
|
||||||
<code>bool equal( iterator_range& r ) const;</code>
|
|
||||||
<blockquote>
|
|
||||||
<i>Returns</i> <code>begin() == r.begin() && end() == r.end();</code>
|
|
||||||
</blockquote>
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<h3>Details functions</h3>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
<a name="comparison"></a>
|
|
||||||
<code>bool operator==( const ForwardRange1& l, const ForwardRange2& r );</code>
|
|
||||||
<blockquote>
|
|
||||||
<i>Returns</i> <code>size(l) != size(r) ? false : std::equal( begin(l), end(l), begin(r) );</code> </blockquote> </p>
|
|
||||||
<code>bool operator!=( const ForwardRange1& l, const ForwardRange2& r );</code>
|
|
||||||
<blockquote>
|
|
||||||
<i>Returns</i> <code>!( l == r );</code>
|
|
||||||
</blockquote>
|
|
||||||
<code>bool operator<( const ForwardRange1& l, const ForwardRange2& r );</code>
|
|
||||||
<blockquote>
|
|
||||||
<i>Returns</i> <code>std::lexicographical_compare( begin(l), end(l), begin(r), end(r) );</code> </blockquote>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
<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>
|
|
||||||
<i>Effects</i>:
|
|
||||||
<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>
|
|
||||||
<p>
|
|
||||||
<a name="copy_range"></a>
|
|
||||||
<code>Sequence copy_range( const ForwardRange& r );</code>
|
|
||||||
<blockquote>
|
|
||||||
<i>Returns</i> <code>Sequence( begin(r), end(r) );</code>
|
|
||||||
</blockquote>
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<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 <a href="#iter_range"><code>iterator_range</code></a> class.
|
|
||||||
The <code>sub_range</code> class is often easier to use because
|
|
||||||
one must specify the <a href="range.html#forward_range">Forward Range</a>
|
|
||||||
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>
|
|
||||||
<span class=keyword>namespace </span><span class=identifier>boost</span>
|
|
||||||
<span class=special>{
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardRange </span><span class=special>>
|
|
||||||
</span><span class=keyword>class </span><span class=identifier>sub_range </span><span class=special>: </span><span class=keyword>public </span><span class=identifier>iterator_range</span><span class=special>< </span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=identifier>ForwardRange</span><span class=special>>::</span><span class=identifier>type </span><span class=special>>
|
|
||||||
</span><span class=special>{
|
|
||||||
</span><span class=keyword>public</span><span class=special>: </span>
|
|
||||||
<span class=keyword>typedef </span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=identifier>ForwardRange</span><span class=special>>::</span><span class=identifier>type </span><span class=identifier>iterator</span><span class=special>;</span>
|
|
||||||
<span class=keyword>typedef </span><span class=keyword>typename </span><span class=identifier>range_iterator</span><span class=special><</span><span class=keyword>const </span><span class=identifier>ForwardRange</span><span class=special>>::</span><span class=identifier>type </span><span class=identifier>const_iterator</span><span class=special>;</span>
|
|
||||||
<span class=keyword>typedef </span><span class=keyword>typename </span><span class=identifier>iterator_difference</span><span class=special><</span><span class=identifier>iterator</span><span class=special>>::</span><span class=identifier>type </span><span class=identifier>difference_type</span><span class=special>;</span>
|
|
||||||
|
|
||||||
|
|
||||||
<span class=keyword>public</span><span class=special>: </span><span class=comment>// construction, assignment
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardTraversalIterator </span><span class=special>>
|
|
||||||
</span><span class=identifier>sub_range</span><span class=special>( </span><span class=identifier>ForwardTraversalIterator </span><span class=identifier>Begin</span><span class=special>, </span><span class=identifier>ForwardTraversalIterator </span><span class=identifier>End </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardRange2 </span><span class=special>>
|
|
||||||
</span><span class=identifier>sub_range</span><span class=special>( </span><span class=identifier>ForwardRange2</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardRange2 </span><span class=special>>
|
|
||||||
</span><span class=identifier>sub_range</span><span class=special>( </span><span class=keyword>const </span><span class=identifier>ForwardRange2</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardRange2 </span><span class=special>>
|
|
||||||
</span><span class=identifier>sub_range</span><span class=special>& </span><span class=keyword>operator</span><span class=special>=( </span><span class=identifier>ForwardRange2</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
|
|
||||||
</span><span class=keyword>template</span><span class=special>< </span><span class=keyword>class </span><span class=identifier>ForwardRange2 </span><span class=special>>
|
|
||||||
</span><span class=identifier>sub_range</span><span class=special>& </span><span class=keyword>operator</span><span class=special>=( </span><span class=keyword>const </span><span class=identifier>ForwardRange2</span><span class=special>& </span><span class=identifier>r </span><span class=special>);
|
|
||||||
</span>
|
|
||||||
<span class=keyword>public</span><span class=special>: </span><span class=comment>// Forward Range functions
|
|
||||||
</span><span class=identifier>iterator </span><span class=identifier>begin</span><span class=special>();
|
|
||||||
</span><span class=identifier>const_iterator </span><span class=identifier>begin</span><span class=special>() </span><span class=keyword>const</span><span class=special>;
|
|
||||||
</span><span class=identifier>iterator </span><span class=identifier>end</span><span class=special>();
|
|
||||||
</span><span class=identifier>const_iterator </span><span class=identifier>end</span><span class=special>() </span><span class=keyword>const</span><span class=special>;</span>
|
|
||||||
|
|
||||||
<span class=keyword>public</span><span class=special>: </span><span class=comment>// convenience
|
|
||||||
</span> <span class=identifier>value_type</span><span class=special>& </span><span class=identifier>front</span><span class=special>();</span>
|
|
||||||
<span class=keyword>const </span><span class=identifier>value_type</span><span class=special>& </span><span class=identifier>front</span><span class=special>() </span><span class=keyword>const</span><span class=special>;</span>
|
|
||||||
<span class=identifier>value_type</span><span class=special>& </span><span class=identifier>back</span><span class=special>();</span>
|
|
||||||
<span class=keyword>const </span><span class=identifier>value_type</span><span class=special>& </span><span class=identifier>back</span><span class=special>() </span><span class=keyword>const</span><span class=special>;</span>
|
|
||||||
<span class=comment>// for Random Access Range only: </span>
|
|
||||||
<span class=identifier>value_type</span><span class=special>& </span><span class=keyword>operator</span><span class=special>[]( </span><span class=identifier>difference_type </span><span class=identifier>at </span><span class=special>);</span>
|
|
||||||
<span class=keyword>const </span><span class=identifier>value_type</span><span class=special>& </span><span class=keyword>operator</span><span class=special>[]( </span><span class=identifier>difference_type </span><span class=identifier>at </span><span class=special>) </span><span class=keyword>const</span><span class=special>;</span>
|
|
||||||
|
|
||||||
<span class=keyword>public</span><span class=special>:
|
|
||||||
</span><span class=comment>// rest of interface inherited from <a href="#iter_range"><code>iterator_range</code></a>
|
|
||||||
</span><span class=special>};
|
|
||||||
</span>
|
|
||||||
<span class=special>} </span><span class=comment>// namespace 'boost'</span>
|
|
||||||
</pre>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>
|
|
||||||
<span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span> <span class=identifier>str</span><span class=special>(</span><span class=string>"hello"</span><span class=special>);</span>
|
|
||||||
<span class=identifier>iterator_range</span><span class=special><</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>::</span><span class=identifier>iterator</span><span class=special>></span> <span class=identifier>ir</span> <span class=special>=</span> <span class=identifier>find_first</span><span class=special>(</span> <span class=identifier>str</span><span class=special>,</span> <span class=identifier>as_literal</span><span class=special>(</span><span class=string>"ll"</span><span class=special>)</span> <span class=special>);</span>
|
|
||||||
<span class=identifier>sub_range</span><span class=special><</span><span class=identifier>std</span><span class=special>::</span><span class=identifier>string</span><span class=special>></span> <span class=identifier>sub</span> <span class=special>=</span> <span class=identifier>find_first</span><span class=special>(</span> <span class=identifier>str</span><span class=special>,</span> <span class=identifier>as_literal</span><span class=special>(</span><span class=string>"ll"</span><span class=special>)</span> <span class=special>);</span>
|
|
||||||
</pre>
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<hr>
|
|
||||||
<p>
|
|
||||||
© <a name="Copyright" id="Copyright">Copyright</a> Thorsten Ottosen 2008.
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<p>
|
|
||||||
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>)
|
|
||||||
</p>
|
|
||||||
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
<br>
|
|
||||||
|
|
||||||
|
|
||||||
</body>
|
|
||||||
</html>
|
|
||||||
|
|
||||||
Reference in New Issue
Block a user