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