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_FIND_FIRST_OF_HPP_INCLUDED
|
Chris@16
|
10 #define BOOST_RANGE_ALGORITHM_FIND_FIRST_OF_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 <boost/range/detail/range_return.hpp>
|
Chris@16
|
17 #include <algorithm>
|
Chris@16
|
18
|
Chris@16
|
19 namespace boost
|
Chris@16
|
20 {
|
Chris@16
|
21 namespace range
|
Chris@16
|
22 {
|
Chris@16
|
23
|
Chris@16
|
24 /// \brief template function find_first_of
|
Chris@16
|
25 ///
|
Chris@16
|
26 /// range-based version of the find_first_of std algorithm
|
Chris@16
|
27 ///
|
Chris@16
|
28 /// \pre SinglePassRange1 is a model of the SinglePassRangeConcept
|
Chris@16
|
29 /// \pre ForwardRange2 is a model of the ForwardRangeConcept
|
Chris@16
|
30 /// \pre BinaryPredicate is a model of the BinaryPredicateConcept
|
Chris@16
|
31 template< class SinglePassRange1, class ForwardRange2 >
|
Chris@16
|
32 inline BOOST_DEDUCED_TYPENAME disable_if<
|
Chris@16
|
33 is_const<SinglePassRange1>,
|
Chris@16
|
34 BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type
|
Chris@16
|
35 >::type
|
Chris@16
|
36 find_first_of(SinglePassRange1 & rng1, ForwardRange2 const & rng2)
|
Chris@16
|
37 {
|
Chris@16
|
38 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
|
Chris@16
|
39 BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
|
Chris@16
|
40
|
Chris@16
|
41 return std::find_first_of(boost::begin(rng1),boost::end(rng1),
|
Chris@16
|
42 boost::begin(rng2),boost::end(rng2));
|
Chris@16
|
43 }
|
Chris@16
|
44
|
Chris@16
|
45 /// \overload
|
Chris@16
|
46 template< class SinglePassRange1, class ForwardRange2 >
|
Chris@16
|
47 inline BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type
|
Chris@16
|
48 find_first_of(const SinglePassRange1& rng1, const ForwardRange2& rng2)
|
Chris@16
|
49 {
|
Chris@16
|
50 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
|
Chris@16
|
51 BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
|
Chris@16
|
52
|
Chris@16
|
53 return std::find_first_of(boost::begin(rng1),boost::end(rng1),
|
Chris@16
|
54 boost::begin(rng2),boost::end(rng2));
|
Chris@16
|
55 }
|
Chris@16
|
56
|
Chris@16
|
57 /// \overload
|
Chris@16
|
58 template< class SinglePassRange1, class ForwardRange2, class BinaryPredicate >
|
Chris@16
|
59 inline BOOST_DEDUCED_TYPENAME disable_if<
|
Chris@16
|
60 is_const<SinglePassRange1>,
|
Chris@16
|
61 BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type
|
Chris@16
|
62 >::type
|
Chris@16
|
63 find_first_of(SinglePassRange1 & rng1, ForwardRange2 const & rng2, BinaryPredicate pred)
|
Chris@16
|
64 {
|
Chris@16
|
65 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
|
Chris@16
|
66 BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
|
Chris@16
|
67
|
Chris@16
|
68 return std::find_first_of(boost::begin(rng1),boost::end(rng1),
|
Chris@16
|
69 boost::begin(rng2),boost::end(rng2),pred);
|
Chris@16
|
70 }
|
Chris@16
|
71
|
Chris@16
|
72 /// \overload
|
Chris@16
|
73 template< class SinglePassRange1, class ForwardRange2, class BinaryPredicate >
|
Chris@16
|
74 inline BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type
|
Chris@16
|
75 find_first_of(const SinglePassRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred)
|
Chris@16
|
76 {
|
Chris@16
|
77 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
|
Chris@16
|
78 BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
|
Chris@16
|
79
|
Chris@16
|
80 return std::find_first_of(boost::begin(rng1),boost::end(rng1),
|
Chris@16
|
81 boost::begin(rng2),boost::end(rng2),pred);
|
Chris@16
|
82 }
|
Chris@16
|
83
|
Chris@16
|
84 // range return overloads
|
Chris@16
|
85 /// \overload
|
Chris@16
|
86 template< range_return_value re, class SinglePassRange1, class ForwardRange2 >
|
Chris@16
|
87 inline BOOST_DEDUCED_TYPENAME disable_if<
|
Chris@16
|
88 is_const<SinglePassRange1>,
|
Chris@16
|
89 BOOST_DEDUCED_TYPENAME range_return<SinglePassRange1,re>::type
|
Chris@16
|
90 >::type
|
Chris@16
|
91 find_first_of(SinglePassRange1& rng1, const ForwardRange2& rng2)
|
Chris@16
|
92 {
|
Chris@16
|
93 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
|
Chris@16
|
94 BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
|
Chris@16
|
95
|
Chris@16
|
96 return range_return<SinglePassRange1,re>::
|
Chris@16
|
97 pack(std::find_first_of(boost::begin(rng1), boost::end(rng1),
|
Chris@16
|
98 boost::begin(rng2), boost::end(rng2)),
|
Chris@16
|
99 rng1);
|
Chris@16
|
100 }
|
Chris@16
|
101
|
Chris@16
|
102 /// \overload
|
Chris@16
|
103 template< range_return_value re, class SinglePassRange1, class ForwardRange2 >
|
Chris@16
|
104 inline BOOST_DEDUCED_TYPENAME range_return<const SinglePassRange1,re>::type
|
Chris@16
|
105 find_first_of(const SinglePassRange1& rng1, const ForwardRange2& rng2)
|
Chris@16
|
106 {
|
Chris@16
|
107 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
|
Chris@16
|
108 BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
|
Chris@16
|
109
|
Chris@16
|
110 return range_return<const SinglePassRange1,re>::
|
Chris@16
|
111 pack(std::find_first_of(boost::begin(rng1), boost::end(rng1),
|
Chris@16
|
112 boost::begin(rng2), boost::end(rng2)),
|
Chris@16
|
113 rng1);
|
Chris@16
|
114 }
|
Chris@16
|
115
|
Chris@16
|
116 /// \overload
|
Chris@16
|
117 template< range_return_value re, class SinglePassRange1, class ForwardRange2,
|
Chris@16
|
118 class BinaryPredicate >
|
Chris@16
|
119 inline BOOST_DEDUCED_TYPENAME disable_if<
|
Chris@16
|
120 is_const<SinglePassRange1>,
|
Chris@16
|
121 BOOST_DEDUCED_TYPENAME range_return<SinglePassRange1,re>::type
|
Chris@16
|
122 >::type
|
Chris@16
|
123 find_first_of(SinglePassRange1 & rng1, const ForwardRange2& rng2,
|
Chris@16
|
124 BinaryPredicate pred)
|
Chris@16
|
125 {
|
Chris@16
|
126 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
|
Chris@16
|
127 BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
|
Chris@16
|
128
|
Chris@16
|
129 return range_return<SinglePassRange1,re>::
|
Chris@16
|
130 pack(std::find_first_of(boost::begin(rng1), boost::end(rng1),
|
Chris@16
|
131 boost::begin(rng2), boost::end(rng2), pred),
|
Chris@16
|
132 rng1);
|
Chris@16
|
133 }
|
Chris@16
|
134
|
Chris@16
|
135 /// \overload
|
Chris@16
|
136 template< range_return_value re, class SinglePassRange1, class ForwardRange2,
|
Chris@16
|
137 class BinaryPredicate >
|
Chris@16
|
138 inline BOOST_DEDUCED_TYPENAME range_return<const SinglePassRange1,re>::type
|
Chris@16
|
139 find_first_of(const SinglePassRange1 & rng1, const ForwardRange2& rng2,
|
Chris@16
|
140 BinaryPredicate pred)
|
Chris@16
|
141 {
|
Chris@16
|
142 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
|
Chris@16
|
143 BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange2> ));
|
Chris@16
|
144
|
Chris@16
|
145 return range_return<const SinglePassRange1,re>::
|
Chris@16
|
146 pack(std::find_first_of(boost::begin(rng1), boost::end(rng1),
|
Chris@16
|
147 boost::begin(rng2), boost::end(rng2), pred),
|
Chris@16
|
148 rng1);
|
Chris@16
|
149 }
|
Chris@16
|
150
|
Chris@16
|
151 } // namespace range
|
Chris@16
|
152 using range::find_first_of;
|
Chris@16
|
153 } // namespace boost
|
Chris@16
|
154
|
Chris@16
|
155 #endif // include guard
|