mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-14 15:04:09 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

add C++14 constexpr range algorithms

Browse source
This commit is contained in:
bolero-MURAKAMI 2014-04-09 18:11:40 +09:00
parent 856fb90150
commit cd16923347
57 changed files with 2022 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

35
sprout/range/algorithm/cxx14/prev_permutation.hpp Normal file
View file

@ -0,0 +1,35 @@
/*=============================================================================
Copyright (c) 2011-2014 Bolero MURAKAMI
https://github.com/bolero-MURAKAMI/Sprout
Distributed under 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)
=============================================================================*/
#ifndef SPROUT_RANGE_ALGORITHM_CXX14_PREV_PERMUTATION_HPP
#define SPROUT_RANGE_ALGORITHM_CXX14_PREV_PERMUTATION_HPP
#include <sprout/config.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/utility/forward.hpp>
#include <sprout/algorithm/cxx14/prev_permutation.hpp>
namespace sprout {
namespace range {
//
// prev_permutation
//
template<typename BidirectionalRange, typename Compare>
inline SPROUT_CXX14_CONSTEXPR bool
prev_permutation(BidirectionalRange&& rng, Compare comp) {
return sprout::prev_permutation(sprout::begin(SPROUT_FORWARD(BidirectionalRange, rng)), sprout::end(SPROUT_FORWARD(BidirectionalRange, rng)), comp);
}
template<typename BidirectionalRange>
inline SPROUT_CXX14_CONSTEXPR bool
prev_permutation(BidirectionalRange&& rng) {
return sprout::prev_permutation(sprout::begin(SPROUT_FORWARD(BidirectionalRange, rng)), sprout::end(SPROUT_FORWARD(BidirectionalRange, rng)));
}
} // namespace range
} // namespace sprout
#endif // #ifndef SPROUT_RANGE_ALGORITHM_CXX14_PREV_PERMUTATION_HPP