FM / experimental

/usr/include/boost/compute/experimental/

/usr/include/boost/compute/experimental

Name	Size	Mode	Actions
clamp_range.hpp	1468	0644	edit dl rm
malloc.hpp	1449	0644	edit dl rm
sort_by_transform.hpp	1989	0644	edit dl rm
tabulate.hpp	1336	0644	edit dl rm

Edit: /usr/include/boost/compute/experimental/sort_by_transform.hpp (1989B)

//---------------------------------------------------------------------------//
// Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
//
// Distributed under the Boost Software License, Version 1.0
// See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt
//
// See http://boostorg.github.com/compute for more information.
//---------------------------------------------------------------------------//

#ifndef BOOST_COMPUTE_EXPERIMENTAL_SORT_BY_TRANSFORM_HPP
#define BOOST_COMPUTE_EXPERIMENTAL_SORT_BY_TRANSFORM_HPP

#include <iterator>

#include <boost/compute/algorithm/sort_by_key.hpp>
#include <boost/compute/algorithm/transform.hpp>
#include <boost/compute/container/vector.hpp>
#include <boost/compute/detail/iterator_range_size.hpp>
#include <boost/compute/type_traits/result_of.hpp>

namespace boost {
namespace compute {
namespace experimental {

template<class Iterator, class Transform, class Compare>
inline void sort_by_transform(Iterator first,
                              Iterator last,
                              Transform transform,
                              Compare compare,
                              command_queue &queue = system::default_queue())
{
    typedef typename std::iterator_traits<Iterator>::value_type value_type;
    typedef typename boost::compute::result_of<Transform(value_type)>::type key_type;

size_t n = detail::iterator_range_size(first, last);
    if(n < 2){
        return;
    }

const context &context = queue.get_context();

::boost::compute::vector<key_type> keys(n, context);

::boost::compute::transform(
        first,
        last,
        keys.begin(),
        transform,
        queue
    );

::boost::compute::sort_by_key(
        keys.begin(),
        keys.end(),
        first,
        compare,
        queue
    );
}

} // end experimental namespace
} // end compute namespace
} // end boost namespace

#endif // BOOST_COMPUTE_EXPERIMENTAL_SORT_BY_TRANSFORM_HPP

//---------------------------------------------------------------------------// // Copyright (c) 2013 Kyle Lutz // // Distributed under the Boost Software License, Version 1.0 // See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt // // See http://boostorg.github.com/compute for more information. //---------------------------------------------------------------------------// #ifndef BOOST_COMPUTE_EXPERIMENTAL_SORT_BY_TRANSFORM_HPP #define BOOST_COMPUTE_EXPERIMENTAL_SORT_BY_TRANSFORM_HPP #include #include #include #include #include #include namespace boost { namespace compute { namespace experimental { template inline void sort_by_transform(Iterator first, Iterator last, Transform transform, Compare compare, command_queue &queue = system::default_queue()) { typedef typename std::iterator_traits::value_type value_type; typedef typename boost::compute::result_of::type key_type; size_t n = detail::iterator_range_size(first, last); if(n < 2){ return; } const context &context = queue.get_context(); ::boost::compute::vector keys(n, context); ::boost::compute::transform( first, last, keys.begin(), transform, queue ); ::boost::compute::sort_by_key( keys.begin(), keys.end(), first, compare, queue ); } } // end experimental namespace } // end compute namespace } // end boost namespace #endif // BOOST_COMPUTE_EXPERIMENTAL_SORT_BY_TRANSFORM_HPP