| /external/sdv/vsomeip/third_party/boost/range/include/boost/range/algorithm/ |
| D | permutation.hpp | 70 inline bool prev_permutation(BidirectionalRange& rng) in prev_permutation() function
73 return std::prev_permutation(boost::begin(rng), boost::end(rng)); in prev_permutation()
78 inline bool prev_permutation(const BidirectionalRange& rng) in prev_permutation() function
81 return std::prev_permutation(boost::begin(rng), boost::end(rng)); in prev_permutation()
86 inline bool prev_permutation(BidirectionalRange& rng, Compare comp_pred) in prev_permutation() function
89 return std::prev_permutation(boost::begin(rng), boost::end(rng), in prev_permutation()
95 inline bool prev_permutation(const BidirectionalRange& rng, in prev_permutation() function
99 return std::prev_permutation(boost::begin(rng), boost::end(rng), in prev_permutation()
105 using range::prev_permutation;
|
| /external/cronet/stable/third_party/libc++/src/test/std/algorithms/alg.sorting/alg.permutation.generators/ |
| D | ranges.prev_permutation.pass.cpp | 34 concept HasPrevPermutationIt = requires(Iter first, Sent last) { std::ranges::prev_permutation(firs…
44 concept HasPrevPermutationR = requires(Range range) { std::ranges::prev_permutation(range); };
113 return std::ranges::prev_permutation(range.begin(), range.end()); in test_all_permutations()
117 return std::ranges::prev_permutation(range); in test_all_permutations()
130 std::same_as<Result> decltype(auto) result = std::ranges::prev_permutation(begin, end); in test_one()
142 std::same_as<Result> decltype(auto) result = std::ranges::prev_permutation(range); in test_one()
194 auto result = std::ranges::prev_permutation(in.begin(), in.end(), &A::comp); in test()
203 auto result = std::ranges::prev_permutation(in, &A::comp); in test()
222 auto result = std::ranges::prev_permutation(in.begin(), in.end(), {}, &A::negate); in test()
231 auto result = std::ranges::prev_permutation(in, {}, &A::negate); in test()
[all …]
|
| D | prev_permutation.pass.cpp | 47 x = std::prev_permutation(Iter(ia), Iter(ia+e)); in test()
|
| D | prev_permutation_comp.pass.cpp | 49 x = std::prev_permutation(Iter(ia), Iter(ia+e), C()); in test()
|
| /external/cronet/tot/third_party/libc++/src/test/std/algorithms/alg.sorting/alg.permutation.generators/ |
| D | ranges.prev_permutation.pass.cpp | 34 concept HasPrevPermutationIt = requires(Iter first, Sent last) { std::ranges::prev_permutation(firs…
44 concept HasPrevPermutationR = requires(Range range) { std::ranges::prev_permutation(range); };
113 return std::ranges::prev_permutation(range.begin(), range.end()); in test_all_permutations()
117 return std::ranges::prev_permutation(range); in test_all_permutations()
130 std::same_as<Result> decltype(auto) result = std::ranges::prev_permutation(begin, end); in test_one()
142 std::same_as<Result> decltype(auto) result = std::ranges::prev_permutation(range); in test_one()
194 auto result = std::ranges::prev_permutation(in.begin(), in.end(), &A::comp); in test()
203 auto result = std::ranges::prev_permutation(in, &A::comp); in test()
222 auto result = std::ranges::prev_permutation(in.begin(), in.end(), {}, &A::negate); in test()
231 auto result = std::ranges::prev_permutation(in, {}, &A::negate); in test()
[all …]
|
| D | prev_permutation.pass.cpp | 47 x = std::prev_permutation(Iter(ia), Iter(ia+e)); in test()
|
| D | prev_permutation_comp.pass.cpp | 49 x = std::prev_permutation(Iter(ia), Iter(ia+e), C()); in test()
|
| /external/sdv/vsomeip/third_party/boost/range/doc/reference/algorithm/ |
| D | prev_permutation.qbk | 6 [section:prev_permutation prev_permutation]
12 bool prev_permutation(BidirectionalRange& rng);
15 bool prev_permutation(const BidirectionalRange& rng);
18 bool prev_permutation(BidirectionalRange& rng, Compare pred);
21 bool prev_permutation(const BidirectionalRange& rng, Compare pred);
26 `prev_permutation` transforms the range of elements `rng` into the lexicographically next smaller p…
|
| /external/sdv/vsomeip/third_party/boost/range/test/algorithm_test/ |
| D | prev_permutation.cpp | 31 = std::prev_permutation(reference.begin(), reference.end()); in test_prev_permutation_impl()
33 const bool test_ret = boost::prev_permutation(test); in test_prev_permutation_impl()
42 BOOST_CHECK( test_ret == boost::prev_permutation( in test_prev_permutation_impl()
60 = std::prev_permutation(reference.begin(), reference.end(), in test_prev_permutation_pred_impl()
63 const bool test_ret = boost::prev_permutation(test, pred); in test_prev_permutation_pred_impl()
72 BOOST_CHECK( test_ret == boost::prev_permutation( in test_prev_permutation_pred_impl()
|
| /external/cronet/stable/third_party/libc++/src/include/__algorithm/ |
| D | prev_permutation.h | 59 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) { in prev_permutation() function
67 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) { in prev_permutation() function
68 return std::prev_permutation(__first, __last, __less<>()); in prev_permutation()
|
| D | ranges_prev_permutation.h | 64 constexpr inline auto prev_permutation = __prev_permutation{};
|
| /external/cronet/tot/third_party/libc++/src/include/__cxx03/__algorithm/ |
| D | prev_permutation.h | 59 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) { in prev_permutation() function
67 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) { in prev_permutation() function
68 return std::prev_permutation(__first, __last, __less<>()); in prev_permutation()
|
| D | ranges_prev_permutation.h | 68 constexpr inline auto prev_permutation = __prev_permutation::__fn{};
|
| /external/cronet/stable/third_party/libc++/src/include/__cxx03/__algorithm/ |
| D | prev_permutation.h | 59 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) { in prev_permutation() function
67 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) { in prev_permutation() function
68 return std::prev_permutation(__first, __last, __less<>()); in prev_permutation()
|
| D | ranges_prev_permutation.h | 68 constexpr inline auto prev_permutation = __prev_permutation::__fn{};
|
| /external/cronet/tot/third_party/libc++/src/include/__algorithm/ |
| D | prev_permutation.h | 59 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) { in prev_permutation() function
67 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) { in prev_permutation() function
68 return std::prev_permutation(__first, __last, __less<>()); in prev_permutation()
|
| D | ranges_prev_permutation.h | 64 constexpr inline auto prev_permutation = __prev_permutation{};
|
| /external/sdv/vsomeip/third_party/boost/phoenix/test/algorithm/ |
| D | transformation4.cpp | 80 using boost::phoenix::prev_permutation; in prev_permutation_test()
86 BOOST_TEST(prev_permutation(arg1)(array)); in prev_permutation_test()
88 BOOST_TEST(!prev_permutation(arg1)(array)); in prev_permutation_test()
92 BOOST_TEST(boost::phoenix::prev_permutation(arg1, std::greater<int>())(array)); in prev_permutation_test()
94 BOOST_TEST(!boost::phoenix::prev_permutation(arg1, std::greater<int>())(array)); in prev_permutation_test()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.permutation.generators/ |
| D | prev_permutation.pass.cpp | 47 x = std::prev_permutation(Iter(ia), Iter(ia+e)); in test()
|
| D | prev_permutation_comp.pass.cpp | 49 x = std::prev_permutation(Iter(ia), Iter(ia+e), C()); in test()
|
| /external/sdv/vsomeip/third_party/boost/phoenix/include/boost/phoenix/stl/algorithm/ |
| D | transformation.hpp | 773 struct prev_permutation struct
780 return std::prev_permutation(detail::begin_(r), detail::end_(r)); in operator ()()
786 return std::prev_permutation(detail::begin_(r), detail::end_(r), c); in operator ()()
1175 BOOST_PHOENIX_ADAPT_CALLABLE(prev_permutation, impl::prev_permutation, 1)
1176 BOOST_PHOENIX_ADAPT_CALLABLE(prev_permutation, impl::prev_permutation, 2)
|
| /external/cronet/tot/third_party/libc++/src/test/libcxx/algorithms/ |
| D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 176 (void) std::prev_permutation(it, it); in test()
177 (void) std::prev_permutation(it, it, pred); in test()
|
| /external/cronet/stable/third_party/libc++/src/test/libcxx/algorithms/ |
| D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 176 (void) std::prev_permutation(it, it); in test()
177 (void) std::prev_permutation(it, it, pred); in test()
|
| /external/cronet/stable/third_party/libc++/src/test/std/algorithms/ |
| D | robust_re_difference_type.compile.pass.cpp | 207 (void)std::prev_permutation(first, last); in all_the_algorithms()
208 (void)std::prev_permutation(first, last, std::less<void*>()); in all_the_algorithms()
|
| /external/cronet/tot/third_party/libc++/src/test/std/algorithms/ |
| D | robust_re_difference_type.compile.pass.cpp | 207 (void)std::prev_permutation(first, last); in all_the_algorithms()
208 (void)std::prev_permutation(first, last, std::less<void*>()); in all_the_algorithms()
|