| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.nth.element/ |
| H A D | ranges_nth_element.pass.cpp | 44 std::ranges::nth_element(first, nth, last, comp); 57 std::ranges::nth_element(range, nth, comp); 106 std::same_as<Iter> decltype(auto) last = std::ranges::nth_element(b, nth, e); 121 std::same_as<Iter> decltype(auto) last = std::ranges::nth_element(range, nth); 197 auto last = std::ranges::nth_element(in.begin(), in.begin() + 1, in.end(), comp); in test() 204 auto last = std::ranges::nth_element(in, in.begin() + 1, comp); in test() 220 auto last = std::ranges::nth_element(in.begin(), in.begin() + 1, in.end(), {}, &A::a); in test() 227 auto last = std::ranges::nth_element(in, in.begin() + 1, {}, &A::a); in test() 267 auto last = std::ranges::nth_element(in.begin(), in.begin() + 1, in.end(), pred); in test() 274 auto last = std::ranges::nth_element(in, in.begin() + 1, pred); in test() [all …]
|
| H A D | nth_element.pass.cpp | 30 std::nth_element(Iter(work), Iter(work+m), Iter(work+n)); in test() 46 std::nth_element(Iter(input), Iter(input+4), Iter(input+7)); in test() 53 std::nth_element(Iter(input), Iter(input + 6), Iter(input + 8)); in test() 60 std::nth_element(Iter(input), Iter(input + 1), Iter(input + 8)); in test()
|
| H A D | nth_element_comp.pass.cpp | 31 std::nth_element(Iter(work), Iter(work+m), Iter(work+n), std::greater<T>()); in test() 47 std::nth_element(Iter(input), Iter(input+4), Iter(input+7), std::greater<T>()); in test() 54 std::nth_element(Iter(input), Iter(input + 6), Iter(input + 8), std::greater<T>()); in test() 61 std::nth_element(Iter(input), Iter(input + 1), Iter(input + 8), std::greater<T>()); in test()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | nth_element_stability.pass.cpp | 49 std::nth_element(v.begin(), v.begin() + kSize / 2, v.end()); in test_randomization() 68 std::nth_element(v.begin(), v.begin() + kSize / 2, v.end()); in test_same() 69 std::nth_element(snapshot_v.begin(), snapshot_v.begin() + kSize / 2, snapshot_v.end()); in test_same() 70 …std::nth_element(snapshot_custom_v.begin(), snapshot_custom_v.begin() + kSize / 2, snapshot_custom… in test_same() 89 std::nth_element(v.begin(), v.begin() + 5, v.end()); in test_constexpr()
|
| H A D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 160 (void) std::nth_element(it, it, it); in test() 161 (void) std::nth_element(it, it, it, pred); in test()
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 172 (void)std::ranges::nth_element(first, mid, last, Less(&copies)); assert(copies == 0); in all_the_algorithms() 173 (void)std::ranges::nth_element(a, mid, Less(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | ranges_robust_against_copying_projections.pass.cpp | 155 (void)std::ranges::nth_element(first, mid, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms() 156 (void)std::ranges::nth_element(a, mid, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
|
| /llvm-project-15.0.7/clang/test/Analysis/ |
| H A D | ptr-sort.cpp | 15 std::nth_element(V1.begin(), V1.begin() + 1, V1.end()); // no-warning in PointerSorting() 24 …std::nth_element(V2.begin(), V2.begin() + 1, V2.end()); // expected-warning {{Sorting pointer-like… in PointerSorting()
|
| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | nth_element.h | 245 void nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator … in nth_element() function 252 void nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator … in nth_element() function 253 std::nth_element(std::move(__first), std::move(__nth), std::move(__last), __less<typename in nth_element()
|
| H A D | ranges_nth_element.h | 72 inline constexpr auto nth_element = __nth_element::__fn{};
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.nonmodifying/ |
| H A D | nth_element.pass.cpp | 103 std::nth_element(first1, mid1, last1, comp); in operator ()() 104 std::nth_element(exec, first2, mid2, last2, comp); in operator ()() 154 invoke_if(exec, [&]() { nth_element(exec, iter, iter, iter, non_const(std::less<T>())); }); in operator ()()
|
| /llvm-project-15.0.7/clang/test/SemaTemplate/ |
| H A D | temp_arg_nontype_cxx1z.cpp | 311 template<size_t n, class List> struct nth_element; 312 template<size_t n, class List> constexpr auto nth_element_v = nth_element<n, List>::value; 315 struct nth_element<n, value_list<v0, vs...>> struct 317 static constexpr auto value = nth_element<n - 1, value_list<vs...>>::value; argument 320 struct nth_element<0, value_list<v0, vs...>> struct
|
| /llvm-project-15.0.7/libcxx/test/libcxx/fuzzing/ |
| H A D | nth_element.pass.cpp | 24 std::nth_element(working.begin(), partition_iter, working.end()); in LLVMFuzzerTestOneInput()
|
| /llvm-project-15.0.7/third-party/benchmark/src/ |
| H A D | statistics.cc | 43 std::nth_element(copy.begin(), center, copy.end()); in StatisticsMedian() 51 std::nth_element(copy.begin(), center2, copy.end()); in StatisticsMedian()
|
| /llvm-project-15.0.7/llvm/tools/llvm-xray/ |
| H A D | xray-account.cpp | 282 std::nth_element(Timings.begin(), Timings.begin() + MedianOff, Timings.end()); in getStats() 286 std::nth_element(Timings.begin(), Timings.begin() + (uint64_t)Pct90Off, in getStats() 291 std::nth_element(Timings.begin(), Timings.begin() + (uint64_t)Pct99Off, in getStats()
|
| H A D | xray-graph.cpp | 279 std::nth_element(begin, begin + MedianOff, end); in getStats() 282 std::nth_element(begin, begin + Pct90Off, end); in getStats() 285 std::nth_element(begin, begin + Pct99Off, end); in getStats()
|
| /llvm-project-15.0.7/pstl/ |
| H A D | README.md | 23 …orithms do not allow efficient SIMD execution: `includes`, `inplace_merge`, `merge`, `nth_element`,
|
| /llvm-project-15.0.7/libc/benchmarks/automemcpy/lib/ |
| H A D | ResultAnalyzer.cpp | 103 std::nth_element(Samples.begin(), Samples.begin() + HalfSize, Samples.end()); in processPerDistributionData()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_re_difference_type.compile.pass.cpp | 190 (void)std::nth_element(first, mid, last); in all_the_algorithms() 191 (void)std::nth_element(first, mid, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | ranges_robust_against_nonbool_predicates.pass.cpp | 135 test_mid(std::ranges::nth_element, in, mid, binary_pred); in test_all()
|
| H A D | ranges_robust_against_proxy_iterators.pass.cpp | 164 test_mid(std::ranges::nth_element, in, mid); in run_tests()
|
| /llvm-project-15.0.7/libcxx/docs/DesignDocs/ |
| H A D | DebugMode.rst | 58 partition after calling ``std::nth_element``. This effort helps migrating to potential
|
| H A D | UnspecifiedBehaviorRandomization.rst | 83 * ``std::nth_element``, there is no guarantee on the order from both sides of the
|
| /llvm-project-15.0.7/libcxx/test/std/library/description/conventions/customization.point.object/ |
| H A D | niebloid.compile.pass.cpp | 111 static_assert(test(std::ranges::nth_element, a, a+5));
|
| /llvm-project-15.0.7/libcxx/docs/Status/ |
| H A D | Cxx14Issues.csv | 51 "`2163 <https://wg21.link/lwg2163>`__","nth_element requires inconsistent post-conditions","Bristol… 145 "`2339 <https://wg21.link/lwg2339>`__","Wording issue in nth_element","Issaquah","|Complete|"
|