Chris@16
|
1 // Copyright Neil Groves 2009. Use, modification and
|
Chris@16
|
2 // distribution is subject to the Boost Software License, Version
|
Chris@16
|
3 // 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
Chris@16
|
4 // http://www.boost.org/LICENSE_1_0.txt)
|
Chris@16
|
5 //
|
Chris@16
|
6 //
|
Chris@16
|
7 // For more information, see http://www.boost.org/libs/range/
|
Chris@16
|
8 //
|
Chris@16
|
9 #ifndef BOOST_RANGE_ALGORITHM_EQUAL_RANGE_HPP_INCLUDED
|
Chris@16
|
10 #define BOOST_RANGE_ALGORITHM_EQUAL_RANGE_HPP_INCLUDED
|
Chris@16
|
11
|
Chris@16
|
12 #include <boost/concept_check.hpp>
|
Chris@16
|
13 #include <boost/range/begin.hpp>
|
Chris@16
|
14 #include <boost/range/end.hpp>
|
Chris@16
|
15 #include <boost/range/concepts.hpp>
|
Chris@16
|
16 #include <algorithm>
|
Chris@16
|
17
|
Chris@16
|
18 namespace boost
|
Chris@16
|
19 {
|
Chris@16
|
20 namespace range
|
Chris@16
|
21 {
|
Chris@16
|
22
|
Chris@16
|
23 /// \brief template function equal_range
|
Chris@16
|
24 ///
|
Chris@16
|
25 /// range-based version of the equal_range std algorithm
|
Chris@16
|
26 ///
|
Chris@16
|
27 /// \pre ForwardRange is a model of the ForwardRangeConcept
|
Chris@16
|
28 /// \pre SortPredicate is a model of the BinaryPredicateConcept
|
Chris@16
|
29 template<class ForwardRange, class Value>
|
Chris@16
|
30 inline std::pair<
|
Chris@16
|
31 BOOST_DEDUCED_TYPENAME boost::range_iterator<ForwardRange>::type,
|
Chris@16
|
32 BOOST_DEDUCED_TYPENAME boost::range_iterator<ForwardRange>::type
|
Chris@16
|
33 >
|
Chris@16
|
34 equal_range(ForwardRange& rng, const Value& val)
|
Chris@16
|
35 {
|
Chris@16
|
36 BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
|
Chris@16
|
37 return std::equal_range(boost::begin(rng), boost::end(rng), val);
|
Chris@16
|
38 }
|
Chris@16
|
39
|
Chris@16
|
40 /// \overload
|
Chris@16
|
41 template<class ForwardRange, class Value>
|
Chris@16
|
42 inline std::pair<
|
Chris@16
|
43 BOOST_DEDUCED_TYPENAME boost::range_iterator<const ForwardRange>::type,
|
Chris@16
|
44 BOOST_DEDUCED_TYPENAME boost::range_iterator<const ForwardRange>::type
|
Chris@16
|
45 >
|
Chris@16
|
46 equal_range(const ForwardRange& rng, const Value& val)
|
Chris@16
|
47 {
|
Chris@16
|
48 BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
|
Chris@16
|
49 return std::equal_range(boost::begin(rng), boost::end(rng), val);
|
Chris@16
|
50 }
|
Chris@16
|
51
|
Chris@16
|
52 /// \overload
|
Chris@16
|
53 template<class ForwardRange, class Value, class SortPredicate>
|
Chris@16
|
54 inline std::pair<
|
Chris@16
|
55 BOOST_DEDUCED_TYPENAME boost::range_iterator<ForwardRange>::type,
|
Chris@16
|
56 BOOST_DEDUCED_TYPENAME boost::range_iterator<ForwardRange>::type
|
Chris@16
|
57 >
|
Chris@16
|
58 equal_range(ForwardRange& rng, const Value& val, SortPredicate pred)
|
Chris@16
|
59 {
|
Chris@16
|
60 BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
|
Chris@16
|
61 return std::equal_range(boost::begin(rng), boost::end(rng), val, pred);
|
Chris@16
|
62 }
|
Chris@16
|
63
|
Chris@16
|
64 /// \overload
|
Chris@16
|
65 template<class ForwardRange, class Value, class SortPredicate>
|
Chris@16
|
66 inline std::pair<
|
Chris@16
|
67 BOOST_DEDUCED_TYPENAME boost::range_iterator<const ForwardRange>::type,
|
Chris@16
|
68 BOOST_DEDUCED_TYPENAME boost::range_iterator<const ForwardRange>::type
|
Chris@16
|
69 >
|
Chris@16
|
70 equal_range(const ForwardRange& rng, const Value& val, SortPredicate pred)
|
Chris@16
|
71 {
|
Chris@16
|
72 BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
|
Chris@16
|
73 return std::equal_range(boost::begin(rng), boost::end(rng), val, pred);
|
Chris@16
|
74 }
|
Chris@16
|
75
|
Chris@16
|
76 } // namespace range
|
Chris@16
|
77 using range::equal_range;
|
Chris@16
|
78 } // namespace boost
|
Chris@16
|
79
|
Chris@16
|
80 #endif // include guard
|