// Copyright Neil Groves 2009. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // // For more information, see http://www.boost.org/libs/range/ // #ifndef ACTIV_BOOST_RANGE_ALGORITHM_SET_ALGORITHM_HPP_INCLUDED #define ACTIV_BOOST_RANGE_ALGORITHM_SET_ALGORITHM_HPP_INCLUDED #include #include #include #include #include namespace Boost { namespace range { /// \brief template function includes /// /// range-based version of the includes std algorithm /// /// \pre SinglePassRange1 is a model of the SinglePassRangeConcept /// \pre SinglePassRange2 is a model of the SinglePassRangeConcept /// \pre BinaryPredicate is a model of the BinaryPredicateConcept template inline bool includes(const SinglePassRange1& rng1, const SinglePassRange2& rng2) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return std::includes(Boost::begin(rng1),Boost::end(rng1), Boost::begin(rng2),Boost::end(rng2)); } /// \overload template inline bool includes(const SinglePassRange1& rng1, const SinglePassRange2& rng2, BinaryPredicate pred) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return std::includes(Boost::begin(rng1), Boost::end(rng1), Boost::begin(rng2), Boost::end(rng2), pred); } /// \brief template function set_union /// /// range-based version of the set_union std algorithm /// /// \pre SinglePassRange1 is a model of the SinglePassRangeConcept /// \pre SinglePassRange2 is a model of the SinglePassRangeConcept /// \pre BinaryPredicate is a model of the BinaryPredicateConcept template inline OutputIterator set_union(const SinglePassRange1& rng1, const SinglePassRange2& rng2, OutputIterator out) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return std::set_union(Boost::begin(rng1), Boost::end(rng1), Boost::begin(rng2), Boost::end(rng2), out); } /// \overload template inline OutputIterator set_union(const SinglePassRange1& rng1, const SinglePassRange2& rng2, OutputIterator out, BinaryPredicate pred) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return std::set_union(Boost::begin(rng1), Boost::end(rng1), Boost::begin(rng2), Boost::end(rng2), out, pred); } /// \brief template function set_intersection /// /// range-based version of the set_intersection std algorithm /// /// \pre SinglePassRange1 is a model of the SinglePassRangeConcept /// \pre SinglePassRange2 is a model of the SinglePassRangeConcept /// \pre BinaryPredicate is a model of the BinaryPredicateConcept template inline OutputIterator set_intersection(const SinglePassRange1& rng1, const SinglePassRange2& rng2, OutputIterator out) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return std::set_intersection(Boost::begin(rng1), Boost::end(rng1), Boost::begin(rng2), Boost::end(rng2), out); } /// \overload template inline OutputIterator set_intersection(const SinglePassRange1& rng1, const SinglePassRange2& rng2, OutputIterator out, BinaryPredicate pred) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return std::set_intersection(Boost::begin(rng1), Boost::end(rng1), Boost::begin(rng2), Boost::end(rng2), out, pred); } /// \brief template function set_difference /// /// range-based version of the set_difference std algorithm /// /// \pre SinglePassRange1 is a model of the SinglePassRangeConcept /// \pre SinglePassRange2 is a model of the SinglePassRangeConcept /// \pre BinaryPredicate is a model of the BinaryPredicateConcept template inline OutputIterator set_difference(const SinglePassRange1& rng1, const SinglePassRange2& rng2, OutputIterator out) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return std::set_difference(Boost::begin(rng1), Boost::end(rng1), Boost::begin(rng2), Boost::end(rng2), out); } /// \overload template inline OutputIterator set_difference(const SinglePassRange1& rng1, const SinglePassRange2& rng2, OutputIterator out, BinaryPredicate pred) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return std::set_difference( Boost::begin(rng1), Boost::end(rng1), Boost::begin(rng2), Boost::end(rng2), out, pred); } /// \brief template function set_symmetric_difference /// /// range-based version of the set_symmetric_difference std algorithm /// /// \pre SinglePassRange1 is a model of the SinglePassRangeConcept /// \pre SinglePassRange2 is a model of the SinglePassRangeConcept /// \pre BinaryPredicate is a model of the BinaryPredicateConcept template inline OutputIterator set_symmetric_difference(const SinglePassRange1& rng1, const SinglePassRange2& rng2, OutputIterator out) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return std::set_symmetric_difference(Boost::begin(rng1), Boost::end(rng1), Boost::begin(rng2), Boost::end(rng2), out); } /// \overload template inline OutputIterator set_symmetric_difference(const SinglePassRange1& rng1, const SinglePassRange2& rng2, OutputIterator out, BinaryPredicate pred) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return std::set_symmetric_difference( Boost::begin(rng1), Boost::end(rng1), Boost::begin(rng2), Boost::end(rng2), out, pred); } } // namespace range using range::includes; using range::set_union; using range::set_intersection; using range::set_difference; using range::set_symmetric_difference; } // namespace Boost #endif // include guard