changed the stuff about iterator_category in reverse_iterator to match

the language we decided on for filter_iterator


[SVN r21687]

doc/facade-and-adaptor.html

@@ -1493,20 +1493,13 @@ 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&lt;Iterator&gt;::value_type</span></tt>, <tt class="literal"><span class="pre">R</span></tt> be
-<tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::reference</span></tt>, and <tt class="literal"><span class="pre">C</span></tt> be
-<tt class="literal"><span class="pre">traveral_category&lt;Iterator&gt;::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>
+<p>If <tt class="literal"><span class="pre">Iterator</span></tt> models Random Access Traversal Iterator and Readable
+Lvalue Iterator, then <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
+<tt class="literal"><span class="pre">random_access_iterator_tag</span></tt>. Otherwise, if
+<tt class="literal"><span class="pre">Iterator</span></tt> models Bidirectional Traversal Iterator and Readable
+Lvalue Iterator, then <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
+<tt class="literal"><span class="pre">bidirectional_iterator_tag</span></tt>. Otherwise, <tt class="literal"><span class="pre">iterator_category</span></tt> is
+convertible to <tt class="literal"><span class="pre">input_iterator_tag</span></tt>.</p>
 </div>
 <div class="section" id="reverse-iterator-requirements">
 <h4><a class="toc-backref" href="#id48" name="reverse-iterator-requirements"><tt class="literal"><span class="pre">reverse_iterator</span></tt> requirements</a></h4>
@@ -2340,7 +2333,7 @@ LocalWords:  OtherIncrementable Coplien -->
 <hr class="footer" />
 <div class="footer">
 <a class="reference" href="facade-and-adaptor.rst">View document source</a>.
-Generated on: 2004-01-13 18:07 UTC.
+Generated on: 2004-01-13 18:15 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>

doc/reverse_iterator.html

@@ -80,20 +80,13 @@ 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&lt;Iterator&gt;::value_type</span></tt>, <tt class="literal"><span class="pre">R</span></tt> be
-<tt class="literal"><span class="pre">iterator_traits&lt;Iterator&gt;::reference</span></tt>, and <tt class="literal"><span class="pre">C</span></tt> be
-<tt class="literal"><span class="pre">traveral_category&lt;Iterator&gt;::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>
+<p>If <tt class="literal"><span class="pre">Iterator</span></tt> models Random Access Traversal Iterator and Readable
+Lvalue Iterator, then <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
+<tt class="literal"><span class="pre">random_access_iterator_tag</span></tt>. Otherwise, if
+<tt class="literal"><span class="pre">Iterator</span></tt> models Bidirectional Traversal Iterator and Readable
+Lvalue Iterator, then <tt class="literal"><span class="pre">iterator_category</span></tt> is convertible to
+<tt class="literal"><span class="pre">bidirectional_iterator_tag</span></tt>. Otherwise, <tt class="literal"><span class="pre">iterator_category</span></tt> is
+convertible to <tt class="literal"><span class="pre">input_iterator_tag</span></tt>.</p>
 </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>
@@ -276,7 +269,7 @@ sequence in double-reversed (normal) order:     hello world!
 <hr class="footer" />
 <div class="footer">
 <a class="reference" href="reverse_iterator.rst">View document source</a>.
-Generated on: 2004-01-13 14:26 UTC.
+Generated on: 2004-01-13 18:15 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>

doc/reverse_iterator_ref.rst

@@ -27,21 +27,13 @@
   };
 
 
-The ``iterator_category`` member is a type convertible to the iterator
-tag given by the following algorithm.  Let ``T`` be
-``iterator_traits<Iterator>::value_type``, ``R`` be
-``iterator_traits<Iterator>::reference``, and ``C`` be
-``traveral_category<Iterator>::type``.
-
-::
-
-    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
+If ``Iterator`` models Random Access Traversal Iterator and Readable
+Lvalue Iterator, then ``iterator_category`` is convertible to
+``random_access_iterator_tag``. Otherwise, if
+``Iterator`` models Bidirectional Traversal Iterator and Readable
+Lvalue Iterator, then ``iterator_category`` is convertible to
+``bidirectional_iterator_tag``. Otherwise, ``iterator_category`` is
+convertible to ``input_iterator_tag``.