// 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_PARTITION__HPP_INCLUDED #define BOOST_RANGE_ALGORITHM_PARTITION__HPP_INCLUDED #include #include #include #include #include #include namespace boost { namespace range { /// \brief template function partition /// /// range-based version of the partition std algorithm /// /// \pre ForwardRange is a model of the ForwardRangeConcept template inline BOOST_DEDUCED_TYPENAME range_iterator::type partition(ForwardRange& rng, UnaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); return std::partition(boost::begin(rng),boost::end(rng),pred); } /// \overload template inline BOOST_DEDUCED_TYPENAME range_iterator::type partition(const ForwardRange& rng, UnaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); return std::partition(boost::begin(rng),boost::end(rng),pred); } // range_return overloads /// \overload template< range_return_value re, class ForwardRange, class UnaryPredicate > inline BOOST_DEDUCED_TYPENAME range_return::type partition(ForwardRange& rng, UnaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); return boost::range_return:: pack(std::partition(boost::begin(rng), boost::end(rng), pred), rng); } /// \overload template< range_return_value re, class ForwardRange, class UnaryPredicate > inline BOOST_DEDUCED_TYPENAME range_return::type partition(const ForwardRange& rng, UnaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); return boost::range_return:: pack(std::partition(boost::begin(rng), boost::end(rng), pred), rng); } } // namespace range using range::partition; } // namespace boost #endif // include guard