Name	Size	Mode	Actions
balanced_path.hpp	6267	0644	editdlrm
binary_find.hpp	4626	0644	editdlrm
compact.hpp	2188	0644	editdlrm
copy_on_device.hpp	7382	0644	editdlrm
copy_to_device.hpp	6731	0644	editdlrm
copy_to_host.hpp	6658	0644	editdlrm
count_if_with_ballot.hpp	2605	0644	editdlrm
count_if_with_reduce.hpp	2648	0644	editdlrm
count_if_with_threads.hpp	4241	0644	editdlrm
find_extrema.hpp	2441	0644	editdlrm
find_extrema_on_cpu.hpp	5333	0644	editdlrm
find_extrema_with_atomics.hpp	4251	0644	editdlrm
find_extrema_with_reduce.hpp	18672	0644	editdlrm
find_if_with_atomics.hpp	8509	0644	editdlrm
inplace_reduce.hpp	4839	0644	editdlrm
insertion_sort.hpp	6030	0644	editdlrm
merge_path.hpp	3874	0644	editdlrm
merge_sort_on_cpu.hpp	14654	0644	editdlrm
merge_sort_on_gpu.hpp	22093	0644	editdlrm
merge_with_merge_path.hpp	7339	0644	editdlrm
radix_sort.hpp	15502	0644	editdlrm
random_fill.hpp	1880	0644	editdlrm
reduce_by_key.hpp	5243	0644	editdlrm
reduce_by_key_with_scan.hpp	23735	0644	editdlrm
reduce_on_cpu.hpp	3949	0644	editdlrm
reduce_on_gpu.hpp	10391	0644	editdlrm
scan.hpp	1545	0644	editdlrm
scan_on_cpu.hpp	7056	0644	editdlrm
scan_on_gpu.hpp	11320	0644	editdlrm
search_all.hpp	2579	0644	editdlrm
serial_accumulate.hpp	1990	0644	editdlrm
serial_count_if.hpp	2243	0644	editdlrm
serial_find_extrema.hpp	3151	0644	editdlrm
serial_merge.hpp	3504	0644	editdlrm
serial_reduce.hpp	2145	0644	editdlrm
serial_reduce_by_key.hpp	4240	0644	editdlrm
serial_scan.hpp	3184	0644	editdlrm

//---------------------------------------------------------------------------// // 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_ALGORITHM_DETAIL_INSERTION_SORT_HPP #define BOOST_COMPUTE_ALGORITHM_DETAIL_INSERTION_SORT_HPP #include #include #include #include #include #include namespace boost { namespace compute { namespace detail { template inline void serial_insertion_sort(Iterator first, Iterator last, Compare compare, command_queue &queue) { typedef typename std::iterator_traits::value_type T; size_t count = iterator_range_size(first, last); if(count < 2){ return; } meta_kernel k("serial_insertion_sort"); size_t local_data_arg = k.add_arg(memory_object::local_memory, "data"); size_t count_arg = k.add_arg("n"); k << // copy data to local memory "for(uint i = 0; i < n; i++){\n" << " data[i] = " << first[k.var("i")] << ";\n" "}\n" // sort data in local memory "for(uint i = 1; i < n; i++){\n" << " " << k.decl("value") << " = data[i];\n" << " uint pos = i;\n" << " while(pos > 0 && " << compare(k.var("value"), k.var("data[pos-1]")) << "){\n" << " data[pos] = data[pos-1];\n" << " pos--;\n" << " }\n" << " data[pos] = value;\n" << "}\n" << // copy sorted data to output "for(uint i = 0; i < n; i++){\n" << " " << first[k.var("i")] << " = data[i];\n" "}\n"; const context &context = queue.get_context(); ::boost::compute::kernel kernel = k.compile(context); kernel.set_arg(local_data_arg, local_buffer(count)); kernel.set_arg(count_arg, static_cast(count)); queue.enqueue_task(kernel); } template inline void serial_insertion_sort(Iterator first, Iterator last, command_queue &queue) { typedef typename std::iterator_traits::value_type T; ::boost::compute::less less; return serial_insertion_sort(first, last, less, queue); } template inline void serial_insertion_sort_by_key(KeyIterator keys_first, KeyIterator keys_last, ValueIterator values_first, Compare compare, command_queue &queue) { typedef typename std::iterator_traits::value_type key_type; typedef typename std::iterator_traits::value_type value_type; size_t count = iterator_range_size(keys_first, keys_last); if(count < 2){ return; } meta_kernel k("serial_insertion_sort_by_key"); size_t local_keys_arg = k.add_arg(memory_object::local_memory, "keys"); size_t local_data_arg = k.add_arg(memory_object::local_memory, "data"); size_t count_arg = k.add_arg("n"); k << // copy data to local memory "for(uint i = 0; i < n; i++){\n" << " keys[i] = " << keys_first[k.var("i")] << ";\n" " data[i] = " << values_first[k.var("i")] << ";\n" "}\n" // sort data in local memory "for(uint i = 1; i < n; i++){\n" << " " << k.decl("key") << " = keys[i];\n" << " " << k.decl("value") << " = data[i];\n" << " uint pos = i;\n" << " while(pos > 0 && " << compare(k.var("key"), k.var("keys[pos-1]")) << "){\n" << " keys[pos] = keys[pos-1];\n" << " data[pos] = data[pos-1];\n" << " pos--;\n" << " }\n" << " keys[pos] = key;\n" << " data[pos] = value;\n" << "}\n" << // copy sorted data to output "for(uint i = 0; i < n; i++){\n" << " " << keys_first[k.var("i")] << " = keys[i];\n" " " << values_first[k.var("i")] << " = data[i];\n" "}\n"; const context &context = queue.get_context(); ::boost::compute::kernel kernel = k.compile(context); kernel.set_arg(local_keys_arg, static_cast(count * sizeof(key_type)), 0); kernel.set_arg(local_data_arg, static_cast(count * sizeof(value_type)), 0); kernel.set_arg(count_arg, static_cast(count)); queue.enqueue_task(kernel); } template inline void serial_insertion_sort_by_key(KeyIterator keys_first, KeyIterator keys_last, ValueIterator values_first, command_queue &queue) { typedef typename std::iterator_traits::value_type key_type; serial_insertion_sort_by_key( keys_first, keys_last, values_first, boost::compute::less(), queue ); } } // end detail namespace } // end compute namespace } // end boost namespace #endif // BOOST_COMPUTE_ALGORITHM_DETAIL_INSERTION_SORT_HPP