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_PERMUTATION_HPP_INCLUDED
Chris@16: #define BOOST_RANGE_ALGORITHM_PERMUTATION_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 next_permutation
Chris@16: ///
Chris@16: /// range-based version of the next_permutation std algorithm
Chris@16: ///
Chris@16: /// \pre BidirectionalRange is a model of the BidirectionalRangeConcept
Chris@16: /// \pre Compare is a model of the BinaryPredicateConcept
Chris@16: template<class BidirectionalRange>
Chris@16: inline bool next_permutation(BidirectionalRange& rng)
Chris@16: {
Chris@16:     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
Chris@16:     return std::next_permutation(boost::begin(rng), boost::end(rng));
Chris@16: }
Chris@16: 
Chris@16: /// \overload
Chris@16: template<class BidirectionalRange>
Chris@16: inline bool next_permutation(const BidirectionalRange& rng)
Chris@16: {
Chris@16:     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
Chris@16:     return std::next_permutation(boost::begin(rng), boost::end(rng));
Chris@16: }
Chris@16: 
Chris@16: /// \overload
Chris@16: template<class BidirectionalRange, class Compare>
Chris@16: inline bool next_permutation(BidirectionalRange& rng, Compare comp_pred)
Chris@16: {
Chris@16:     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
Chris@16:     return std::next_permutation(boost::begin(rng), boost::end(rng),
Chris@16:                                  comp_pred);
Chris@16: }
Chris@16: 
Chris@16: /// \overload
Chris@16: template<class BidirectionalRange, class Compare>
Chris@16: inline bool next_permutation(const BidirectionalRange& rng,
Chris@16:                              Compare                   comp_pred)
Chris@16: {
Chris@16:     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
Chris@16:     return std::next_permutation(boost::begin(rng), boost::end(rng),
Chris@16:                                  comp_pred);
Chris@16: }
Chris@16: 
Chris@16: /// \brief template function prev_permutation
Chris@16: ///
Chris@16: /// range-based version of the prev_permutation std algorithm
Chris@16: ///
Chris@16: /// \pre BidirectionalRange is a model of the BidirectionalRangeConcept
Chris@16: /// \pre Compare is a model of the BinaryPredicateConcept
Chris@16: template<class BidirectionalRange>
Chris@16: inline bool prev_permutation(BidirectionalRange& rng)
Chris@16: {
Chris@16:     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
Chris@16:     return std::prev_permutation(boost::begin(rng), boost::end(rng));
Chris@16: }
Chris@16: 
Chris@16: /// \overload
Chris@16: template<class BidirectionalRange>
Chris@16: inline bool prev_permutation(const BidirectionalRange& rng)
Chris@16: {
Chris@16:     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
Chris@16:     return std::prev_permutation(boost::begin(rng), boost::end(rng));
Chris@16: }
Chris@16: 
Chris@16: /// \overload
Chris@16: template<class BidirectionalRange, class Compare>
Chris@16: inline bool prev_permutation(BidirectionalRange& rng, Compare comp_pred)
Chris@16: {
Chris@16:     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
Chris@16:     return std::prev_permutation(boost::begin(rng), boost::end(rng),
Chris@16:                                  comp_pred);
Chris@16: }
Chris@16: 
Chris@16: /// \overload
Chris@16: template<class BidirectionalRange, class Compare>
Chris@16: inline bool prev_permutation(const BidirectionalRange& rng,
Chris@16:                              Compare                   comp_pred)
Chris@16: {
Chris@16:     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
Chris@16:     return std::prev_permutation(boost::begin(rng), boost::end(rng),
Chris@16:                                  comp_pred);
Chris@16: }
Chris@16: 
Chris@16:     } // namespace range
Chris@16:     using range::next_permutation;
Chris@16:     using range::prev_permutation;
Chris@16: } // namespace boost
Chris@16: 
Chris@16: #endif // include guard