feedc0de/boost_algorithm
1
0
Fork 0
forked from boostorg/algorithm
Code Pull Requests Activity

Updated docs for is_sorted, etc. Refs #9367

Browse Source 
[SVN r86741]
This commit is contained in:
Marshall Clow
2013-11-17 20:47:14 +00:00
parent 747722a8da
commit 0ac413ecb8
1 changed files with 11 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
doc/ordered-hpp.qbk
View File

@ -19,11 +19,11 @@ The function `is_sorted(sequence)` determines whether or not a sequence is compl
`` ``
namespace boost { namespace algorithm { namespace boost { namespace algorithm {
template <typename Iterator, typename Pred> template <typename ForwardIterator, typename Pred>
bool is_sorted ( Iterator first, Iterator last, Pred p ); bool is_sorted ( ForwardIterator first, ForwardIterator last, Pred p );
template <typename Iterator> template <typename ForwardIterator>
bool is_sorted ( Iterator first, Iterator last ); bool is_sorted ( ForwardIterator first, ForwardIterator last );
template <typename Range, typename Pred> template <typename Range, typename Pred>
@ -34,7 +34,7 @@ namespace boost { namespace algorithm {
}} }}
`` ``
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] [heading is_sorted_until]
@ -88,8 +88,8 @@ To test if a sequence is decreasing (each element no larger than the preceding o
`` ``
namespace boost { namespace algorithm { namespace boost { namespace algorithm {
template <typename Iterator> template <typename ForwardIterator>
bool is_decreasing ( Iterator first, Iterator last ); bool is_decreasing ( ForwardIterator first, ForwardIterator last );
template <typename R> template <typename R>
bool is_decreasing ( const R &range ); bool is_decreasing ( const R &range );
@ -99,8 +99,8 @@ namespace boost { namespace algorithm {
To test if a sequence is strictly increasing (each element larger than the preceding one): To test if a sequence is strictly increasing (each element larger than the preceding one):
`` ``
namespace boost { namespace algorithm { namespace boost { namespace algorithm {
template <typename Iterator> template <typename ForwardIterator>
bool is_strictly_increasing ( Iterator first, Iterator last ); bool is_strictly_increasing ( ForwardIterator first, ForwardIterator last );
template <typename R> template <typename R>
bool is_strictly_increasing ( const R &range ); bool is_strictly_increasing ( const R &range );
@ -110,8 +110,8 @@ namespace boost { namespace algorithm {
To test if a sequence is strictly decreasing (each element smaller than the preceding one): To test if a sequence is strictly decreasing (each element smaller than the preceding one):
`` ``
namespace boost { namespace algorithm { namespace boost { namespace algorithm {
template <typename Iterator> template <typename ForwardIterator>
bool is_strictly_decreasing ( Iterator first, Iterator last ); bool is_strictly_decreasing ( ForwardIterator first, ForwardIterator last );
template <typename R> template <typename R>
bool is_strictly_decreasing ( const R &range ); bool is_strictly_decreasing ( const R &range );