remove_copy.hpp 1.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445
  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. #include <boost/concept_check.hpp>
  12. #include <boost/range/begin.hpp>
  13. #include <boost/range/end.hpp>
  14. #include <boost/range/concepts.hpp>
  15. #include <algorithm>
  16. namespace boost
  17. {
  18. namespace range
  19. {
  20. /// \brief template function remove_copy
  21. ///
  22. /// range-based version of the remove_copy std algorithm
  23. ///
  24. /// \pre SinglePassRange is a model of the SinglePassRangeConcept
  25. /// \pre OutputIterator is a model of the OutputIteratorConcept
  26. /// \pre Value is a model of the EqualityComparableConcept
  27. /// \pre Objects of type Value can be compared for equality with objects of
  28. /// InputIterator's value type.
  29. template< class SinglePassRange, class OutputIterator, class Value >
  30. inline OutputIterator
  31. remove_copy(const SinglePassRange& rng, OutputIterator out_it, const Value& val)
  32. {
  33. BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
  34. return std::remove_copy(boost::begin(rng), boost::end(rng), out_it, val);
  35. }
  36. } // namespace range
  37. using range::remove_copy;
  38. } // namespace boost
  39. #endif // include guard