mirror of
https://github.com/boostorg/iterator.git
synced 2025-05-09 23:23:54 +00:00
285 lines
14 KiB
HTML
285 lines
14 KiB
HTML
<?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.2.8: http://docutils.sourceforge.net/" />
|
|
<title>Reverse Iterator</title>
|
|
<meta name="author" content="David Abrahams, Jeremy Siek, Thomas Witt" />
|
|
<meta name="organization" content="Boost Consulting, Indiana University Open Systems Lab, University of Hanover Institute for Transport Railway Operation and Construction" />
|
|
<meta name="date" content="2004-01-13" />
|
|
<meta name="copyright" content="Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. All rights reserved" />
|
|
<link rel="stylesheet" href="default.css" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div class="document" id="reverse-iterator">
|
|
<h1 class="title">Reverse Iterator</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>David Abrahams, Jeremy Siek, Thomas Witt</td></tr>
|
|
<tr><th class="docinfo-name">Contact:</th>
|
|
<td><a class="first reference" href="mailto:dave@boost-consulting.com">dave@boost-consulting.com</a>, <a class="reference" href="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</a>, <a class="last reference" href="mailto:witt@ive.uni-hannover.de">witt@ive.uni-hannover.de</a></td></tr>
|
|
<tr><th class="docinfo-name">Organization:</th>
|
|
<td><a class="first reference" href="http://www.boost-consulting.com">Boost Consulting</a>, Indiana University <a class="reference" href="http://www.osl.iu.edu">Open Systems
|
|
Lab</a>, University of Hanover <a class="last reference" href="http://www.ive.uni-hannover.de">Institute for Transport
|
|
Railway Operation and Construction</a></td></tr>
|
|
<tr><th class="docinfo-name">Date:</th>
|
|
<td>2004-01-13</td></tr>
|
|
<tr><th class="docinfo-name">Copyright:</th>
|
|
<td>Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. All rights reserved</td></tr>
|
|
</tbody>
|
|
</table>
|
|
<table class="field-list" frame="void" rules="none">
|
|
<col class="field-name" />
|
|
<col class="field-body" />
|
|
<tbody valign="top">
|
|
<tr class="field"><th class="field-name">abstract:</th><td class="field-body">The reverse iterator adaptor iterates through the adapted iterator
|
|
range in the opposite direction.</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<div class="contents topic" id="table-of-contents">
|
|
<p class="topic-title"><a name="table-of-contents">Table of Contents</a></p>
|
|
<ul class="simple">
|
|
<li><a class="reference" href="#reverse-iterator-synopsis" id="id2" name="id2"><tt class="literal"><span class="pre">reverse_iterator</span></tt> synopsis</a></li>
|
|
<li><a class="reference" href="#reverse-iterator-requirements" id="id3" name="id3"><tt class="literal"><span class="pre">reverse_iterator</span></tt> requirements</a></li>
|
|
<li><a class="reference" href="#reverse-iterator-models" id="id4" name="id4"><tt class="literal"><span class="pre">reverse_iterator</span></tt> models</a></li>
|
|
<li><a class="reference" href="#reverse-iterator-operations" id="id5" name="id5"><tt class="literal"><span class="pre">reverse_iterator</span></tt> operations</a></li>
|
|
<li><a class="reference" href="#example" id="id6" name="id6">Example</a></li>
|
|
</ul>
|
|
</div>
|
|
<div class="section" id="reverse-iterator-synopsis">
|
|
<h1><a class="toc-backref" href="#id2" name="reverse-iterator-synopsis"><tt class="literal"><span class="pre">reverse_iterator</span></tt> synopsis</a></h1>
|
|
<pre class="literal-block">
|
|
template <class Iterator>
|
|
class reverse_iterator
|
|
{
|
|
public:
|
|
typedef iterator_traits<Iterator>::value_type value_type;
|
|
typedef iterator_traits<Iterator>::reference reference;
|
|
typedef iterator_traits<Iterator>::pointer pointer;
|
|
typedef iterator_traits<Iterator>::difference_type difference_type;
|
|
typedef /* see below */ iterator_category;
|
|
|
|
reverse_iterator() {}
|
|
explicit reverse_iterator(Iterator x) ;
|
|
|
|
template<class OtherIterator>
|
|
reverse_iterator(
|
|
reverse_iterator<OtherIterator> const& r
|
|
, typename enable_if_convertible<OtherIterator, Iterator>::type* = 0 // exposition
|
|
);
|
|
Iterator base() const;
|
|
reference operator*() const;
|
|
reverse_iterator& operator++();
|
|
reverse_iterator& operator--();
|
|
private:
|
|
Iterator m_iterator; // exposition
|
|
};
|
|
</pre>
|
|
<p>The <tt class="literal"><span class="pre">iterator_category</span></tt> member is a type convertible to the iterator
|
|
tag given by the following algorithm. Let <tt class="literal"><span class="pre">T</span></tt> be
|
|
<tt class="literal"><span class="pre">iterator_traits<Iterator>::value_type</span></tt>, <tt class="literal"><span class="pre">R</span></tt> be
|
|
<tt class="literal"><span class="pre">iterator_traits<Iterator>::reference</span></tt>, and <tt class="literal"><span class="pre">C</span></tt> be
|
|
<tt class="literal"><span class="pre">traveral_category<Iterator>::type</span></tt>.</p>
|
|
<pre class="literal-block">
|
|
if (R is a reference to T) then
|
|
if (C is convertible to random_access_traversal_tag) then
|
|
random_access_iterator_tag
|
|
else
|
|
bidirectional_iterator_tag
|
|
else
|
|
input_iterator_tag
|
|
</pre>
|
|
</div>
|
|
<div class="section" id="reverse-iterator-requirements">
|
|
<h1><a class="toc-backref" href="#id3" name="reverse-iterator-requirements"><tt class="literal"><span class="pre">reverse_iterator</span></tt> requirements</a></h1>
|
|
<p>The base <tt class="literal"><span class="pre">Iterator</span></tt> must be a model of Bidirectional Traversal
|
|
Iterator and Readable Iterator.</p>
|
|
</div>
|
|
<div class="section" id="reverse-iterator-models">
|
|
<h1><a class="toc-backref" href="#id4" name="reverse-iterator-models"><tt class="literal"><span class="pre">reverse_iterator</span></tt> models</a></h1>
|
|
<p><tt class="literal"><span class="pre">reverse_iterator</span></tt> models the same standard traversal and access
|
|
iterator concepts that the <tt class="literal"><span class="pre">Iterator</span></tt> argument models. In addition,
|
|
<tt class="literal"><span class="pre">reverse_iterator</span></tt> models the old iterator concepts specified in the
|
|
following table, depnding on what the <tt class="literal"><span class="pre">Iterator</span></tt> argument models.</p>
|
|
<table class="table" frame="border" rules="all">
|
|
<colgroup>
|
|
<col width="62%" />
|
|
<col width="38%" />
|
|
</colgroup>
|
|
<thead valign="bottom">
|
|
<tr><th>If <tt class="literal"><span class="pre">Iterator</span></tt> models</th>
|
|
<th>then <tt class="literal"><span class="pre">reverse_iterator</span></tt> models</th>
|
|
</tr>
|
|
</thead>
|
|
<tbody valign="top">
|
|
<tr><td>Readable Lvalue Iterator,
|
|
Bidirectional Traversal Iterator</td>
|
|
<td>Bidirectional Iterator</td>
|
|
</tr>
|
|
<tr><td>Writable Lvalue Iterator,
|
|
Bidirectional Traversal Iterator</td>
|
|
<td>Mutable Bidirectional Iterator</td>
|
|
</tr>
|
|
<tr><td>Readable Lvalue Iterator,
|
|
Random Access Traversal Iterator</td>
|
|
<td>Random Access Iterator</td>
|
|
</tr>
|
|
<tr><td>Writable Lvalue Iterator,
|
|
Random Access Traversal Iterator</td>
|
|
<td>Mutable Random Access Iterator</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<div class="section" id="reverse-iterator-operations">
|
|
<h1><a class="toc-backref" href="#id5" name="reverse-iterator-operations"><tt class="literal"><span class="pre">reverse_iterator</span></tt> operations</a></h1>
|
|
<p>In addition to the operations required by the concepts modeled by
|
|
<tt class="literal"><span class="pre">reverse_iterator</span></tt>, <tt class="literal"><span class="pre">reverse_iterator</span></tt> provides the following
|
|
operations.</p>
|
|
<p><tt class="literal"><span class="pre">reverse_iterator();</span></tt></p>
|
|
<table class="field-list" frame="void" rules="none">
|
|
<col class="field-name" />
|
|
<col class="field-body" />
|
|
<tbody valign="top">
|
|
<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="literal"><span class="pre">Iterator</span></tt> must be Default Constructible.</td>
|
|
</tr>
|
|
<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">reverse_iterator</span></tt> with <tt class="literal"><span class="pre">m_iterator</span></tt>
|
|
default constructed.</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p><tt class="literal"><span class="pre">explicit</span> <span class="pre">reverse_iterator(Iterator</span> <span class="pre">x);</span></tt></p>
|
|
<table class="field-list" frame="void" rules="none">
|
|
<col class="field-name" />
|
|
<col class="field-body" />
|
|
<tbody valign="top">
|
|
<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">reverse_iterator</span></tt> with a
|
|
<tt class="literal"><span class="pre">m_iterator</span></tt> constructed from <tt class="literal"><span class="pre">x</span></tt>.</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<pre class="literal-block">
|
|
template<class OtherIterator>
|
|
reverse_iterator(
|
|
reverse_iterator<OtherIterator> const& r
|
|
, typename enable_if_convertible<OtherIterator, Iterator>::type* = 0 // exposition
|
|
);
|
|
</pre>
|
|
<table class="field-list" frame="void" rules="none">
|
|
<col class="field-name" />
|
|
<col class="field-body" />
|
|
<tbody valign="top">
|
|
<tr class="field"><th class="field-name">Requires:</th><td class="field-body"><tt class="literal"><span class="pre">OtherIterator</span></tt> is implicitly convertible to <tt class="literal"><span class="pre">Iterator</span></tt>.</td>
|
|
</tr>
|
|
<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">reverse_iterator</span></tt> that is a copy of <tt class="literal"><span class="pre">r</span></tt>.</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p><tt class="literal"><span class="pre">Iterator</span> <span class="pre">base()</span> <span class="pre">const;</span></tt></p>
|
|
<table class="field-list" frame="void" rules="none">
|
|
<col class="field-name" />
|
|
<col class="field-body" />
|
|
<tbody valign="top">
|
|
<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">m_iterator</span></tt></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p><tt class="literal"><span class="pre">reference</span> <span class="pre">operator*()</span> <span class="pre">const;</span></tt></p>
|
|
<table class="field-list" frame="void" rules="none">
|
|
<col class="field-name" />
|
|
<col class="field-body" />
|
|
<tbody valign="top">
|
|
<tr class="field"><th class="field-name">Effects:</th><td class="field-body"></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<pre class="literal-block">
|
|
Iterator tmp = m_iterator;
|
|
return *--tmp;
|
|
</pre>
|
|
<p><tt class="literal"><span class="pre">reverse_iterator&</span> <span class="pre">operator++();</span></tt></p>
|
|
<table class="field-list" frame="void" rules="none">
|
|
<col class="field-name" />
|
|
<col class="field-body" />
|
|
<tbody valign="top">
|
|
<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><tt class="literal"><span class="pre">--m_iterator</span></tt></td>
|
|
</tr>
|
|
<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*this</span></tt></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p><tt class="literal"><span class="pre">reverse_iterator&</span> <span class="pre">operator--();</span></tt></p>
|
|
<table class="field-list" frame="void" rules="none">
|
|
<col class="field-name" />
|
|
<col class="field-body" />
|
|
<tbody valign="top">
|
|
<tr class="field"><th class="field-name">Effects:</th><td class="field-body"><tt class="literal"><span class="pre">++m_iterator</span></tt></td>
|
|
</tr>
|
|
<tr class="field"><th class="field-name">Returns:</th><td class="field-body"><tt class="literal"><span class="pre">*this</span></tt></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<pre class="literal-block">
|
|
template <class BidirectionalIterator>
|
|
reverse_iterator<BidirectionalIterator>n
|
|
make_reverse_iterator(BidirectionalIterator x);
|
|
</pre>
|
|
<table class="field-list" frame="void" rules="none">
|
|
<col class="field-name" />
|
|
<col class="field-body" />
|
|
<tbody valign="top">
|
|
<tr class="field"><th class="field-name">Returns:</th><td class="field-body">An instance of <tt class="literal"><span class="pre">reverse_iterator<BidirectionalIterator></span></tt>
|
|
with a <tt class="literal"><span class="pre">current</span></tt> constructed from <tt class="literal"><span class="pre">x</span></tt>.</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<div class="section" id="example">
|
|
<h1><a class="toc-backref" href="#id6" name="example">Example</a></h1>
|
|
<p>The following example prints an array of characters in reverse order
|
|
using <tt class="literal"><span class="pre">reverse_iterator</span></tt>.</p>
|
|
<pre class="literal-block">
|
|
char letters_[] = "hello world!";
|
|
const int N = sizeof(letters_)/sizeof(char) - 1;
|
|
typedef char* base_iterator;
|
|
base_iterator letters(letters_);
|
|
std::cout << "original sequence of letters:\t\t\t" << letters_ << std::endl;
|
|
|
|
boost::reverse_iterator<base_iterator>
|
|
reverse_letters_first(letters + N),
|
|
reverse_letters_last(letters);
|
|
|
|
std::cout << "sequence in reverse order:\t\t\t";
|
|
std::copy(reverse_letters_first, reverse_letters_last,
|
|
std::ostream_iterator<char>(std::cout));
|
|
std::cout << std::endl;
|
|
|
|
std::cout << "sequence in double-reversed (normal) order:\t";
|
|
std::copy(boost::make_reverse_iterator(reverse_letters_last),
|
|
boost::make_reverse_iterator(reverse_letters_first),
|
|
std::ostream_iterator<char>(std::cout));
|
|
std::cout << std::endl;
|
|
</pre>
|
|
<p>The output is:</p>
|
|
<pre class="literal-block">
|
|
original sequence of letters: hello world!
|
|
sequence in reverse order: !dlrow olleh
|
|
sequence in double-reversed (normal) order: hello world!
|
|
</pre>
|
|
<p>The source code for this example can be found <a class="reference" href="../example/reverse_iterator_example.cpp">here</a>.</p>
|
|
</div>
|
|
</div>
|
|
<hr class="footer"/>
|
|
<div class="footer">
|
|
<a class="reference" href="reverse_iterator.rst">View document source</a>.
|
|
Generated on: 2004-01-13 05:39 UTC.
|
|
Generated by <a class="reference" href="http://docutils.sourceforge.net/">Docutils</a> from <a class="reference" href="http://docutils.sourceforge.net/rst.html">reStructuredText</a> source.
|
|
</div>
|
|
</body>
|
|
</html>
|