1
- /*
1
+ /*
2
2
Copyright 2008 Adobe Systems Incorporated
3
3
4
4
Distributed under the Boost Software License, Version 1.0. (See accompanying
@@ -84,7 +84,7 @@ namespace boost { namespace algorithm {
84
84
template <
85
85
typename BidirectionalIterator, // models BidirectionalIterator
86
86
typename Pred> // models UnaryPredicate
87
- std::pair<BidirectionalIterator, BidirectionalIterator> gather
87
+ std::pair<BidirectionalIterator, BidirectionalIterator> gather
88
88
( BidirectionalIterator first, BidirectionalIterator last, BidirectionalIterator pivot, Pred pred )
89
89
{
90
90
// The first call partitions everything up to (but not including) the pivot element,
@@ -106,11 +106,11 @@ template <
106
106
typename BidirectionalRange, //
107
107
typename Pred> // Pred models UnaryPredicate
108
108
std::pair<
109
- typename boost::range_iterator<const BidirectionalRange>::type,
110
- typename boost::range_iterator<const BidirectionalRange>::type>
109
+ typename boost::range_iterator<BidirectionalRange>::type,
110
+ typename boost::range_iterator<BidirectionalRange>::type>
111
111
gather (
112
- const BidirectionalRange &range,
113
- typename boost::range_iterator<const BidirectionalRange>::type pivot,
112
+ BidirectionalRange &range,
113
+ typename boost::range_iterator<BidirectionalRange>::type pivot,
114
114
Pred pred )
115
115
{
116
116
return boost::algorithm::gather ( boost::begin ( range ), boost::end ( range ), pivot, pred );
0 commit comments