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

Fix many typos in the comments and documentation; no functionality change. Thanks to Michael Morin for the patch

Browse Source 
[SVN r82239]
This commit is contained in:
Marshall Clow
2012-12-28 17:51:56 +00:00
parent d6d75c9a31
commit 771375973f
21 changed files with 45 additions and 45 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
doc/ordered-hpp.qbk
View File

@ -73,7 +73,7 @@ Given the sequence `{ 1, 2, 3, 4, 5, 9 }`, `is_sorted_until ( beg, end, std::l
There are also a set of "wrapper functions" for is_ordered which make it easy to see if an entire sequence is ordered. These functions return a boolean indicating success or failure rather than an iterator to where the out of order items were found.
To test if a sequence is increasing (each element at least as large as the preceeding one):
To test if a sequence is increasing (each element at least as large as the preceding one):
``
namespace boost { namespace algorithm {
template <typename Iterator>
@ -84,7 +84,7 @@ namespace boost { namespace algorithm {
}}
``
To test if a sequence is decreasing (each element no larger than the preceeding one):
To test if a sequence is decreasing (each element no larger than the preceding one):
``
namespace boost { namespace algorithm {
@ -96,7 +96,7 @@ namespace boost { namespace algorithm {
}}
``
To test if a sequence is strictly increasing (each element larger than the preceeding one):
To test if a sequence is strictly increasing (each element larger than the preceding one):
``
namespace boost { namespace algorithm {
template <typename Iterator>
@ -107,7 +107,7 @@ namespace boost { namespace algorithm {
}}
``
To test if a sequence is strictly decreasing (each element smaller than the preceeding one):
To test if a sequence is strictly decreasing (each element smaller than the preceding one):
``
namespace boost { namespace algorithm {
template <typename Iterator>