[Boost-commit] svn:boost r86741 - trunk/libs/algorithm/doc

Subject: [Boost-commit] svn:boost r86741 - trunk/libs/algorithm/doc
From: marshall_at_[hidden]
Date: 2013-11-17 15:47:14

Author: marshall
Date: 2013-11-17 15:47:14 EST (Sun, 17 Nov 2013)
New Revision: 86741
URL: http://svn.boost.org/trac/boost/changeset/86741

Log:
Updated docs for is_sorted, etc. Refs #9367

Text files modified: 
   trunk/libs/algorithm/doc/ordered-hpp.qbk |    22 +++++++++++-----------                  
   1 files changed, 11 insertions(+), 11 deletions(-)

Modified: trunk/libs/algorithm/doc/ordered-hpp.qbk
==============================================================================
--- trunk/libs/algorithm/doc/ordered-hpp.qbk	Sun Nov 17 12:17:50 2013	(r86740)
+++ trunk/libs/algorithm/doc/ordered-hpp.qbk	2013-11-17 15:47:14 EST (Sun, 17 Nov 2013)	(r86741)
@@ -19,11 +19,11 @@
 
 ``
 namespace boost { namespace algorithm {
-	template <typename Iterator, typename Pred>
-	bool is_sorted ( Iterator first, Iterator last, Pred p );
+	template <typename ForwardIterator, typename Pred>
+	bool is_sorted ( ForwardIterator first, ForwardIterator last, Pred p );
         
-	template <typename Iterator>
-	bool is_sorted ( Iterator first, Iterator last );
+	template <typename ForwardIterator>
+	bool is_sorted ( ForwardIterator first, ForwardIterator last );
         
         
         template <typename Range, typename Pred>
@@ -34,7 +34,7 @@
 }}
 ``
 
-Iterator requirements: The `is_sorted` functions will work on all kinds of iterators (except output iterators). 
+Iterator requirements: The `is_sorted` functions will work forward iterators or better.
 
 [heading is_sorted_until]
 
@@ -88,8 +88,8 @@
 
 ``
 namespace boost { namespace algorithm {
-	template <typename Iterator>
-	bool is_decreasing ( Iterator first, Iterator last );
+	template <typename ForwardIterator>
+	bool is_decreasing ( ForwardIterator first, ForwardIterator last );
         
         template <typename R>
         bool is_decreasing ( const R &range );
@@ -99,8 +99,8 @@
 To test if a sequence is strictly increasing (each element larger than the preceding one):
 ``
 namespace boost { namespace algorithm {
-	template <typename Iterator>
-	bool is_strictly_increasing ( Iterator first, Iterator last );
+	template <typename ForwardIterator>
+	bool is_strictly_increasing ( ForwardIterator first, ForwardIterator last );
         
         template <typename R>
         bool is_strictly_increasing ( const R &range );
@@ -110,8 +110,8 @@
 To test if a sequence is strictly decreasing (each element smaller than the preceding one):
 ``
 namespace boost { namespace algorithm {
-	template <typename Iterator>
-	bool is_strictly_decreasing ( Iterator first, Iterator last );
+	template <typename ForwardIterator>
+	bool is_strictly_decreasing ( ForwardIterator first, ForwardIterator last );
         
         template <typename R>
         bool is_strictly_decreasing ( const R &range );