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

Fix some test (more) failures in Boost.Algorithm

Browse Source 
[SVN r77073]
This commit is contained in:
Marshall Clow
2012-02-19 16:17:27 +00:00
parent f023127c99
commit eb8291e0aa
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -14,8 +14,8 @@
#include <algorithm> // for std::less, tie, mismatch and is_permutation (if available) #include <algorithm> // for std::less, tie, mismatch and is_permutation (if available)
#include <utility> // for std::make_pair #include <utility> // for std::make_pair
#include <functional> // for std::equal_to
#include <iterator> #include <iterator>
#include <iostream>
#include <boost/range/begin.hpp> #include <boost/range/begin.hpp>
#include <boost/range/end.hpp> #include <boost/range/end.hpp>

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

@ -233,7 +233,7 @@ using std::is_sorted; // Section 25.4.1.5
bool is_strictly_increasing ( ForwardIterator first, ForwardIterator last ) bool is_strictly_increasing ( ForwardIterator first, ForwardIterator last )
{ {
typedef typename std::iterator_traits<ForwardIterator>::value_type value_type; typedef typename std::iterator_traits<ForwardIterator>::value_type value_type;
return is_sorted (first, last, std::less<value_type>()); return boost::algorithm::is_sorted (first, last, std::less<value_type>());
} }
/// \fn is_strictly_increasing ( const R &range ) /// \fn is_strictly_increasing ( const R &range )