Server IP : 104.21.38.3 / Your IP : 172.69.176.122 Web Server : Apache System : Linux krdc-ubuntu-s-2vcpu-4gb-amd-blr1-01.localdomain 5.15.0-142-generic #152-Ubuntu SMP Mon May 19 10:54:31 UTC 2025 x86_64 User : www ( 1000) PHP Version : 7.4.33 Disable Function : passthru,exec,system,putenv,chroot,chgrp,chown,shell_exec,popen,proc_open,pcntl_exec,ini_alter,ini_restore,dl,openlog,syslog,readlink,symlink,popepassthru,pcntl_alarm,pcntl_fork,pcntl_waitpid,pcntl_wait,pcntl_wifexited,pcntl_wifstopped,pcntl_wifsignaled,pcntl_wifcontinued,pcntl_wexitstatus,pcntl_wtermsig,pcntl_wstopsig,pcntl_signal,pcntl_signal_dispatch,pcntl_get_last_error,pcntl_strerror,pcntl_sigprocmask,pcntl_sigwaitinfo,pcntl_sigtimedwait,pcntl_exec,pcntl_getpriority,pcntl_setpriority,imap_open,apache_setenv MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : ON | Pkexec : ON Directory : /www/server/mysql/src/boost/boost_1_59_0/boost/range/algorithm/ |
Upload File : |
// 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 BOOST_RANGE_ALGORITHM_PERMUTATION_HPP_INCLUDED #define BOOST_RANGE_ALGORITHM_PERMUTATION_HPP_INCLUDED #include <boost/concept_check.hpp> #include <boost/range/begin.hpp> #include <boost/range/end.hpp> #include <boost/range/concepts.hpp> #include <algorithm> namespace boost { namespace range { /// \brief template function next_permutation /// /// range-based version of the next_permutation std algorithm /// /// \pre BidirectionalRange is a model of the BidirectionalRangeConcept /// \pre Compare is a model of the BinaryPredicateConcept template<class BidirectionalRange> inline bool next_permutation(BidirectionalRange& rng) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> )); return std::next_permutation(boost::begin(rng), boost::end(rng)); } /// \overload template<class BidirectionalRange> inline bool next_permutation(const BidirectionalRange& rng) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> )); return std::next_permutation(boost::begin(rng), boost::end(rng)); } /// \overload template<class BidirectionalRange, class Compare> inline bool next_permutation(BidirectionalRange& rng, Compare comp_pred) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> )); return std::next_permutation(boost::begin(rng), boost::end(rng), comp_pred); } /// \overload template<class BidirectionalRange, class Compare> inline bool next_permutation(const BidirectionalRange& rng, Compare comp_pred) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> )); return std::next_permutation(boost::begin(rng), boost::end(rng), comp_pred); } /// \brief template function prev_permutation /// /// range-based version of the prev_permutation std algorithm /// /// \pre BidirectionalRange is a model of the BidirectionalRangeConcept /// \pre Compare is a model of the BinaryPredicateConcept template<class BidirectionalRange> inline bool prev_permutation(BidirectionalRange& rng) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> )); return std::prev_permutation(boost::begin(rng), boost::end(rng)); } /// \overload template<class BidirectionalRange> inline bool prev_permutation(const BidirectionalRange& rng) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> )); return std::prev_permutation(boost::begin(rng), boost::end(rng)); } /// \overload template<class BidirectionalRange, class Compare> inline bool prev_permutation(BidirectionalRange& rng, Compare comp_pred) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> )); return std::prev_permutation(boost::begin(rng), boost::end(rng), comp_pred); } /// \overload template<class BidirectionalRange, class Compare> inline bool prev_permutation(const BidirectionalRange& rng, Compare comp_pred) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> )); return std::prev_permutation(boost::begin(rng), boost::end(rng), comp_pred); } } // namespace range using range::next_permutation; using range::prev_permutation; } // namespace boost #endif // include guard