feedc0de/boost_range
1
0
Fork 0
forked from boostorg/range
Code Pull Requests Activity

Removed the use of __gnu_cxx::is_sorted from Boost.Graph as it's lolnonportable,

Browse Source 
implemented a version of the algorithm as a replacement,



[SVN r68144]
This commit is contained in:
Bryce Adelstein-Lelbach
2011-01-14 03:02:47 +00:00
parent 2da424d940
commit 367582d0f4
1 changed files with 14 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

42
include/boost/range/algorithm_ext/is_sorted.hpp
View File

@ -1,3 +1,4 @@
// Copyright Bryce Lelbach 2010
// Copyright Neil Groves 2009. Use, modification and // Copyright Neil Groves 2009. Use, modification and
// distribution is subject to the Boost Software License, Version // distribution is subject to the Boost Software License, Version
// 1.0. (See accompanying file LICENSE_1_0.txt or copy at // 1.0. (See accompanying file LICENSE_1_0.txt or copy at
@ -14,45 +15,26 @@
#include <boost/range/end.hpp> #include <boost/range/end.hpp>
#include <boost/range/concepts.hpp> #include <boost/range/concepts.hpp>
#include <boost/range/value_type.hpp> #include <boost/range/value_type.hpp>
#include <boost/detail/is_sorted.hpp>
#include <algorithm> #include <algorithm>
namespace boost namespace boost
{ {
namespace range_detail
{
template<class ForwardIterator>
inline bool is_sorted(ForwardIterator first, ForwardIterator last)
{
for (ForwardIterator next = first; first != last && ++next != last; ++first)
if (*next < *first)
return false;
return true;
}
template<class ForwardIterator, class BinaryPredicate>
inline bool is_sorted(ForwardIterator first, ForwardIterator last, BinaryPredicate pred)
{
for (ForwardIterator next = first; first != last && ++next != last; ++first)
if (pred(*next, *first))
return false;
return true;
}
}
namespace range namespace range
{ {
/// \brief template function count /// \brief template function is_sorted
/// ///
/// range-based version of the count std algorithm /// range-based version of the is_sorted std algorithm
/// ///
/// \pre SinglePassRange is a model of the SinglePassRangeConcept /// \pre SinglePassRange is a model of the SinglePassRangeConcept
template<class SinglePassRange> template<class SinglePassRange>
inline bool is_sorted(const SinglePassRange& rng) inline bool is_sorted(const SinglePassRange& rng)
{ {
BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange>)); BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange>));
BOOST_RANGE_CONCEPT_ASSERT((LessThanComparableConcept<BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange>::type>)); BOOST_RANGE_CONCEPT_ASSERT((LessThanComparableConcept<BOOST_DEDUCED_TYPENAME
return range_detail::is_sorted(boost::begin(rng), boost::end(rng)); range_value<const SinglePassRange>::type>));
return boost::detail::is_sorted(boost::begin(rng), boost::end(rng));
} }
/// \overload /// \overload
@ -60,12 +42,16 @@ template<class SinglePassRange, class BinaryPredicate>
inline bool is_sorted(const SinglePassRange& rng, BinaryPredicate pred) inline bool is_sorted(const SinglePassRange& rng, BinaryPredicate pred)
{ {
BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange>)); BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange>));
BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate, BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange>::type, BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange>::type>)); BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
return range_detail::is_sorted(boost::begin(rng), boost::end(rng), pred); BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange>::type,
BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange>::type>));
return boost::detail::is_sorted(boost::begin(rng), boost::end(rng), pred);
} }
} // namespace range } // namespace range
using range::is_sorted;
using range::is_sorted;
} // namespace boost } // namespace boost
#endif // include guard #endif // include guard