You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and dots ('.'), can be up to 35 characters long. Letters must be lowercase.
110 lines
3.6 KiB
110 lines
3.6 KiB
// Copyright Neil Groves 2009. Use, modification and |
|
// distribution is subject to the Boost Software License, Version |
|
// 1.0. (See accompanying file LICENSE_1_0.txt or copy at |
|
// http://www.boost.org/LICENSE_1_0.txt) |
|
// |
|
// |
|
// For more information, see http://www.boost.org/libs/range/ |
|
// |
|
#ifndef BOOST_RANGE_ALGORITHM_FOR_EACH_HPP_INCLUDED |
|
#define BOOST_RANGE_ALGORITHM_FOR_EACH_HPP_INCLUDED |
|
|
|
#include <boost/concept_check.hpp> |
|
#include <boost/range/begin.hpp> |
|
#include <boost/range/end.hpp> |
|
#include <boost/range/concepts.hpp> |
|
#include <boost/ref.hpp> |
|
#include <boost/utility.hpp> |
|
#include <algorithm> |
|
|
|
#if BOOST_WORKAROUND(BOOST_MSVC, == 1600) |
|
#include <xutility> |
|
#endif |
|
|
|
namespace boost |
|
{ |
|
namespace range |
|
{ |
|
|
|
#if BOOST_WORKAROUND(BOOST_MSVC, == 1600) |
|
namespace for_each_detail |
|
{ |
|
template<typename Iterator, typename UnaryFunction> |
|
inline UnaryFunction |
|
for_each_impl(Iterator first, Iterator last, UnaryFunction fun, |
|
typename enable_if< |
|
is_reference_wrapper<UnaryFunction>, |
|
void |
|
>::type* = 0) |
|
{ |
|
typedef typename std::_Get_unchecked_type<Iterator>::type |
|
unchecked_iterator; |
|
|
|
unchecked_iterator unchecked_last = std::_Unchecked(last); |
|
for (unchecked_iterator unchecked_first = std::_Unchecked(first); first != last; ++first) |
|
fun.get()(*unchecked_first); |
|
|
|
return fun; |
|
} |
|
|
|
template<typename Iterator, typename UnaryFunction> |
|
inline UnaryFunction |
|
for_each_impl(Iterator first, Iterator last, UnaryFunction fn, |
|
typename disable_if< |
|
is_reference_wrapper<UnaryFunction>, |
|
void |
|
>::type* = 0) |
|
{ |
|
return std::for_each<Iterator, UnaryFunction>(first, last, fn); |
|
} |
|
} |
|
#endif |
|
|
|
/// \brief template function for_each |
|
/// |
|
/// range-based version of the for_each std algorithm |
|
/// |
|
/// \pre SinglePassRange is a model of the SinglePassRangeConcept |
|
/// \pre UnaryFunction is a model of the UnaryFunctionConcept |
|
template< class SinglePassRange, class UnaryFunction > |
|
inline UnaryFunction for_each(SinglePassRange & rng, UnaryFunction fun) |
|
{ |
|
BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange> )); |
|
|
|
#if BOOST_WORKAROUND(BOOST_MSVC, == 1600) |
|
return for_each_detail::for_each_impl< |
|
typename range_iterator<SinglePassRange>::type, |
|
UnaryFunction |
|
>(boost::begin(rng), boost::end(rng), fun); |
|
#else |
|
return std::for_each< |
|
BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange>::type, |
|
UnaryFunction |
|
>(boost::begin(rng),boost::end(rng),fun); |
|
#endif |
|
} |
|
|
|
/// \overload |
|
template< class SinglePassRange, class UnaryFunction > |
|
inline UnaryFunction for_each(const SinglePassRange& rng, UnaryFunction fun) |
|
{ |
|
BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> )); |
|
|
|
#if BOOST_WORKAROUND(BOOST_MSVC, == 1600) |
|
return for_each_detail::for_each_impl< |
|
typename range_iterator<const SinglePassRange>::type, |
|
UnaryFunction |
|
>(boost::begin(rng), boost::end(rng), fun); |
|
#else |
|
return std::for_each< |
|
BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange>::type, |
|
UnaryFunction |
|
>(boost::begin(rng), boost::end(rng), fun); |
|
#endif |
|
} |
|
|
|
} // namespace range |
|
using range::for_each; |
|
} // namespace boost |
|
|
|
#endif // include guard
|
|
|