| 26 | |
| 27 | template<class T> |
| 28 | double perf_sort(const std::vector<T>& data, |
| 29 | const size_t trials, |
| 30 | compute::command_queue& queue) |
| 31 | { |
| 32 | compute::vector<T> vec(data.size(), queue.get_context()); |
| 33 | |
| 34 | perf_timer t; |
| 35 | for(size_t trial = 0; trial < trials; trial++){ |
| 36 | compute::copy(data.begin(), data.end(), vec.begin(), queue); |
| 37 | t.start(); |
| 38 | compute::sort(vec.begin(), vec.end(), queue); |
| 39 | queue.finish(); |
| 40 | t.stop(); |
| 41 | |
| 42 | if(!compute::is_sorted(vec.begin(), vec.end(), queue)){ |
| 43 | std::cerr << "ERROR: is_sorted() returned false" << std::endl; |
| 44 | } |
| 45 | } |
| 46 | return t.min_time(); |
| 47 | } |
| 48 | |
| 49 | template<class T> |
| 50 | void tune_sort(const std::vector<T>& data, |