Bolt
1.1
C++ template library with support for OpenCL
|
Returns the sorted result of all the elements in input. More...
Go to the source code of this file.
Namespaces | |
namespace | bolt |
Defining namespace for the Bolt project. | |
namespace | bolt::cl |
Namespace containing OpenCL related data types and functions. | |
Functions | |
template<typename RandomAccessIterator > | |
void | bolt::cl::sort (bolt::cl::control &ctl, RandomAccessIterator first, RandomAccessIterator last, const std::string &cl_code="") |
This version of sort returns the sorted result of all the elements in the RandomAccessIterator between the the first and last elements. The routine arranges the elements in an ascending order. RandomAccessIterator's value_type must provide operator < overload. | |
template<typename RandomAccessIterator > | |
void | bolt::cl::sort (RandomAccessIterator first, RandomAccessIterator last, const std::string &cl_code="") |
template<typename RandomAccessIterator , typename StrictWeakOrdering > | |
void | bolt::cl::sort (bolt::cl::control &ctl, RandomAccessIterator first, RandomAccessIterator last, StrictWeakOrdering comp, const std::string &cl_code="") |
sort returns the sorted result of all the elements in the inputIterator between the the first and last elements using the specified binary_op. You can arrange the elements in an ascending order, where the binary_op is the less<>() operator. This version of sort takes a bolt::cl::control structure as a first argument and compares objects using functor object defined by StrictWeakOrdering . | |
template<typename RandomAccessIterator , typename StrictWeakOrdering > | |
void | bolt::cl::sort (RandomAccessIterator first, RandomAccessIterator last, StrictWeakOrdering comp, const std::string &cl_code="") |
Returns the sorted result of all the elements in input.