boostorg/algorithm
1
0
Fork 1
mirror of https://github.com/boostorg/algorithm.git synced 2025-07-02 07:21:06 +02:00
Code Issues Packages Projects Releases Wiki Activity

Merge Boost.Algorithm inspection report changes to release. No functionality change

Browse Source 
[SVN r78689]
This commit is contained in:
Marshall Clow
2012-05-27 15:45:18 +00:00
parent 563fe27a59
commit 96d4708367
20 changed files with 166 additions and 166 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
include/boost/algorithm/cxx11/all_of.hpp
View File

@ -12,7 +12,7 @@
#ifndef BOOST_ALGORITHM_ALL_OF_HPP
#define BOOST_ALGORITHM_ALL_OF_HPP
#include <algorithm> // for std::all_of, if available
#include <algorithm> // for std::all_of, if available
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>

2
include/boost/algorithm/cxx11/any_of.hpp
View File

@ -14,7 +14,7 @@
#ifndef BOOST_ALGORITHM_ANY_OF_HPP
#define BOOST_ALGORITHM_ANY_OF_HPP
#include <algorithm> // for std::any_of, if available
#include <algorithm> // for std::any_of, if available
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>

2
include/boost/algorithm/cxx11/copy_if.hpp
View File

@ -12,7 +12,7 @@
#ifndef BOOST_ALGORITHM_COPY_IF_HPP
#define BOOST_ALGORITHM_COPY_IF_HPP
#include <algorithm> // for std::copy_if, if available
#include <algorithm> // for std::copy_if, if available
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>

2
include/boost/algorithm/cxx11/iota.hpp
View File

@ -71,4 +71,4 @@ OutputIterator iota_n ( OutputIterator out, T value, std::size_t n )
}}
#endif // BOOST_ALGORITHM_IOTA_HPP
#endif // BOOST_ALGORITHM_IOTA_HPP

12
include/boost/algorithm/cxx11/is_partitioned.hpp
View File

@ -12,7 +12,7 @@
#ifndef BOOST_ALGORITHM_IS_PARTITIONED_HPP
#define BOOST_ALGORITHM_IS_PARTITIONED_HPP
#include <algorithm> // for std::is_partitioned, if available
#include <algorithm> // for std::is_partitioned, if available
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
@ -35,14 +35,14 @@ using std::is_partitioned; // Section 25.3.13
template <typename InputIterator, typename UnaryPredicate>
bool is_partitioned ( InputIterator first, InputIterator last, UnaryPredicate p )
{
// Run through the part that satisfy the predicate
// Run through the part that satisfy the predicate
for ( ; first != last; ++first )
if ( !p (*first))
break;
// Now the part that does not satisfy the predicate
break;
// Now the part that does not satisfy the predicate
for ( ; first != last; ++first )
if ( p (*first))
return false;
return false;
return true;
}
#endif
@ -62,4 +62,4 @@ bool is_partitioned ( const Range &r, UnaryPredicate p )
}}
#endif // BOOST_ALGORITHM_IS_PARTITIONED_HPP
#endif // BOOST_ALGORITHM_IS_PARTITIONED_HPP

2
include/boost/algorithm/cxx11/is_permutation.hpp
View File

@ -136,4 +136,4 @@ is_permutation ( const Range &r, ForwardIterator first2, BinaryPredicate pred )
}}
#endif // BOOST_ALGORITHM_IS_PERMUTATION_HPP
#endif // BOOST_ALGORITHM_IS_PERMUTATION_HPP

6
include/boost/algorithm/cxx11/is_sorted.hpp
View File

@ -94,7 +94,7 @@ using std::is_sorted; // Section 25.4.1.5
#endif
///
/// -- Range based versions of the C++11 functions
/// -- Range based versions of the C++11 functions
///
/// \fn is_sorted_until ( const R &range, Pred p )
@ -126,7 +126,7 @@ using std::is_sorted; // Section 25.4.1.5
}
namespace detail {
typedef struct { typedef bool type; } bool_;
typedef struct { typedef bool type; } bool_;
};
/// \fn is_sorted ( const R &range, Pred p )
@ -157,7 +157,7 @@ namespace detail {
///
/// -- Range based versions of the C++11 functions
/// -- Range based versions of the C++11 functions
///
/// \fn is_increasing ( ForwardIterator first, ForwardIterator last )

2
include/boost/algorithm/cxx11/none_of.hpp
View File

@ -12,7 +12,7 @@
#ifndef BOOST_ALGORITHM_NONE_OF_HPP
#define BOOST_ALGORITHM_NONE_OF_HPP
#include <algorithm> // for std::none_of, if available
#include <algorithm> // for std::none_of, if available
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>

2
include/boost/algorithm/cxx11/partition_copy.hpp
View File

@ -12,7 +12,7 @@
#ifndef BOOST_ALGORITHM_PARTITION_COPY_HPP
#define BOOST_ALGORITHM_PARTITION_COPY_HPP
#include <algorithm> // for std::partition_copy, if available
#include <algorithm> // for std::partition_copy, if available
#include <utility> // for make_pair
#include <boost/range/begin.hpp>

6
include/boost/algorithm/cxx11/partition_point.hpp
View File

@ -12,7 +12,7 @@
#ifndef BOOST_ALGORITHM_PARTITION_POINT_HPP
#define BOOST_ALGORITHM_PARTITION_POINT_HPP
#include <algorithm> // for std::partition_point, if available
#include <algorithm> // for std::partition_point, if available
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
@ -25,7 +25,7 @@ using std::partition_point; // Section 25.3.13
#else
/// \fn partition_point ( ForwardIterator first, ForwardIterator last, Predicate p )
/// \brief Given a partitioned range, returns the partition point, i.e, the first element
/// that does not satisfy p
/// that does not satisfy p
///
/// \param first The start of the input sequence
/// \param last One past the end of the input sequence
@ -69,4 +69,4 @@ typename boost::range_iterator<Range> partition_point ( Range &r, Predicate p )
}}
#endif // BOOST_ALGORITHM_PARTITION_POINT_HPP
#endif // BOOST_ALGORITHM_PARTITION_POINT_HPP

2
include/boost/algorithm/hex.hpp
View File

@ -45,7 +45,7 @@ namespace boost { namespace algorithm {
\struct non_hex_input
\brief Thrown when a non-hex value (0-9, A-F) encountered when decoding.
Contains the offending character
Contains the offending character
\struct not_enough_input
\brief Thrown when the input sequence unexpectedly ends

2
include/boost/algorithm/searching/knuth_morris_pratt.hpp
View File

@ -32,7 +32,7 @@ namespace boost { namespace algorithm {
* Random-access iterators
* The two iterator types (I1 and I2) must "point to" the same underlying type.
http://en.wikipedia.org/wiki/Knuth–Morris–Pratt_algorithm
http://en.wikipedia.org/wiki/Knuth-Morris-Pratt_algorithm
http://www.inf.fh-flensburg.de/lang/algorithmen/pattern/kmpen.htm
*/