MCPcopy Create free account
hub / github.com/AdaptiveCpp/AdaptiveCpp / sort

Function sort

include/hipSYCL/algorithms/algorithm.hpp:1226–1234  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1224
1225template <class RandomIt, class Compare>
1226sycl::event sort(sycl::queue &q, RandomIt first, RandomIt last,
1227 Compare comp = std::less<>{},
1228 const std::vector<sycl::event>& deps = {}) {
1229 std::size_t problem_size = std::distance(first, last);
1230 if(problem_size == 0)
1231 return sycl::event{};
1232
1233 return sorting::bitonic_sort(q, first, last, comp, deps);
1234}
1235
1236template <class ForwardIt>
1237sycl::event is_sorted(sycl::queue &q, ForwardIt first, ForwardIt last,

Callers 2

test_sortFunction · 0.50

Calls 1

bitonic_sortFunction · 0.85

Tested by 1

test_sortFunction · 0.40