1 // Copyright Neil Groves 2009. Use, modification and
2 // distribution is subject to the Boost Software License, Version
3 // 1.0. (See accompanying file LICENSE_1_0.txt or copy at
4 // http://www.boost.org/LICENSE_1_0.txt)
5 //
6 //
7 // For more information, see http://www.boost.org/libs/range/
8 //
9 #ifndef BOOST_RANGE_ALGORITHM_REMOVE_COPY_HPP_INCLUDED
10 #define BOOST_RANGE_ALGORITHM_REMOVE_COPY_HPP_INCLUDED
11
12 #include <boost/concept_check.hpp>
13 #include <boost/range/begin.hpp>
14 #include <boost/range/end.hpp>
15 #include <boost/range/concepts.hpp>
16 #include <algorithm>
17
18 namespace pdalboost
19 {
20 namespace range
21 {
22
23 /// \brief template function remove_copy
24 ///
25 /// range-based version of the remove_copy std algorithm
26 ///
27 /// \pre SinglePassRange is a model of the SinglePassRangeConcept
28 /// \pre OutputIterator is a model of the OutputIteratorConcept
29 /// \pre Value is a model of the EqualityComparableConcept
30 /// \pre Objects of type Value can be compared for equality with objects of
31 /// InputIterator's value type.
32 template< class SinglePassRange, class OutputIterator, class Value >
33 inline OutputIterator
remove_copy(const SinglePassRange & rng,OutputIterator out_it,const Value & val)34 remove_copy(const SinglePassRange& rng, OutputIterator out_it, const Value& val)
35 {
36 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
37 return std::remove_copy(pdalboost::begin(rng), pdalboost::end(rng), out_it, val);
38 }
39
40 } // namespace range
41 using range::remove_copy;
42 } // namespace pdalboost
43
44 #endif // include guard
45