// 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_EQUAL_RANGE_HPP_INCLUDED #define BOOST_RANGE_ALGORITHM_EQUAL_RANGE_HPP_INCLUDED #include #include #include #include #include namespace boost { /// \brief template function equal_range /// /// range-based version of the equal_range std algorithm /// /// \pre ForwardRange is a model of the ForwardRangeConcept /// \pre SortPredicate is a model of the BinaryPredicateConcept template inline std::pair< BOOST_DEDUCED_TYPENAME boost::range_iterator::type, BOOST_DEDUCED_TYPENAME boost::range_iterator::type > equal_range(ForwardRange& rng, const Value& val) { boost::function_requires< ForwardRangeConcept >(); return std::equal_range(boost::begin(rng), boost::end(rng), val); } /// \overload template inline std::pair< BOOST_DEDUCED_TYPENAME boost::range_iterator::type, BOOST_DEDUCED_TYPENAME boost::range_iterator::type > equal_range(const ForwardRange& rng, const Value& val) { boost::function_requires< ForwardRangeConcept >(); return std::equal_range(boost::begin(rng), boost::end(rng), val); } /// \overload template inline std::pair< BOOST_DEDUCED_TYPENAME boost::range_iterator::type, BOOST_DEDUCED_TYPENAME boost::range_iterator::type > equal_range(ForwardRange& rng, const Value& val, SortPredicate pred) { boost::function_requires< ForwardRangeConcept >(); return std::equal_range(boost::begin(rng), boost::end(rng), val, pred); } /// \overload template inline std::pair< BOOST_DEDUCED_TYPENAME boost::range_iterator::type, BOOST_DEDUCED_TYPENAME boost::range_iterator::type > equal_range(const ForwardRange& rng, const Value& val, SortPredicate pred) { boost::function_requires< ForwardRangeConcept >(); return std::equal_range(boost::begin(rng), boost::end(rng), val, pred); } } #endif // include guard